Proving LTL properties of bitvector programs and decompiled binaries
There is increasing interest in applying verification tools to programs that have bitvector
operations. SMT solvers, which serve as a foundation for these tools, have thus increased …
operations. SMT solvers, which serve as a foundation for these tools, have thus increased …
BFF: foundational and automated verification of bitfield-manipulating programs
Low-level systems code often needs to interact with data, such as page table entries or
network packet headers, in which multiple pieces of information are packaged together as …
network packet headers, in which multiple pieces of information are packaged together as …
Combining rule-and SMT-based reasoning for verifying floating-point Java programs in KeY
Deductive verification has been successful in verifying interesting properties of real-world
programs. One notable gap is the limited support for floating-point reasoning. This is …
programs. One notable gap is the limited support for floating-point reasoning. This is …
Counterexample-guided bit-precision selection
S He, Z Rakamarić - Programming Languages and Systems: 15th Asian …, 2017 - Springer
Static program verifiers based on satisfiability modulo theories (SMT) solvers often trade
precision for scalability to be able to handle large programs. A popular trade-off is to model …
precision for scalability to be able to handle large programs. A popular trade-off is to model …
LTL model checking of LLVM bitcode with symbolic data
P Bauch, V Havel, J Barnat - … MEMICS 2014, Telč, Czech Republic, October …, 2014 - Springer
The correctness of parallel and reactive programs is often easier specified using formulae of
temporal logics. Yet verifying that a system satisfies such specifications is more difficult than …
temporal logics. Yet verifying that a system satisfies such specifications is more difficult than …
Using SMT solvers to verify high-integrity programs
PB Jackson, BJ Ellis, K Sharp - Proceedings of the second workshop on …, 2007 - dl.acm.org
In this paper we report on our experiments in using the currently popular Smt (Sat Modulo
Theories) solvers Yices [10] and Cvc3 [1] and the Simplify theorem prover [9] to discharge …
Theories) solvers Yices [10] and Cvc3 [1] and the Simplify theorem prover [9] to discharge …
Efficient modular SMT-based model checking of pointer programs
Modularity is indispensable for scaling automatic verification to large programs. However,
modularity also introduces challenges because it requires inferring and abstracting the …
modularity also introduces challenges because it requires inferring and abstracting the …
An efficient floating-point bit-blasting API for verifying C programs
MR Gadelha, LC Cordeiro, DA Nicole - International Workshop on …, 2020 - Springer
We describe a new SMT bit-blasting API for floating-point (FP) programs and evaluate it
using different off-the-shelf SMT solvers during the verification of several C programs. The …
using different off-the-shelf SMT solvers during the verification of several C programs. The …
Deductive verification of floating-point java programs in key
Deductive verification has been successful in verifying interesting properties of real-world
programs. One notable gap is the limited support for floating-point reasoning. This is …
programs. One notable gap is the limited support for floating-point reasoning. This is …
Dartagnan: Leveraging Compiler Optimizations and the Price of Precision (Competition Contribution)
H Ponce-de-León, T Haas, R Meyer - … on Tools and Algorithms for the …, 2021 - Springer
We describe the new features of the bounded model checker Dartagnan for SV-COMP'21.
We participate, for the first time, in the ReachSafety category on the verification of sequential …
We participate, for the first time, in the ReachSafety category on the verification of sequential …