(Enter summary)
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... (Update)
Cited by: More
Proving That Programs Eventually Do Something Good - Ron Cook Microsoft
(Correct)
Verifying Concurrent Message-Passing - Programs With Recursive
(Correct)
A Next-Generation Platform for Analyzing Executables - Reps Balakrishnan Lim
(Correct)
Similar documents (at the sentence level):
57.6%: Lazy Abstraction - Thomas Henzinger Ranjit (2002)
(Correct)
Active bibliography (related documents): More All
0.5: Using Forward Reachability Analysis for.. - Abdulla.. (2004)
(Correct)
0.0: Refining Approximations in Software Predicate Abstraction - Ball, Cook, Das, Rajamani (2004)
(Correct)
0.0: Software Tools for Technology Transfer manuscript No. - Will Be Inserted
(Correct)
Similar documents based on text: More All
1.2: Abstractions from Proofs - Thomas Henzinger Ranjit (2004)
(Correct)
1.0: Software Verification with BLAST - Henzinger, Jhala, Majumdar, Sutre (2003)
(Correct)
0.9: Counterexample-guided Control - Henzinger, Jhala, Majumdar (2003)
(Correct)
Related documents from co-citation: More All
42: Construction of abstract state graphs with pvs
- Graf, Saidi - 1997
35: Model Checking
- Clarke, Grumberg et al. - 1994
33: Counterexample-guided abstraction refinement
- Clarke, Grumberg et al. - 2000
BibTeX entry: (Update)
T. A. Henzinger, R. Jhala, and R. Majumdar. Lazy abstraction. In Proceedings of the 29th Annual January 2002. http://citeseer.ist.psu.edu/article/henzinger02lazy.html More
@inproceedings{ henzinger02lazy,
author = "Thomas A. Henzinger and Ranjit Jhala and Rupak Majumdar and Gregoire Sutre",
title = "Lazy abstraction",
booktitle = "Symposium on Principles of Programming Languages",
pages = "58--70",
year = "2002",
url = "citeseer.ist.psu.edu/article/henzinger02lazy.html" }
Citations (may not include all citations):
1399
Compilers: Principles (context) - Aho, Sethi et al. - 1986
666
Theoretical Computer Science (context) - Alur, Dill et al. - 1994
108
Automatically validating temporal safety properties of inter..
- Ball, Rajamani - 2057
107
Automatic predicate abstraction of C programs
- Ball, Majumdar et al. - 2001
41
Boolean and Cartesian abstractions for model checking C prog..
- Ball, Podelski et al. - 2031
2
Symbolic veri (context) - Boigelot, Godefroid
http://www.eecs.berkeley.edu/
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.eecs.berkeley.edu/~rupak/publications.shtml): More
Automatic Predicate Abstraction of C Programs - Ball, Majumdar, Millstein.. (2001)
(Correct)
Symbolic Algorithms for Infinite-State Games - de Alfaro, Henzinger, Majumdar (2001)
(Correct)
Quantitative Solution of Omega-Regular Games - de Alfaro, Majumdar (2001)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC