Handling unbounded loops with ESBMC 1.20

Morse, Jeremy, Cordeiro, Lucas, Nicole, Denis and Fischer, Bernd, (2013) Handling unbounded loops with ESBMC 1.20 Piterman, Nir and Smolka, Scott A. (eds.) In Tools and Algorithms for the Construction and Analysis of Systems. 19th International Conference, TACAS 2013, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2013, Rome, Italy, March 16-24, 2013. Proceedings. vol. 7795, Springer., pp. 619-622. (doi:10.1007/978-3-642-36742-7_47).


Full text not available from this repository.


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.

Item Type: Conference or Workshop Item (Paper)
Digital Object Identifier (DOI): doi:10.1007/978-3-642-36742-7_47
ISBNs: 9783642367410 (print)
9783642367427 (electronic)
ISSNs: 0302-9743 (electronic)
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Organisations: Electronics & Computer Science
ePrint ID: 354724
Date :
Date Event
Date Deposited: 18 Jul 2013 09:21
Last Modified: 17 Apr 2017 15:14
Further Information:Google Scholar
URI: http://eprints.soton.ac.uk/id/eprint/354724

Actions (login required)

View Item View Item