State/event software verification for branching-time specifications

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

Volumn 3771 LNCS, Issue , 2005, Pages 53-69

  Chaki, Sagar ^a   Clarke, Edmund ^b   Grumberg, Orna ^c   Ouaknine, Joël ^d   Sharygina, Natasha ^b,e   Touili, Tayssir ^f   Veith, Helmut ^g  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b Carnegie Mellon University   (United States)

^c TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^d UNIVERSITY OF OXFORD   (United Kingdom)

^e UNIVERSITY OF LUGANO   (Switzerland)

^f UNIVERSITÉ PARIS DIDEROT   (France)

^g TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

Automated Abstraction Refinement; Branching time Temporal Logic; Concurrent Software Model Checking; State Event based Verification

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; CONCURRENT ENGINEERING; DATA COMMUNICATION SYSTEMS; ROBOTICS; SPECIFICATIONS;

ACTION-BASED PROPERTIES; CONCURRENT SYSTEMS; MODEL-CHECKING ALGORITHM; ROBOT CONTROL SOFTWARE;

COMPUTER SOFTWARE;

EID: 33646738891     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11589976_5     Document Type: Conference Paper

References (31)

1. T. Ball and S. K. Rajamani. Automatically validating temporal safety properties of interfaces. In Proceedings of the 8th International SPIN Workshop, volume 2057 of Lecture Notes in Computer Science, pages 103-122. Springer, 2001.
2. S. Chaki, E. M. Clarke, A. Groce, S. Jha, and H. Veith. Modular verification of software components in C. In Proceedings of the 25th International Conference on Software Engineering (ICSE), pages 385-395. IEEE Press, 2003.
3. S. Chaki, E. M. Clarke, J. Ouaknine, N. Sharygina, and N. Sinha. State/event-based software model checking. In Proceedings of the 4th International Conference on Integrated Formal Methods (IFM), volume 2999 of Lecture Notes in Computer Science, pages 128-147. Springer, 2004.
4. S. Chaki, E. M. Clarke, J. Ouaknine, N. Sharygina, and N. Sinha. Concurrent software verification with states, events, and deadlocks. Formal Aspects of Computing Journal (to appear), 2005.
5. 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 the Workshop on Software Model Checking (SoftMC). ENTCS 89(3), 2003.
6. E. M. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith. Counterexample-guided abstraction refinement. In Proceedings of the 12th International Conference on Computer Aided Verification (CAV), volume 1855 of Lecture Notes in Computer Science, pages 154-169. Springer, 2000.
7. E. M. Clarke, O. Grumberg, and R. P. Kurshan. A synthesis of two approaches for verifying finite state concurrent systems. Journal of Logic and Computation, 2(5):606-618, 1992.
8. E. M. Clarke, O. Grumberg, and D. E. Long. Model checking and abstraction. ACM Transactions on Programming Languages and Systems, 16(5):1512-1542, 1994.
9. E. M. Clarke, S. Jha, Y. Lu, and H. Veith. Tree-like counterexamples in model checking. In Proceedings of the 17th Symposium on Logic in Computer Science (LICS), pages 19-29. IEEE Press, 2002.
10. 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 SIGPLAN Conference on Programming Languages, 1977.
11. M. Dam. CTL* and ECTL* as fragments of the modal μ-calculus. Theoretical Computer Science, 126:77-96, 1994.
12. S. Graf and H. Saïdi. Construction of abstract state graphs with PVS. In Proceedings of the 9th International Conference on Computer Aided Verification (CAV), volume 1254 of Lecture Notes in Computer Science, pages 72-83. Springer, 1997.
13. J. Haartsen, Bluetooth Baseband Specification, version 1.0.
14. T. A. Henzinger, R. Jhala, R. Majumdar, and G. Sutre. Lazy abstraction. In Proceedings of the 29th Annual ACM Symposium on Principles of Programming Languages (POPL), pages 58-70. ACM Press, 2002.
15. C. A. R. Hoare. Communicating Sequential Processes. Prentice Hall, 1985.
16. M. Huth, R. Jagadeesan, and D. Schmidt. Modal transition systems: A foundation for three-valued program analysis. In Proceedings of the 10th European Symposium on Programming (ESOP), volume 2028 of Lecture Notes in computer Science, pages 137-154. Springer, 2001.
17. J. Ivers and N. Sharygina. Overview of ComFoRT: A model checking reasoning framework. CMU/SEI-8004-TN-018, 2004.
18. E. Kindler and T. Vesper. ESTL: A temporal logic for events and states. Lecture Notes in Computer Science, 1420:365-383, 1998.
19. R. P. Kurshan. Analysis of discrete event coordination. In Proceedings of the REX Workshop, volume 430 of Lecture Notes in Computer Science, pages 414-453. Springer, 1989.
20. R. P. Kurshan. Computer-aided verification of coordinating processes: the automata-theoretic approach. Princeton University Press, 1994.
21. Y. Lakhnech, S. Bensalem, S. Berezin, and S. Owre. Incremental verification by abstraction. In Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), volume 2031 of Lecture Notes in Computer Science, pages 98-112. Springer, 2001.
22. MAGIC website. http://www.cs.cmu.edu/~chaki/magic.
23. R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
24. G. Naumovich, L. A. Clarke, L. J. Osterweil, and M. B. Dwyer. Verification of concurrent software with FLAYERS. In Proceedings of the 19th International Conference on Software Engineering (ICSE), pages 594-595. IEEE Press, 1997.
25. R. De Nicola and F. Vaandrager. Three logics for branching bisimulation. Journal of the ACM, 42(2):458-487, 1995.
26. C. S. Pǎsǎreanu, M. B. Dwyer, and W. Visser. Finding feasible counter-examples when model checking abstracted Java programs. In Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), volume 2031 of Lecture Notes in Computer Science, pages 284-298. Springer, 2001.
27. A. W. Roscoe. The Theory and Practice of Concurrency. Prentice-Hall, 1997.
28. W. Thomas. Computation tree logic and regular ω-languages. In Proceedings of REX Workshop, Lecture Notes in Computer Science, pages 690-713. Springer, 1988.
29. M. Y. Vardi and P. Wolper. Yet another process logic. In Proceedings of Logic of Programs, Lecture Notes in Computer Science, pages 501-512. Springer, 1983.
30. M. Y. Vardi and P. Wolper. Reasoning about infinite computations. Information and Computation, 115(1):1-37, 1994.
31. P. Wolper. Temporal logic can be more expressive. Information and Control, 56:72-99, 1983.