Zapato: Automatic theorem proving for predicate abstraction refinement
From MaRDI portal
Recommendations
Cited in
(13)- Delayed theory combination vs. Nelson-Oppen for satisfiability modulo theories: a comparative analysis
- Predicate abstraction and CEGAR for \(\nu \mathrm{HFL}_\mathbb{Z}\) validity checking
- Strategies for combining decision procedures
- Efficient theory combination via Boolean search
- Distributing the workload in a lazy theorem-prover
- SAT-Based Model Checking
- Linear Arithmetic with Stars
- Zapato
- Interpolant Generation for UTVPI
- Zap: Automated Theorem Proving for Software Analysis
- An Improved Tight Closure Algorithm for Integer Octagonal Constraints
- Weakly-relational shapes for numeric abstractions: Improved algorithms and proofs of correctness
- M\textbf{ath}SAT: Tight integration of SAT and mathematical decision procedures
This page was built for publication: Zapato: Automatic theorem proving for predicate abstraction refinement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5312923)