Skip to main content
Go to the home page of the European Commission (opens in new window)
English en
CORDIS - EU research results
CORDIS

Sparsity-guided Efficient SMT-solving for Program Verification

Project description

A scalable breakthrough to boost software verification

In the realm of software verification, Satisfiability Modulo Theories (SMT) stands as a crucial framework. However, scalability remains a significant hurdle, particularly for verifying extensive program segments. In this context, the ERC-funded SPES project aims to leverage the inherent structural sparsity in programs (reflected in their bounded treewidth and pathwidth). SPES aims to design bespoke SMT-solvers that are faster and more efficient. This approach involves decomposing control-flow graphs into smaller, manageable parts, guiding the solver with promising decision orders. As a result, the project will enhance algorithmic efficiency in satisfiability checking and variable elimination. It will pave the way for more scalable and effective software verification processes.

Objective

Satisfiability modulo theories (SMT) is a ubiquitous framework in modern software verification. It can express a significant number of classical program verification tasks, e.g. invariant generation, reachability and pre/post-conditions, in complex programs with arrays, pointers, real/integer variables, and user-defined data structures. State-of-the-art SMT solvers, such as cvc5/Z3, form the backbone of modern verification suites.

Unfortunately, SMT-based verification methods are far from perfect in terms of scalability. They are especially slow when the desired property depends on a large portion of the program, such as a function with hundreds/thousands of lines. A primary reason is that solvers are designed for *general-purpose* constraint-solving. When a program analysis tool, such as Boogie, reduces a verification task to SMT and passes it to a solver, such as Z3, the solver has no knowledge of the original program or any of its structural and sparsity properties that are inherited by the SMT instance. Thus, it spends significant time exploring unpromising solution paths or applying unproductive heuristics.

In this project, we will exploit the structural sparsity of programs to design faster bespoke SMT-solving algorithms for software verification tasks. It is well-known that control-flow graphs of structured programs are sparse and decomposable. Formally, they have bounded treewidth/pathwidth. Thus, one can successively find small cuts that decompose the graphs into parts of a small size. The idea is to guide the SMT-solver with a promising approximation or decision order based on these decompositions. This is because the SMT instance inherits the sparsity and structure of the underlying program. Thus, it can be decomposed into small parts by successively solving low-dimensional sub-instances. More specifically, this project will use the decomposition to design faster algorithms for satisfiability checking and (approximate) quantifier/variable elimination.

Fields of science (EuroSciVoc)

Keywords

Programme(s)

Topic(s)

Funding Scheme

HORIZON-ERC - HORIZON ERC Grants

See all projects funded under this funding scheme

Call for proposal

(opens in new window) ERC-2025-STG

See all projects funded under this call

Host institution

GRAN SASSO SCIENCE INSTITUTE
Net EU contribution
€ 1 470 780,06
Address
VIA FRANCESCO CRISPI 7
67100 L'Aquila
Italy
Region
Sud Abruzzo L’Aquila
Activity type
Higher or Secondary Education Establishments
Links
Total cost
€ 1 470 780,06

Beneficiaries (2)