POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Counterexample-Guided Abstraction Refinement
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
On iterating linear transformations over recognizable sets of integers
Theoretical Computer Science
Computation: finite and infinite machines
Computation: finite and infinite machines
Efficient Craig Interpolation for Linear Diophantine (Dis)Equations and Linear Modular Equations
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
TaPAS: The Talence Presburger Arithmetic Suite
TACAS '09 Proceedings of the 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009,
Accelerating interpolation-based model-checking
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Lazy abstraction with interpolants
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Abstraction refinement with craig interpolation and symbolic pushdown systems
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Craig interpolation in displayable logics
TABLEAUX'11 Proceedings of the 20th international conference on Automated reasoning with analytic tableaux and related methods
Interpolation-based software verification with WOLVERINE
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Effective word-level interpolation for software verification
Proceedings of the International Conference on Formal Methods in Computer-Aided Design
| Hi-index | 0.00 |
We present the tool Merit, a Cegar model-checker for safety properties of counter-systems, which sits in the Lazy Abstraction with Interpolants (lawi) framework lawi is parametric with respect to the interpolation technique and so is Merit Thanks to its open architecture, Merit makes it possible to experiment new refinement techniques without having to re-implement the generic, technical part of the framework In this paper, we first recall the basics of the lawi algorithm We then explain two heuristics in order to help termination of the Cegar loop: the first one presents different approaches to symbolically compute interpolants The second one focuses on how to improve the unwinding strategy We finally report our experimental results, obtained using those heuristics, on a large amount of classical models.