Incompleteness, counterexamples, and refinements in abstract model-checking

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2126 LNCS, Issue , 2001, Pages 356-373

  Giacobazzi, Roberto ^a   Quintarelli, Elisa ^a,b  

^a UNIVERSITY OF VERONA   (Italy)

^b POLITECNICO DI MILANO   (Italy)

Author keywords

Abstract interpretation; Completeness; Domain refinement; Model checking; Program analysis; Verification

Indexed keywords

ABSTRACTING; REFINING; STATIC ANALYSIS; VERIFICATION;

ABSTRACT DOMAINS; ABSTRACT INTERPRETATIONS; ABSTRACT MODEL-CHECKING; COMPLETENESS; DOMAIN REFINEMENT; FORWARD-AND-BACKWARD; PROGRAM ANALYSIS; STATIC PROGRAM ANALYSIS;

MODEL CHECKING;

EID: 84890021811     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-47764-0_20     Document Type: Conference Paper

References (22)

1. E. M. Clarke, E. A. Emerson, and A. P. Sistla. Automatic verification of finite-state concurrent system using temporallogic specification. ACM Trans. Program. Lang. Syst., 8(2): 244-263, 1986.
2. E. M. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith. Counterexample-guided abstraction refinement. In Proc. of the 12th Internat. Conf. on Computer Aided Verification (CAV '00), Volume 1855 of Lecture Notes in Computer Science, pages 154-169. Springer-Verlag, Berlin, 2000.
3. E. M. Clarke, O. Grumberg, and D. E. Long. Model checking and abstraction. ACM Trans. Program. Lang. Syst., 16(5): 1512-1542, 1994.
4. P. Cousot. Types as abstract interpretations (Invited Paper). In Conference Record of the 24th ACM Symp. on Principles of Programming Languages (POPL '97), pages 316-331. ACM Press, New York, 1997.
5. P. Cousot. Partialcompleteness of abstract fixpoint checking, invited paper. In Proceedings of the Fourth International Symposium on Abstraction, Reformulations and Approximation, SARA'2000, Lecture Notes in Artificial Intelligence 1864, pages 1-25, Horseshoe Bay, Texas, USA, 26-29 July 2000. Springer-Verlag, Berlin, Germany.
6. P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Conference Record of the 4th ACM Symp. on Principles of Programming Languages (POPL'77), pages 238-252. ACM Press, New York, 1977.
7. P. Cousot and R. Cousot. Systematic design of program analysis frameworks. In Conference Record of the 6th ACM Symp. on Principles of Programming Languages (POPL '79), pages 269-282. ACM Press, New York, 1979.
8. P. Cousot and R. Cousot. Refining modelchecking by abstract interpretation. Automated Software Engineering, 6(1): 69-95, 1999.
9. P. Cousot and R. Cousot. Temporalabstract interpretation. In Conf erence Record of the Twentyseventh Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 12-25, Boston, Mass., January 2000. ACM Press, New York, NY.
10. D. Dams, R. Gerth, and O. Grumberg. Abstract interpretation of reactive systems. ACM Trans. Program. Lang. Syst., 19(2): 253-291, 1997.
11. E. A. Emerson. Temporaland modallogic. In J. van Leeuwen, editor, Handbook of T heoretical Computer Science, volume B: Formal Models and Semantics. Elsevier, Amsterdam and The MIT Press, Cambridge, Mass., 1990.
12. G. Filé, R. Giacobazzi, and F. Ranzato. A unifying view of abstract domain design. ACM Comput. Surv., 28(2): 333-336, 1996.
13. R. Giacobazzi and F. Ranzato. Refining and compressing abstract domains. In P. Degano, R. Gorrieri, and A. Marchetti-Spaccamela, editors, Proc. of the 24th Internat. Colloq. on Automata, Languages and Programming (ICALP '97), Volume 1256 of Lecture Notes in Computer Science, pages 771-781. Springer-Verlag, Berlin, 1997.
14. R. Giacobazzi, F. Ranzato, and F. Scozzari. Making abstract interpretation complete. Journal of the ACM, 47(2): 361-416, March 2000.
15. C. Loiseaux, S. Graf, J. Sifakis, A. Bouajjani, and S. Bensalem. Property preserving abstractions for the verification of concurrent systems. Formal Methods Syst. Des., 6: 1-36, 1995.
16. Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems. Springer-Verlag, Berlin, 1992.
17. M. Müller-Olm, D. Schmidt, and B. Steffen. Model-checking. A tutorial introduction. In G. Filé, editor, Proceedi ngs of the International S tatic Analysis Symposium (SAS '99), Volume 1694 of Lecture Notes in Computer Science, pages 330-354. Springer-Verlag, Berlin, 1999.
18. A. Mycroft. Completeness and predicate-based abstract interpretation. In Proc. of the ACM Symp. on Partial Evaluation and Program Manipulation (PEPM '93), pages 179-185. ACM Press, New York, 1993.
19. F. Ranzato. On the completeness of model checking. In Proc. of European Symposium on Programming (ESOP '01), Lecture Notes in Computer Science. Springer Verlag, Berlin, 2001.
20. D. A. Schmidt. Data flow analysis is model checking of abstract interpretation. In Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (POPL '98), pages 38-48. ACM Press, New York, 1998.
21. D. A. Schmidt. Trace-based abstract interpretation of operationalsemantics. Lisp and Symbolic Computation, 10(3): 237-271, 1998.
22. B. Steffen. Data flow analysis as model checking. In A. Meyer, editor, Proc. of Theoretical aspects of computer software (TACS'91), Volume 526 of Lecture Notes in Computer Science, pages 346-364. Springer-Verlag, Berlin, 1991.