The mathsat5 smt solver
MathSAT is a long-term project, which has been jointly carried on by FBK-IRST and
University of Trento, with the aim of developing and maintaining a state-of-the-art SMT tool …
University of Trento, with the aim of developing and maintaining a state-of-the-art SMT tool …
The SeaHorn verification framework
In this paper, we present SeaHorn, a software verification framework. The key distinguishing
feature of SeaHorn is its modular design that separates the concerns of the syntax of the …
feature of SeaHorn is its modular design that separates the concerns of the syntax of the …
SMACK: Decoupling source language details from verifier implementations
Z Rakamarić, M Emmi - … : 26th International Conference, CAV 2014, Held …, 2014 - Springer
A major obstacle to putting software verification research into practice is the high cost of
developing the infrastructure enabling the application of verification algorithms to actual …
developing the infrastructure enabling the application of verification algorithms to actual …
Hyperkernel: Push-button verification of an OS kernel
L Nelson, H Sigurbjarnarson, K Zhang… - Proceedings of the 26th …, 2017 - dl.acm.org
This paper describes an approach to designing, implementing, and formally verifying the
functional correctness of an OS kernel, named Hyperkernel, with a high degree of proof …
functional correctness of an OS kernel, named Hyperkernel, with a high degree of proof …
Symbolic optimization with SMT solvers
The rise in efficiency of Satisfiability Modulo Theories (SMT) solvers has created numerous
uses for them in software verification, program synthesis, functional programming …
uses for them in software verification, program synthesis, functional programming …
[HTML][HTML] A unifying view on SMT-based software verification
After many years of successful development of new approaches for software verification,
there is a need to consolidate the knowledge about the different abstract domains and …
there is a need to consolidate the knowledge about the different abstract domains and …
Solving existentially quantified horn clauses
Temporal verification of universal (ie, valid for all computation paths) properties of various
kinds of programs, eg, procedural, multi-threaded, or functional, can be reduced to finding …
kinds of programs, eg, procedural, multi-threaded, or functional, can be reduced to finding …
Theta: a framework for abstraction refinement-based model checking
In this paper, we present Theta, a configurable model checking framework. The goal of the
framework is to support the design, execution and evaluation of abstraction refinement …
framework is to support the design, execution and evaluation of abstraction refinement …
Beautiful interpolants
A Albarghouthi, KL McMillan - … , CAV 2013, Saint Petersburg, Russia, July …, 2013 - Springer
We describe a compositional approach to Craig interpolation based on the heuristic that
simpler proofs of special cases are more likely to generalize. The method produces simple …
simpler proofs of special cases are more likely to generalize. The method produces simple …
[PDF][PDF] Construction of verifier combinations based on off-the-shelf verifiers
Software verifiers have different strengths and weaknesses, depending on properties of the
verification task. It is well-known that combinations of verifiers via portfolio and selection …
verification task. It is well-known that combinations of verifiers via portfolio and selection …