Combinations of model checking and theorem proving

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

Volumn 1794, Issue , 2000, Pages 151-170

  Uribe, Tomás E ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL VERIFICATION; THEOREM PROVING;

ALGORITHMIC VERIFICATION; DEDUCTIVE VERIFICATION; DEGREE OF AUTOMATION; NUMBER OF METHODS; PAPER SURVEYS; REACTIVE SYSTEM;

MODEL CHECKING;

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

References (58)

1. R. Alur and T. A. Henzinger, editors. Proc. 8th Intl. Conf. on Computer Aided Verification, vol. 1102 of LNCS. Springer, July 1996.
2. C. Barrett, D. L. Dill, and J. Levitt. Validity checking for combinations of theories with equality. In 1st Intl. Conf. on Formal Methods in Computer-Aided Design, vol. 1166 of LNCS, pp. 187-201, Nov. 1996.
3. S. Bensalem, Y. Lakhnech, and S. Owre. Computing abstractions of infinite state systems compositionally and automatically. In Proc. 10th Intl. Conf. on Computer-Aided Verification, vol. 1427 of LNCS, pp. 319-331. Springer, July 1998.
4. S. Berezin and A. Groce. SyMP: The User’s Guide. Comp. Sci. Department, Carnegie-Mellon Univ., Jan. 2000.
5. A. Biere, A. Cimatti, E. M. Clarke, M. Fujita, and Y. Zhu. Symbolic model checking using SAT procedures instead of BDDs. In Design Autom. Conf. (DAC’99), 1999.
6. N. S. Bjørner. Integrating Decision Procedures for Temporal Verification. PhD thesis, Comp. Sci. Department, Stanford Univ., Nov. 1998.
7. N. S. Bjørner, A. Browne, E. S. Chang, M. Colon, A. Kapur, Z. Manna, H. B. Sipma, and T. E. Uribe. STeP: Deductive-algorithmic verification of reactive and real-time systems. In [1], pp. 415-418.
8. N. S. Bj0rner, A. Browne, and Z. Manna. Automatic generation of invariants and intermediate assertions. Theoretical Comp. Sci., 173(1):49-87, Feb. 1997.
9. N. S. Bj0rner, M. E. Stickel, and T. E. Uribe. A practical integration of first-order reasoning and decision procedures. In Proc. of the 14th Intl. Conf. on Automated Deduction, vol. 1249 of LNCS, pp. 101-115. Springer, July 1997.
10. J. C. Bradfield and C. Stirling. Local model checking for infinite state spaces. Theoretical Comp. Sci., 96(1):157-174, Apr. 1992.
11. A. Browne, Z. Manna, and H. B. Sipma. Generalized temporal verification diagrams. In 15th Conf. on the Foundations of Software Technology and Theoretical Comp. Sci., vol. 1026 of LNCS, pp. 484-498. Springer, 1995.
12. R. E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers, C-35(8):677-691, Aug. 1986.
13. T. Bultan, R. Gerber, and W. Pugh. Symbolic model checking of infinite state systems using Presburger arithmetic. In Grumberg [29], pp. 400-411.
14. E. M. Clarke and E. A. Emerson. Design and synthesis of synchronization skeletons using branching time temporal logic. In Proc. IBM Workshop on Logics of Programs, vol. 131 of LNCS, pp. 52-71. Springer, 1981.
15. E. M. Clarke, M. Fujita, and X. Zhao. Hybrid decision diagrams. Overcoming the limitations of MTBDDs and BMDs. In IEEE/ACM Intl. Conf. on Computer-Aided Design, pp. 159-163, Nov. 1995.
16. E. M. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, Dec. 1999.
17. M. A. Colon and T. E. Uribe. Generating finite-state abstractions of reactive systems using decision procedures. In Proc. 10th Intl. Conf. on Computer Aided Verification, vol. 1427 of LNCS, pp. 293-304. Springer, July 1998.
18. P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In 4th ACM Symp. Princ. of Prog. Lang., pp. 238-252. ACM Press, 1977.
19. W. Damm, O. Grumberg, and H. Hungar. What if model checking must be truly symbolic. In TACAS’95, vol. 1019 of LNCS, pp. 230-244. Springer, May 1995.
20. D. R. Dams. Abstract Interpretation and Partition Refinement for Model Checking. PhD thesis, Eindhoven Univ. of Technology, July 1996.
21. S. Das, D. L. Dill, and S. Park. Experience with predicate abstraction. In Proc. 11th Intl. Conf. on Computer Aided Verification, vol. 1633 of LNCS. Springer, 1999.
22. L. de Alfaro and Z. Manna. Temporal verification by diagram transformations. In [1], pp. 287-299.
23. D. L. Detlefs, K. R. M. Leino, G. Nelson, and J. B. Saxe. Extended static checking. Tech. Report 159, Compaq SRC, Dec. 1998.
24. D. L. Dill. The Murj verification system. In [1], pp. 390-393.
25. J. Dingel and T. Filkorn. Model checking of infinite-state systems using data ab­straction, assumption-commitment style reasoning and theorem proving. In Proc. 7th Intl. Conf. on Computer Aided Verif., vol. 939 of LNCS, pp. 54-69, July 1995.
26. E. A. Emerson and K. S. Namjoshi. On model checking for non-deterministic infinite-state systems. In Proc. 13th IEEE Symp. Logic in Comp. Sci., pp. 70-80. IEEE Press, 1998.
27. B. Finkbeiner, Z. Manna, and H. B. Sipma. Deductive verification of modular systems. In COMPOS’97, vol. 1536 of LNCS, pp. 239-275. Springer, Dec. 1998.
28. S. Graf and H. Saidi. Construction of abstract state graphs with PVS. In Grumberg [29], pp. 72-83.
29. O. Grumberg, editor. Proc. 9th Intl. Conf. on Computer Aided Verification, vol. 1254 of LNCS. Springer, June 1997.
30. T. A. Henzinger and P. Ho. HyTech: The Cornell hybrid technology tool. In Hybrid Systems II, vol. 999 of LNCS, pp. 265-293. Springer, 1995.
31. T. A. Henzinger and R. Majumdar. A classification of symbolic transition systems. In Proc. of the 17th Intl. Conf. on Theoretical Aspects of Comp. Sci. (STACS 2000), LNCS. Springer, 2000.
32. G. J. Holzmann. Design and Validation of Computer Protocols. Prentice Hall, Engelwood Cliffs, NJ, 1991.
33. H. Hungar. Combining model checking and theorem proving to verify parallel processes. In Proc. 5th Intl. Conf. on Computer Aided Verification, vol. 697 of LNCS, pp. 154-165. Springer, 1993.
34. D. Jackson and C. A. Damon. Nitpick reference manual. Tech. report, Carnegie- Mellon Univ., 1996.
35. R. B. Jones, J. U. Skakkebæk, and D. L. Dill. Reducing manual abstraction in formal verification of out-of-order execution. In G. Gopalakrishnan and P. Windley, editors, 2nd Intl. Conf. on Formal Methods in Computer-Aided Design, vol. 1522 of LNCS, pp. 2-17, Nov. 1998.
36. Y. Kesten, O. Maler, M. Marcus, A. Pnueli, and E. Shahar. Symbolic model checking with rich assertional languages. In Grumberg [29], pp. 424-435.
37. Y. Kesten and A. Pnueli. Modularization and abstraction: The keys to practical formal verification. In Mathematical Foundations of Comp. Sci., vol. 1450 of LNCS, pp. 54-71, Aug. 1998.
38. R. P. Kurshan and L. Lamport. Verification of a multiplier: 64 bits and beyond. In Proc. 5th Intl. Conf. on Computer Aided Verification, vol. 697 of LNCS, pp. 166-179. Springer, 1993.
39. 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:1-35, 1995.
40. M. Lowry and M. Subramaniam. Abstraction for analytic verification of concurrent software systems. In Symp. on Abstraction, Reformulation, and Approx., May 1998.
41. Z. Manna, A. Browne, H. B. Sipma, and T. E. Uribe. Visual abstractions for temporal verification. In A. Haeberer, editor, Algebraic Methodology and Software Technology (AMAST’98), vol. 1548 of LNCS, pp. 28-41. Springer, Dec. 1998.
42. Z. Manna and A. Pnueli. Completing the temporal picture. Theoretical Comp. Sci., 83(1):97-130, 1991.
43. Z. Manna and A. Pnueli. Temporal verification diagrams. In M. Hagiya and J. C. Mitchell, editors, Proc. Intl. Symp. on Theoretical Aspects of Computer Software, vol. 789 of LNCS, pp. 726-765. Springer, 1994.
44. Z. Manna and A. Pnueli. Temporal Verification of Reactive Systems: Safety. Sprin­ger, New York, 1995.
45. K. L. McMillan. Symbolic Model Checking. Kluwer Academic Pub., 1993.
46. O. Muller and T. Nipkow. Combining model checking and deduction for I/O- automata. In TACAS’95, vol. 1019 of LNCS, pp. 1-12. Springer, May 1995.
47. S. Owre, S. Rajan, J. M. Rushby, N. Shankar, and M. K. Srivas. PVS: Combining specification, proof checking, and model checking. In [1], pp. 411-414.
48. A. Pnueli. The temporal logic of programs. In Proc. 18th IEEE Symp. Found. of Comp. Sci., pp. 46-57. IEEE Computer Society Press, 1977.
49. A. Pnueli and E. Shahar. A platform for combining deductive with algorithmic verification. In [1], pp. 184-195.
50. J. Queille and J. Sifakis. Specification and verification of concurrent systems in CESAR. In M. Dezani-Ciancaglini and U. Montanari, editors, Intl. Symp. on Programming, vol. 137 of LNCS, pp. 337-351. Springer, 1982.
51. S. Rajan, N. Shankar, and M. K. Srivas. An integration of model checking with automated proof checking. In Proc. 7th Intl. Conf. on Computer Aided Verification, vol. 939 of LNCS, pp. 84-97, July 1995.
52. J. Rushby. Integrated formal verification: Using model checking with automated abstraction, invariant generation, and theorem proving. In Theoretical and Prac­tical Aspects of SPIN Model Checking, vol. 1680 of LNCS, pp. 1-11, July 1999.
53. V. Rusu and E. Singerman. On proving safety properties by integrating static analysis, theorem proving and abstraction. In TACAS’99, vol. 1579 of LNCS. Springer, Mar. 1999.
54. H. Saidi and N. Shankar. Abstract and model check while you prove. In Proc. 11th Intl. Conf. on Computer Aided Verification, vol. 1633 of LNCS. Springer, 1999.
55. D. A. Schmidt and B. Steffen. Program analysis as model checking of abstract interpretations. In Proc. 5th Static Analysis Symp., LNCS. Springer, Sept. 1998.
56. H. B. Sipma. Diagram-based Verification of Discrete, Real-time and Hybrid Sy­stems. PhD thesis, Comp. Sci. Department, Stanford Univ., Feb. 1999.
57. H. B. Sipma, T. E. Uribe, and Z. Manna. Deductive model checking. Formal Methods in System Design, 15(1):49-74, July 1999.
58. T. E. Uribe. Abstraction-based Deductive-Algorithmic Verification of Reactive Sy­stems. PhD thesis, Comp. Sci. Department, Stanford Univ., Dec. 1998. Tech. Report STAN-CS-TR-99-1618.