Lazy abstraction

Henzinger TA, Jhala R, Majumdar R, Sutre G. 2002. Lazy abstraction. Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages. POPL: Principles of Programming Languages, 58–70.

Download
No fulltext has been uploaded. References only!

Conference Paper | Published | English

Scopus indexed
Author
Henzinger, Thomas AISTA ; Jhala, Ranjit; Majumdar, Ritankar; Sutre, Grégoire
Abstract
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.
Publishing Year
Date Published
2002-01-01
Proceedings Title
Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Acknowledgement
We thank Wes Weimer and Jeff Foster for many useful discussions.
Page
58 - 70
Conference
POPL: Principles of Programming Languages
Conference Location
Portland, OR, USA
Conference Date
2002-01-16 – 2002-01-18
IST-REx-ID

Cite this

Henzinger TA, Jhala R, Majumdar R, Sutre G. Lazy abstraction. In: Proceedings of the 29th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. ACM; 2002:58-70. doi:10.1145/503272.503279
Henzinger, T. A., Jhala, R., Majumdar, R., & Sutre, G. (2002). Lazy abstraction. In Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (pp. 58–70). Portland, OR, USA: ACM. https://doi.org/10.1145/503272.503279
Henzinger, Thomas A, Ranjit Jhala, Ritankar Majumdar, and Grégoire Sutre. “Lazy Abstraction.” In Proceedings of the 29th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 58–70. ACM, 2002. https://doi.org/10.1145/503272.503279.
T. A. Henzinger, R. Jhala, R. Majumdar, and G. Sutre, “Lazy abstraction,” in Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, Portland, OR, USA, 2002, pp. 58–70.
Henzinger TA, Jhala R, Majumdar R, Sutre G. 2002. Lazy abstraction. Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages. POPL: Principles of Programming Languages, 58–70.
Henzinger, Thomas A., et al. “Lazy Abstraction.” Proceedings of the 29th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, ACM, 2002, pp. 58–70, doi:10.1145/503272.503279.

Export

Marked Publications

Open Data ISTA Research Explorer

Search this title in

Google Scholar
ISBN Search