How thorough Is thorough enough?

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

Volumn 3725 LNCS, Issue , 2005, Pages 65-80

  Gurfinkel, Arie ^a   Chechik, Marsha ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTION; ABSTRACTION REFINEMENT FRAMEWORKS; MODEL-CHECKING;

ABSTRACTING; COMPUTER SCIENCE; ITERATIVE METHODS; MATHEMATICAL MODELS; SEMANTICS;

PROBLEM SOLVING;

EID: 33646395087     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11560548_8     Document Type: Conference Paper

References (22)

1. T. Ball, A. Podelski, and S. Rajamani. "Boolean and Cartesian Abstraction for Model Checking C Programs". In TACAS'01, volume 2031 of LNCS, pages 268-283, 2001.
2. G. Bruns and P. Godefroid. "Model Checking Partial State Spaces with 3-Valued Temporal Logics". In CAV'99, volume 1633 of LNCS, pages 274-287, 1999.
3. G. Bruns and P. Godefroid. "Generalized Model Checking: Reasoning About Partial State Spaces". In CONCUR'00, volume 1877 of LNCS, pages 168-182, 2000.
4. M. Chechik, B. Devereux, S. Easterbrook, and A. Gurfinkel. "Multi-Valued Symbolic Model-Checking". ACM Trans. on Soft. Eng. and Methodology, 12(4): 1-38, 2003.
5. E. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith. " Counterexample-Guided Abstraction Refinement for Symbolic Model Checking". Journal of the ACM, 50(5):752-794, 2003.
6. E. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, 1999.
7. E.M. Clarke, E.A. Emerson, and A.P. Sistla. "Automatic Verification of Finite-State Concurrent Systems Using Temporal Logic Specifications". ACM Trans. on Prog. Lang, and Systems, 8(2):244-263, 1986.
8. P. Cousot and R. Cousot. "Abstract Interpretation: A Unified Lattice Model For Static Analysis of Programs by Construction or Approximation of Fixpoints". In Proceedings of the 4th POPL, pages 238-252, Los Angeles, California, 1977.
9. D. Dams, R. Gerth, and O. Grumberg. "Abstract Interpretation of Reactive Systems". ACM Trans. on Prog, Lang, and Systems, 2(19):253-291, 1997.
10. T. French. "Decidability of Quantifed Prepositional Branching Time Logics". In AI'01, volume 2256 of LNCS, pages 165-176, 2001.
11. P. Godefroid, M. Huth, and R. Jagadeesan. "Abstraction-Based Model Checking Using Modal Transition Systems". In Proceedings of CONCUR'01, volume 2154 of LNCS, pages 426-440, 2001.
12. P. Godefroid and R. Jagadeesan. "Automatic Abstraction Using Generalized Model-Checking". In CAV'02, volume 2404 of LNCS, pages 137-150, 2002.
13. P. Godefroid and R. Jagadeesan. "On the Expressiveness of 3-Valued Models". In VM-CAI'03, volume 2575 of LNCS, pages 206-222, 2003.
14. S. Graf and H. Saïdi. "Construction of Abstract State Graphs with PVS". In CAV'97, volume 1254 of LNCS, 1997.
15. A. Gurfinkel and M. Chechik. "Generating Counterexamples for Multi-Valued Model-Checking". In FME'03, volume 2805 of LNCS, 2003.
16. A. Gurfinkel and M. Chechik. "Multi-Valued Model-Checking via Classical Model-Checking". In CONCUR'03, volume 2761 of LNCS, 2003.
17. A. Gurfinkel and M. Chechik. "Extending Extended Vacuity". In FMCAD'04, volume 3312 of LNCS, pages 306-321, 2004.
18. S. C. Kleene. Introduction to Metamathematics. New York: Van Nostrand, 1952.
19. O. Kupferman. "Augmenting Branching Temporal Logics with Existential Quantification over Atomic Propositions". J of Logic and Computation, 7:1-14, 1997.
20. R. Milner. "An Algebraic Definition of Simulation between Programs". In AI'71, pages 481-489, 1971.
21. M. Müller-Olm, D. Schmidt, and B. Steffen. "Model-Checking: A Tutorial Introduction". In SAS'99, volume 1694 of LNCS, pages 330-354, 1999.
22. S. Shoham and O. Grumberg. "A Game-Based Framework for CTL Counter-Examples and 3-Valued Abstraction-Refinement". In CAV'03, volume 2725 of LNCS, pages 275-287, 2003.