Authors
Thomas A Henzinger, Ranjit Jhala, Rupak Majumdar, Grégoire Sutre
Publication date
2002/1/1
Journal
ACM SIGPLAN Notices
Volume
37
Issue
1
Pages
58-70
Publisher
ACM
Description
One approach to model checking software is based on the abstract-check-refine paradigm: build an abstract model, then check the desired property, and if the check fails, refine the model and start over. We introduce the concept of lazy abstraction to integrate and optimize the three phases of the abstract-check-refine loop. Lazy abstraction continuously builds and refines a single abstract model on demand, driven by the model checker, so that different parts of the model may exhibit different degrees of precision, namely just enough to verify the desired property. We present an algorithm for model checking safety properties using lazy abstraction and describe an implementation of the algorithm applied to C programs. We also provide sufficient conditions for the termination of the method.
Total citations
200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242265831181321261131161027684686164535735393728212713
Scholar articles
TA Henzinger, R Jhala, R Majumdar, G Sutre - Proceedings of the 29th ACM SIGPLAN-SIGACT …, 2002
R Majumdar, TA Henzinger, R Jhala, G Sutre - Proceedings of Conference on Principles of …, 2002
R Jhala, R Majumdar, G Sutre - 2004
T Henzinger, R Jhala, R Majumdar - Proceeding of Principles of Programming Languages …, 2002
TA Henzinger, R Jhala, R Majumdar, G Sutre - 2002
T Henzinger - Proceedings of the 29th Annual Symposium on …