Handling unbounded loops with ESBMC 1.20

Authors:
Jeremy Morse;Lucas Cordeiro;Denis Nicole;Bernd Fischer
Affiliations:
Electronics and Computer Science, University of Southampton, UK;Electronic and Information Research Center, Federal University of Amazonas, Brazil;Electronics and Computer Science, University of Southampton, UK;Electronics and Computer Science, University of Southampton, UK, Department of Computer Science, Stellenbosch University, South Africa
Venue:
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Year:
2013

Citing 6
Cited 1

Checking Safety Properties Using Induction and a SAT-Solver

FMCAD '00 Proceedings of the Third International Conference on Formal Methods in Computer-Aided Design
SAT-based model checking without unrolling

VMCAI'11 Proceedings of the 12th international conference on Verification, model checking, and abstract interpretation
Verifying multi-threaded software using smt-based context-bounded model checking

Proceedings of the 33rd International Conference on Software Engineering
Automatic analysis of scratch-pad memory code for heterogeneous multicore processors

TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Context-Bounded model checking with ESBMC 1.17

TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
SMT-Based Bounded Model Checking for Embedded ANSI-C Software

IEEE Transactions on Software Engineering

Second competition on software verification

TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We extended ESBMC to exploit the combination of context-bounded symbolic model checking and k-induction to prove safety properties in single- and multi-threaded ANSI-C programs with unbounded loops. We now first try to verify by induction that the safety property holds in the system. If that fails, we search for a bounded reachable state that constitutes a counterexample.