Reasoning about abstract open systems with generalized module checking

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

Volumn 2855, Issue , 2003, Pages 223-240

  Godefroid, Patrice ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; APPLICATION PROGRAMS; COMPUTER PROGRAMMING LANGUAGES; EMBEDDED SOFTWARE; STATIC ANALYSIS;

ABSTRACTION BASED VERIFICATION; ABSTRACTION TECHNIQUES; AUTOMATICALLY GENERATED; COUNTER EXAMPLES; PREDICATE ABSTRACTIONS; TEMPORAL PROPERTY; VERIFICATION TECHNIQUES; WINNING STRATEGY;

OPEN SYSTEMS;

EID: 0142218953     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45212-6_15     Document Type: Article

References (20)

1. L. de Alfaro and T. Henzinger. Interface Automata. In Proceedings of the 9th ACM Symposium on the Foundations of Software Engineering (FSE'01), 2001.
2. R. Alur, T. Henzinger, O. Kupferman, and M. Vardi. Alternating Refinement Relations. In Proc. 10th Conference on Concurrency Theory, volume 1466 of Lecture Notes in Computer Science, pages 163-178. Springer-Verlag, 1998.
3. G. Bruns and P. Godefroid. Model Checking Partial State Spaces with 3-Valued Temporal Logics. In Proceedings of the 11th Conference on Computer Aided Verification, volume 1633 of Lecture Notes in Computer Science, pages 274-287, Trento, July 1999. Springer-Verlag.
4. G. Bruns and P. Godefroid. Generalized Model Checking: Reasoning about Partial State Spaces. In Proceedings of CONCUR'2000 (11th International Conference on Concurrency Theory), volume 1877 of Lecture Notes in Computer Science, pages 168-182, University Park, August 2000. Springer-Verlag.
5. T. Ball and S. Rajamani. The SLAM Toolkit. In Proceedings of CAV'2001 (13th Conference on Computer Aided Verification), volume 2102 of Lecture Notes in Computer Science, pages 260-264, Paris, July 2001. Springer-Verlag.
6. 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 Proceedings of the 22nd International Conference on Software Engineering, 2000.
7. D. Dams. Abstract interpretation and partition refinement for model checking. PhD thesis, Technische Universiteit Eindhoven, The Netherlands, 1996.
8. S. Das and D. L. Dill. Successive Approximation of Abstract Transition Relations. In Proceedings of LICS'2001 (16th IEEE Symposium on Logic in Computer Science), pages 51-58, Boston, June 2001.
9. E. A. Emerson. Temporal and Modal Logic. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science. Elsevier/MIT Press, Amsterdam/Cambridge, 1990.
10. P: Godefroid, M. Huth, and R. Jagadeesan. Abstraction-based Model Checking using Modal Transition Systems. In Proceedings of CONCUR'2001 (12th International Conference on Concurrency Theory), volume 2154 of Lecture Notes in Computer Science, pages 426-440, Aalborg, August 2001. Springer-Verlag.
11. P. Godefroid and R. Jagadeesan. Automatic Abstraction Using Generalized Model Checking. In Proceedings of CAV'2002 (14th Conference on Computer Aided Verification), volume 2404 of Lecture Notes in Computer Science, pages 137-150, Copenhagen, July 2002. Springer-Verlag.
12. P. Godefroid and R. Jagadeesan. On the Expressiveness of 3-Valued Models. In Proceedings of VMCAI'2003 (4th Conference on Verification, Model Checking and Abstract Interpretation), volume 2575 of Lecture Notes in Computer Science, pages 206-222, New York, January 2003. Springer-Verlag.
13. S. Graf and H. Saidi. Construction of Abstract State Graphs with PVS. In Proceedings of the 9th International Conference on Computer Aided Verification, volume 1254 of Lecture Notes in Computer Science, pages 72-83, Haifa, June 1997. Springer-Verlag.
14. T. Henzinger, R. Jhala, R. Majumdar, and G. Sutre. Lazy Abstraction. In Proceedings of the 29th ACM Symposium on Principles of Programming Languages, pages 58-70, Portland, January 2002.
15. M. Huth, R. Jagadeesan, and D. Schmidt. Modal Transition Systems: a Foundation for Three-Valued Program Analysis. In Proceedings of the European Symposium on Programming (ESOP'2001), volume 2028 of Lecture Notes in Computer Science. Springer-Verlag, April 2001.
16. S. C. Kleene. Introduction to Metamathematics. North Holland, 1987.
17. D. Kozen. Results on the Propositional Mu-Calculus. Theoretical Computer Science, 27:333-354, 1983.
18. O. Kupferman and M. Vardi. Module Checking. In Proc. 8th Conference on Computer Aided Verification, volume 1102 of Lecture Notes in Computer Science, pages 75-86, New Brunswick, August 1996. Springer-Verlag.
19. K. G. Larsen and B. Thomsen. A Modal Process Logic. In Proceedings of Third Annual Symposium on Logic in Computer Science, pages 203-210. IEEE Computer Society Press, 1988.
20. W. Visser, K. Havelund, G. Brat, and S. Park. Model Checking Programs. In Proceedings of ASE'2000 (15th International Conference on Automated Software Engineering), Grenoble, September 2000.