State/event-based software model checking

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

Volumn 2999, Issue , 2004, Pages 128-147

  Chaki, Sagar ^a   Clarke, Edmund M ^a   Ouaknine, Joël ^a   Sharygina, Natasha ^a   Sinha, Nishant ^a  

^a Carnegie Mellon University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

C (PROGRAMMING LANGUAGE); COMPUTER OPERATING SYSTEMS; DISTRIBUTED COMPUTER SYSTEMS; FORMAL METHODS; OPEN SOURCE SOFTWARE; OPEN SYSTEMS; SPECIFICATION LANGUAGES; SPECIFICATIONS; TEMPORAL LOGIC;

COMPOSITIONAL REASONING; CONCURRENT SOFTWARE SYSTEMS; COUNTEREXAMPLE-GUIDED ABSTRACTION REFINEMENT; OPEN SOURCE IMPLEMENTATION; REAL TIME OPERATING SYSTEM; SOFTWARE MODEL CHECKING; STATE BASED APPROACHES; VERIFICATION TECHNIQUES;

MODEL CHECKING;

EID: 21244481937     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24756-2_8     Document Type: Article

References (47)

1. [ACFM85] T. S. Anantharaman, E. M. Clarke, M. J. Foster, and B. Mishra. Compiling path expressions into VLSI circuits. In Proceedings of POPL, pages 191-204, 1985.
2. [BLA] BLAST website. http://www-cad.eecs.berkeley.edu/~rupalc/blast.
3. [BLO98] S. Bensalem, Y. Lakhnech, and S. Owre. Computing abstractions of infinite state systems compositionally and automatically. In Proceedings of CAV, volume 1427, pages 319-331. Springer LNCS, 1998.
4. [BMMR01] T. Ball, R. Majumdar, T. D. Millstein, and S. K. Rajamani. Automatic predicate abstraction of C programs. In SIGPLAN Conference on Programming Language Design and Implementation, pages 203-213, 2001.
5. [BR01] T. Ball and S. K. Rajamani. Automatically validating temporal safety properties of interfaces. In Proceedings of SPIN, volume 2057, pages 103-122. Springer LNCS, 2001.
6. [Bro89] M. C. Browne. Automatic verification of finite state machines using temporal logic. PhD thesis, Carnegie Mellon University, 1989. Technical report no. CMU-CS-89-117.
7. [BS01] J. Bradfield and C. Stirling. Modal Logics and Mu-Calculi : An Introduction, pages 293-330. Handbook of Process Algebra. Elsevier, 2001.
8. [Bur92] J. Burch. Trace algebra for automatic verification of real-time concurrent systems. PhD thesis, Carnegie Mellon University, 1992. Technical report no. CMU-CS-92-179.
9. +03] S. Chaki, E. M. Clarke, A. Groce, S. Jha, and H. Veith. Modular verification of software components in C. In Proceedings of ICSE 2003, pages 385-395, 2003.
10. +02] P. Chauhan, E. M. Clarke, J. H. Kukula, S. Sapra, H. Veith, and D. Wang. Automated abstraction refinement for model checking large state spaces using SAT based conflict analysis. In Proceedings of FMCAD, pages 33-51, 2002.
11. +00] J. C. Corbett, M. B. Dwyer, J. Hatcliff, S. Laubach, C. S. Pǎsǎreanu, Robby, and H. Zheng. Bandera: extracting finite-state models from Java source code. In Proceedings of ICSE, pages 439-448. IEEE Computer Society, 2000.
12. [CE81] E. M. Clarke and E. A. Emerson. Design and synthesis of synchronization skeletons using branching time temporal logic. Lecture Notes in Computer Science, 131, 1981.
13. [CES86] E. M. Clarke, E. A. Emerson, and A. P. Sistla. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages and Systems, 8(2):244-263, 1986.
14. +00] E. M. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith. Counterexampleguided abstraction refinement. In Computer Aided Verification, pages 154-169, 2000.
15. [CGKS02] E. M. Clarke, A. Gupta, J. H. Kukula, and O. Shrichman. SAT based abstraction-refinement using ILP and machine learning techniques. In Proceedings of CAV, pages 265-279, 2002.
16. [CGP99] E. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, December 1999.
17. [CGP03] J. M. Cobleigh, D. Giannakopoulou, and C. S. Pǎsǎ reanu. Learning assumptions for compositional verification. In Proceedings of TACAS, volume 2619, pages 331-346. Springer LNCS, 2003.
18. [COYC03] S. Chaki, J. Ouaknine, K. Yorav, and E. M. Clarke. Automated compositional abstraction refinement for concurrent C programs: A two-level approach. In Proceedings of SoftMC 03. ENTCS 89(3), 2003.
19. [Dil88] D. L. Dill. Trace theory for automatic hierarchical verification of speed-independent circuits. PhD thesis, Carnegie Mellon University, 1988. Technical report no. CMU-CS-88-119.
20. [GL94] O. Grumberg and D.E. Long. Model checking and modular verification. ACM Trans. on Programming Languages and Systems, 16(3):843-871, 1994.
21. [GM03] D. Giannakopoulou and J. Magee. Fluent model checking for event-based systems. In Proceedings of FSE. ACM Press, 2003.
22. [GPVW95] R. Gerth, D. Peled, M. Y. Vardi, and P. Wolper. Simple on-the-fly automatic verification of linear temporal logic. In Protocol Specification Testing and Verification, pages 3-18, Warsaw, Poland, 1995. Chapman & Hall.
23. [HJMQ03] T. A. Henzinger, R. Jhala, R. Majumdar, and S. Qadeer. Thread-modular abstraction refinement. In Proceedings of CAV, volume 2725. Springer LNCS, 2003.
24. [HJMS02] T. A. Henzinger, R. Jhala, R. Majumdar, and G. Sutre. Lazy abstraction. In Proceedings of POPL, pages 58-70, 2002.
25. [HJS01] M. Huth, R. Jagadeesan, and D. Schmidt. Modal transition systems: A foundation for three-valued program analysis. In Proceedings of ESOP 01. LNCS 2028, 2001.
26. [Hoa85] C. A. R. Hoare. Communicating Sequential Processes. Prentice Hall, 1985.
27. [HQR00] T. A. Henzinger, S. Qadeer, and S. K. Rajamani. Decomposing refinement proofs using assume-guarantee reasoning. In Proceedings of ICCAD, pages 245-252. IEEE Computer Society Press, 2000.
28. [Koz83] D. Kozen. Results on the prepositional mu-calculus. Theoretical Computer Science, 27:333-354, 1983.
29. [Kur94] R. P. Kurshan. Computer-aided verification of coordinating processes: the automata-theoretic approach. Princeton University Press, 1994.
30. [KV98] E. Kindler and T. Vesper. ESTL: A temporal logic for events and states. In Proceedings of ATPN 98, pages 365-383. LNCS 1420, 1998.
31. [LBBO01] Y. Lakhnech, S. Bensalem, S. Berezin, and S. Owre. Incremental verification by abstraction. In Proceedings of TACAS, volume 2031, pages 98-112. Springer LNCS, 2001.
32. [LP85] O. Lichtenstein and A. Pnueli. Checking that finite state concurrent programs satisfy their linear specification. In Proceedings of POPL, 1985.
33. [MAG] MAGIC website. http://www.cs.cmu.edu/~chaki/magic.
34. [McM97] K. L. McMillan. A compositional rule for hardware design refinement. In Proceedings of CAV, volume 1254, pages 24-35. Springer LNCS, 1997.
35. [Mil89] R. Milner. Communication and Concurrency. Prentice-Hall International, London, 1989.
36. [NCOD97] G. Naumovich, L. A. Clarke, L. J. Ostenveil, and M. B. Dwyer. Verification of concurrent software with FLAYERS. In Proceedings of ICSE, pages 594-595. ACM Press, 1997.
37. [NFGR93] R. De Nicola, A. Fantechi, S. Gnesi, and G. Ristori. An action-based framework for verifying logical and behavioural properties of concurrent systems. Computer Networks and ISDN Systems, 25(7):761-778, 1993.
38. [NV95] R. De Nicola and F. Vaandrager. Three logics for branching bisimulation. Journal of the ACM (JACM), 42(2):458-487, 1995.
39. [PDV01] C. S. Pǎsǎreanu, M. B. Dwyer, and W. Visser. Finding feasible counterexamples when model checking abstracted Java programs. In Proceedings of TACAS, volume 2031, pages 284-298. Springer LNCS, 2001.
40. [Pnu86] A. Pnueli. Application of temporal logic to the specification and verification of reactive systems: A survey of current trends. In J.W. de Bakker, W. P. de Roever, and G. Rozenburg, editors, Current Trends in Concurrency, volume 224 of Lecture Notes in Computer Science, pages 510-584. Springer, 1986.
41. [QS81] J.P. Quielle and J. Sifakis. Specification and verification of concurrent systems in CESAR. In proceedings of Fifth Intern. Symposium on Programming, pages 337-350, 1981.
42. [Ros97] A. W. Roscoe. The Theory and Practice of Concurrency. Prentice-Hall International, London, 1997.
43. [SB00] F. Somenzi and R. Bloem. Efficient Büchi automata from LTL formulae. In Computer-Aided Verification, pages 248-263, 2000.
44. [SLA] SLAM website. http://research.microsoft.com/slam.
45. [SSL] OpenSSL. http://wp.netscape.com/eng/ssl3/ssl-toc.htnl.
46. [Sto02] S. D. Stoller. Model-checking multi-threaded distributed Java programs. International Journal on Software Tools for Technology Transfer, 4(1):71-91, 2002.
47. [Wri] Wring website. http: //vlsi. colorado.edu/~rbloem/wring.html.