Why waste a perfectly good abstraction?

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

Volumn 3920 LNCS, Issue , 2006, Pages 212-226

  Gurfinkel, Arie ^a   Chechik, Marsha ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SOFTWARE; FORMAL LOGIC; INFORMATION ANALYSIS; MATHEMATICAL MODELS;

BELNAP MODELS; CEGAR; FOUR-VALUED BELNAP LOGIC; YASM;

ABSTRACTING;

EID: 33745782549     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11691372_14     Document Type: Conference Paper

References (28)

1. T. Ball, A. Podelski, and S. Rajamani. "Boolean and Cartesian Abstraction for Model Checking C Programs". STTT, 5(1):49-58, 2003.
2. T. Ball and S. Rajamani. 'The SLAM Toolkit". In Proceedings of CAV'01, volume 2102 of LNCS, pages 260-264, 2001.
3. C. Barrett and S. Berezin. "CVC Lite: A New Implementation of the Cooperating Validity Checker". In Proceedings of CAV'04, volume 3114 of LNCS, pages 515-518, 2004.
4. N.D. Belnap. "A Useful Four-Valued Logic". In Dunn and Epstein, editors, Modem Uses of Multiple-Valued Logic, pages 30-56. Reidel, 1977.
5. M. Chechik, B. Devereux, and A. Gurfinkel. "χChek: A Multi-Valued Model-Checker". In Proceedings of CAV'02, volume 2404 of LNCS, pages 505-509, 2002.
6. 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.
7. E. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, 1999.
8. D. Dams, R. Gerth, and O. Grumberg. "Abstract Interpretation of Reactive Systems". ACM TOPLAS, 2(19):253-291, 1997.
9. L. de Alfaro, P. Godefroid, and R. Jagadeesan. ''Three-Valued Abstractions of Games: Uncertainty, but with Precision". In Proceedings of LICS'04, pages 170-179, 2004.
10. P. Godefroid. "Reasoning about Abstract Open Systems with Generalized Module Checking". In Proceedings of EMSOFT'2003, volume 2855 of LNCS, pages 223-240, 2003.
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 Proceedings of CAV'02, volume 2404 of LNCS, pages 137-150, 2002.
13. S. Graf and H. Saïdi. "Construction of Abstract State Graphs with PVS". In Proceedings of CAV'97, volume 1254 of LNCS, pages 72-83, 1997.
14. O. Grumberg, M. Lange, M. Leucker, and S. Shoham. "Don't Know in the μ-Calculus". In Proceedings of CAV'05, volume 3385 of LNCS, pages 233-249, 2005.
15. A. Gurfinkel and M. Chechik. "Generating Counterexamples for Multi-Valued Model-Checking". In Proceedings of FME'03, volume 2805 of LNCS, 2003.
16. A. Gurfinkel and M. Chechik. "Multi-Valued Model-Checking via Classical Model-Checking". In Proceedings of CONCUR'03, volume 2761 of LNCS, pages 263-277, 2003.
17. A. Gurfinkel and M. Chechik. "How Thorough is Thorough Enough". In Proceedings of CHARME'05, volume 3725 of LNCS, pages 65-80, 2005.
18. A. Gurfinkel, O. Wei, and M. Chechik. "Systematic Construction of Abstractions for Model-Checking". In Proceedings of VMCAI'06, volume 3855 of LNCS, pages 381-397, 2006.
19. S. Hazelhurst and C. H. Seger. "Model Checking Lattices: Using and Reasoning about Information Orders for Abstraction". Logic Journal of the IGPL, 7(3):375-411, May 1999.
20. T. Henzinger, R. Jhala, R. Majumdar, and G. Sutre. "Lazy Abstraction". In Proceedings of POPL'02, pages 58-70, 2002.
21. T. A. Henzinger, R. Jhala, R. Majumdar, and K. L. McMillan. "Abstractions from Proofs". In Proceedings of POPL'04, pages 232-244, 2004.
22. S. C. Kleene. Introduction to Metamathematics. New York: Van Nostrand, 1952.
23. D Kozen. "Results on the Propositional μ-calculus". Theoretical Computer Science, 27: 334-354, 1983.
24. K.G. Larsen and L. Xinxin. "Equation Solving Using Modal Transition Systems". In Proceedings of LICS'90, 1990.
25. C. Pasareanu, M. Dwyer. and W. Visser. "Finding Feasible Counter-examples when Model Checking Abstracted Java Programs". In Proceedings of TACAS'03, volume 2031 of LNCS, pages 284-298, 2003.
26. T.W. Reps, M. Sagiv, and R. Wilhelm. "Static Program Analysis via 3-Valued Logic". In Proceedings of CAV'04, volume 3114 of LNCS, pages 15-30, 2004.
27. S. Shoham and O. Grumberg. "Monotonic Abstraction-Refinement for CTL". In Proceedings of TACAS'04, volume 2988 of LNCS, 2004.
28. F. Somenzi. "CUDD: CU Decision Diagram Package Release", 2001.