Abstraction and refinement in model checking

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

Volumn 4111 LNCS, Issue , 2006, Pages 219-242

  Grumberg, Orna ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33749619141     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11804192_11     Document Type: Conference Paper

References (53)

1. T. Ball and S. Rajamani. Checking temporal properties of software with boolean programs. In In Proceedings of the Workshop on Advances in VErification (WAVE), July 2000.
2. I. Beer, S. Ben-David, C. Eisner, and A. Landver. RuleBase: an industry-oriented formal verification tool. In proceedings of the 33rd Design Automation Conference (DAC'96), pages 655-660. IEEE Computer Society Press, June 1996.
3. Dirk Beyer, Thomas A. Henzinger, Ranjit Jhala, and Rupak Majumdar. Checking memory safety with blast. In Proceedings of the International Conference on Fundamental Approaches to Software Engineering (FASE), volume 3442 of Lecture Notes in Computer Science, pages 2-18, 2005.
4. A. Biere, A. Cimatti, E. M. Clarke, M. Fujita, and Y. Zhu. Symbolic model checking using SAT procedures instead of BDDs. In proceedings of the 36rd Design Automation Conference (DAC'99). IEEE Computer Society Press, June 1999.
5. A. Biere, A. Cimatti, E. M. Clarke, and Y. Zhu. Symbolic model checking without bdds. In International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'99), number 1579 in Lecture Notes in Computer Science. Springer-Verlag, 1999.
6. M. C. Browne, E. M. Clarke, and O. Grumberg. Characterizing finite kripke structures in prepositional temporal logic. Theor.Comp.Science, 59(1-2), July 1988.
7. R. E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transaction on Computers, pages 35(8):677-691, 1986.
8. 20 states and beyond. Information and Computation, 98:142-170, 1992.
9. Sagar Chaki, Edmund Clarke, Alex Groce, Somesh Jha, and Helmut Veith. Modular verification of software components in C. In International Conference on Software Engineering (ICSE), pages 385-395, 2003.
10. P. Chauhan, E.M. Clarke, J. Kukula, S. Sapra, H. Veith, and D.Wang. Automated abstraction refinement for model checking large state spaces using SAT based conflict analysis. In Formal Methods in Computer Aided Design (FMCAD), November 2002.
11. Pankaj Chauhan, Edmund M. Clarke, and Daniel Kroening. Using SAT based image computation for reachability analysis. Technical Report CMU-CS-03-151, Carnegie Mellon University, School of Computer Science, 2003.
12. A. Cimatti, E. Clarke, F. Giunchiglia, and M. Roveri. NuSMV: a new symbolic model checker. Software Tools for Technology Transfer, 1998.
13. E. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Publishers, 1999.
14. E. M. Clarke and E. A. Emerson. Synthesis of synchronization skeletons for branching time temporal logic. In D. Kozen, editor, Logic of Programs: Workshop, Yorktown Heights, NY, May 1981, volume 131 of Lecture Notes in Computer Science. Springer-Verlag, 1981.
15. E. M. Clarke, O. Grumberg, and D. E. Long. Model checking and abstraction. In Proceedings of the Nineteenth Annual ACM Symposium on Principles of Programming Languages. Association for Computing Machinery, January 1992.
16. Edmund Clarke and Daniel Kroening. Hardware verification using ANSI-C programs as a reference. In Proceedings of ASP-DAC 2003, pages 308-311. IEEE Computer Society Press, January 2003.
17. E.M. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith. Counterexample-guided abstraction refinement. J. ACM, 50(5):752-794, 2003.
18. E.M. Clarke, A. Gupta, J. Kukula, and O. Strichman. SAT based abstraction-refinement using ILP and machine leraning techniques. In Proc. of Conference on Computer-Aided Verification (CAV), volume 2404 of Lecture Notes in Computer Science, pages 137-150, Copenhagen, Denmark, July 2002. Springer-Verlag.
19. E.M. Clarke, S. Jha, Y. Lu, and H. Veith. Tree-like counterexamples in model checking. In Seventeenth Annual IEEE Symposium on Logic In Computer Science (LICS), Copenhagen, Denmark, July 2002.
20. F. Copty, L. Fix, R. Fraer, E. Giunchiglia, G. Kamhi, A. Tacchella, and M. Y. Vardi. Benefits of bounded model checking at an industrial setting. In 13th International Conference on Computer Aided Verification (CAV'01), volume 2102 of LNCS, Paris, France, July 2001.
21. J. C. Corbett, M. B. Dwyer, J. Hatcliff, S. Laubach, C. S. Pasareanu, Robby, and H. Zheng. Bandera: extracting finite-state models from java source code. In International Conference on Software Engineering, pages 439-448, 2000.
22. D. Dams, R. Gerth, and O. Grumberg. Abstract interpretation of reactive systems. ACM Transactions on Programming Languages and System (TOPLAS), 19(2), 1997.
23. Dennis Dams and Kedar S. Namjoshi. The existence of finite abstractions for branching time model checking. In Logic in Computer Science (LICS), pages 335-344, 2004.
24. Cindy Eisner, Dana Fisman, John Havlicek, Yoad Lustig, Anthony Mclsaac, and David Van Campenhout. Reasoning with temporal logic on truncated paths. In 15th International Conference on Computer Aided Verification (CAV'03), volume 2725 of Lecture Notes in Computer Science, pages 27-39, Boulder, CO, USA, July 2003.
25. E. A. Emerson and J. Y. Halpern. "Sometimes" and "Not Never" revisited: On branching time versus linear time. J. ACM, 33(1):151-178, 1986.
26. R. Fraer, G. Kamhi, Z. Barukh, M.Y. Vardi, and L. Fix. Prioritized traversal: Efficient reachability analysis for verification and falsification. In 12th International Conference on Computer Aided Verification (CAV'00), volume 1855 of LNCS, Chicago, USA, July 2000.
27. E. Goldberg and Y. Novikov. Berkmin: A fast and robust SAT-solver. In DATE, 2002.
28. Sussanne Graf and Hassen Saidi. Construction of abstract state graphs with PVS. In Proc. of Conference on Computer-Aided Verification (CAV), volume 1254 of Lecture Notes in Computer Science, pages 72-83. Springer-Verlag, June 1997.
29. O. Grumberg and D.E. Long. Model checking and modular verification. ACM Trans. on Programming Languages and Systems, 16(3):843-871, 1994.
30. O. Grumberg, A. Schuster, and A. Yadgar. Reachability using a memory-efficient all-solutions sat solver. In Fifth Inernation Conference on Formal Methods in Computer-Aided Design (FMCAD'04), November 2004.
31. Z. Har'El and R. P. Kurshan. Software for analytical development of communications protocols. AT&T Technical Journal, 69(1):45-59, Jan.-Feb. 1990.
32. K. Havelund and T. Pressburger. Model checking JAVA programs using JAVA PathFinder. International Journal on Software Tools for Technology Transfer, 2(4):366-381, 2000.
33. G. Holzmann. Design and Validation of Computer Protocols. Prentice-Hall International Editors, 1991.
34. G. Holzmann. Logic verification of ansi-c code with SPIN. In Proceedings of the 7th international SPIN workshop, volume 1885 of LNCS, pages 131-147, 2000.
35. D. Kozen. Results on the propositional μ-calculus. TCS, 27, 1983.
36. R. P. Kurshan. Computer-Aided Verification of coordinating processes - the automata theoretic approach. Princeton University Press, Princeton, New Jersey, 1994.
37. C. Loiseaux, S. Graf, J. Sifakis, A. Bouajjani, and S. Bensalem. Property preserving abstractions for the verification of concurrent systems. Formal Methods in System Design, 6:11-45, 1995.
38. D. E. Long. Model Checking, Abstraction, and Compositional Reasoning. PhD thesis, Carnegie Mellon University, 1993.
39. J.P. Marques-Silva and Karem A. Sakallah. GRASP: A search algorithm for propositional satisfiability. IEEE Transactions on Computers, 48(5):506-521, 1999.
40. K. McMillan. Applications of craig interpolation to model checking. In 11th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), Lecture Notes in Computer Science, pages 1-12, Edinburgh, Scotland, April 2005. Springer.
41. K. L. McMillan. Symbolic Model Checking: An Approach to the State Explosion Problem. PhD thesis, Carnegie Mellon University, 1992.
42. K. L. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, 1993.
43. K. L. McMillan. Interpolation and SAT-based model checking. In CAV, volume 2725 of Lecture Notes in Computer Science, 2003.
44. Ken L. McMillan. Applying SAT methods in unbounded symbolic model checking. In Computer Aided Verification, 2002.
45. R. Milner. An algebraic definition of simulation between programs. In Proc. 2nd Int. Joint Conf. on Artificial Intelligence, pages 481-489. BCS. 1971.
46. R. Milner. An algebraic definition of simulation between programs. In Proceedings of the Second Internation Joint Conference on Artificial Intelligence, pages 481-489, September 1971.
47. M.W. Moskewicz, C.F. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: engineering an efficient SAT solver. In 39th Design Automation Conference (DAC'01), 2001.
48. D. Park. Concurrency and automata on infinite sequences. In 5th GI-Conference on Theoretical Computer Science, pages 167-183. Springer-Verlag, 1981. LNCS 104.
49. A. Pnueli. The Temporal Semantics of Concurrent Programs. Theoretical Computer Science, 13:45-60, 1981.
50. Hassen Saidi and Natarajan Shankar. Abstract and model check while you prove. In Proceedings of the eleventh International Conference on Computer-Aided Verification (CAV99), Trento, Italy, July 1999.
51. M. Sheeran, S. Singh, and G. Staalmarck. Checking safety properties using induction and a sat-solver. In Third International Conference on Formal methods in Computer-Aided Design (FMCAD'00), Austin, Texas, November 2000.
52. M. Sheeran and G. Staalmarck. A tutorial on stalmarck's proof procedure for propositional logic. Formal Methods in System Design, 16(1), January 2000.
53. Sharon Shoham and Orna Grumberg. A game-based framework for CTL counterexamples and 3-valued abstraction-refinemnet. In Proceedings of the 15th International Conference on Computer Aided Verification (CAV'03), volume 2725 of Lecture Notes in Computer Science, pages 275-287, Boulder, CO, USA, July 2003. Springer.