Model checking vs. generalized model checking: Semantic minimizations for temporal logics

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2005, Pages 158-167

  Godefroid, Patrice ^a   Huth, Michael ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

MODEL CHECKING; SEMANTIC MINIMIZATION; TEMPORAL LOGIC; THREE-VALUED MODELS;

AUTOMATA THEORY; COSTS; MATHEMATICAL MODELS; MATHEMATICAL PROGRAMMING; OPTIMIZATION; SEMANTICS;

FORMAL LOGIC;

EID: 26844464768     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (31)

1. T. Ball and S. Rajamani. The SLAM Toolkit. In Proceedings of the 13th Conference on Computer Aided Verification, volume 2102 of Lecture Notes in Computer Science, pages 260-264, Paris, July 2001. Springer-Verlag.
2. S. Blarney. Partial-Valued Logic. PhD thesis, University of Oxford, Oxford, England, 1980.
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. Springer Verlag, July 1999.
4. G. Bruns and P. Godefroid. Generalized Model Checking: Reasoning about Partial State Spaces. In Proceedings of the 11th International Conference on Concurrency Theory, volume 1877 of Lecture Notes in Computer Science, pages 168-182. Springer Verlag, August 2000.
5. S. R. Buss. The Boolean Formula Problem Is in ALOG-TIME. In Proceedings of the 19th Annual ACM Symposium on Theory of Computing, pages 123-131, New York City, New York, 25-28 May 1987. ACM Press.
6. S. Demri and P. Schnoebelen. The Complexity of Prepositional Linear Temporal Logics in Simple Cases. Information and Computation, 174(1):84-103, 2002.
7. M. B. Dwyer, G. S. Avrunin, and J. C. Corbett. Patterns in Property Specifications for Finite-state Verification. In Proceedings ICSE 1999. IEEE Computer Society Press, May 1999.
8. E. A. Emerson. Temporal and Modal Logic. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science. Elsevier/MIT Press, Amsterdam/Cambridge, 1990.
9. E. A. Emerson, M. Evangelist, and J. Srinivasan. On the limits of efficient temporal decidability. In Proceedings of the 5th Annual IEEE Symposium on Logic in Computer Science, pages 464-475, Philadelphia, Pennsylvania, 4-7 June 1990.
10. P. Godefroid. Reasoning about Abstract Open Systems with Generalized Module Checking. In Proceedings of the 3rd Conference on Embedded Software, volume 2855 of Lecture Notes in Computer Science, pages 223-240, Philadelphia, October 2003. Springer Verlag.
11. P. Godefroid, M. Huth, and R. Jagadeesan. Abstraction-based Model Checking using Modal Transition Systems. In Proceedings of the 12th International Conference on Concurrency Theory, volume 2154 of Lecture Notes in Computer Science, pages 426-440, Aalborg, August 2001. Springer-Verlag.
12. P. Godefroid and R. Jagadeesan. Automatic Abstraction Using Generalized Model Checking. In E. Brinksma and K. G. Larsen, editors, Proceedings of the 14th International Conference on Computer Aided Verification, volume 2404 of Lecture Notes in Computer Science, pages 137-150, Copenhagen, Denmark, July 2002. Springer Verlag.
13. P. Godefroid and R. Jagadeesan. On The Expressiveness of 3-Valued Models. In L. D. Zuck, P. C. Attie, A. Cortesi, and S. Mukhopadhyay, editors, Proceedings of the 4th Conference on Verification, Model Checking and Abstract Interpretation, volume 2575 of LNCS, pages 206-222, New York, January 2003. 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. T. A. Henzinger, O. Kupferman, and R. Majumdar. On the Universal and Existential Fragments of the μ-Calculus. In Proceedings of the 9th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, volume 2619 of Lecture Notes in Computer Science, pages 49-64. Springer Verlag, 2003.
16. A. Hussain and M. Huth. On model checking multiple hybrid views. In Preliminary Proceedings of the First International Symposium on Leveraging Applications of Formal Method, pages 235-242, Paphos, Cyprus, 30 October - 2 November 2004. Technical Report TR-2004-6 Department of Computer Science, University of Cyprus.
17. M. Huth. Refinement is complete for implementations. Accepted for publication in Formal Aspects of Computing, December 2004.
18. M. Huth, R. Jagadeesan, and D. Schmidt. A domain equation for refinement of partial systems. Mathematical Structures in Computer Science, 14(4):469-505, 5 August 2004.
19. M. Huth, R. Jagadeesan, and D. A. Schmidt. Modal transition systems: a foundation for three-valued program analysis. In D. Sands, editor, Proceedings of the 10th European Symposium on Programming, pages 155-169. Springer Verlag, April 2001.
20. D. Janin and I. Walukiewicz. Automata for the modal mucalculus and related results. In Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science, volume 969 of Lecture Notes in Computer Science, pages 552-562. Springer-Verlag, 1995.
21. S. C. Kleene. Introduction to Metamathematics. Van Nostrand, 1952.
22. D. Kozen. Results on the prepositional mu-calculus. Theoretical Computer Science, 27:333-354, 1983.
23. O. Kupferman and M. Vardi. Module Checking. In Proceedings 8th Conference on Computer Aided Verification, volume 1102 of Lecture Notes in Computer Science, pages 75-86, New Brunswick, August 1996. Springer-Verlag.
24. O. Kupferman, M. Y. Vardi, and P. Wolper. An Automata-Theoretic Approach to Branching-Time Model Checking. Journal of the ACM, 47(2):312-360, March 2000.
25. J. Magee. Behavioral analysis of software architectures using LTSA. In Proceedings of the 21st IEEE International Conference on Software Engineering, pages 634-637, Los Angeles, California, 16-22 May 1999. ACM Press.
26. D. E. Muller and P. E. Schupp. Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems by Rabin, McNaughton and Safra. Theoretical Computer Science, 141(1-2):69-108, 1995.
27. D. Niwinski. Fixed Points vs. Infinite Generation. In Proceedings of the 3rd Annual IEEE Symposium on Logic in Computer Science, pages 402-409. IEEE Computer Society Press, 1988.
28. T. Reps, A. Loginov, and M. Sagiv. Semantic Minimization of 3-Valued Prepositional Formulae. In Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science, pages 40-51, Copenhagen, Denmark, 22-25 July 2002. IEEE Computer Society Press.
29. D. A. Schmidt and B. Steffen. Data-flow analysis as model checking of abstract interpretations. In G. Levi, editor, Proceedings of the 5th Static Analysis Symposium, volume 1503 of Lecture Notes in Computer Science, pages 351-380, Pisa, Italy, 14-16 September 1998. Springer.
30. C.-J. H. Seger and R. E. Brant. Formal Verification by Symbolic Evaluation of Partially-Ordered Trajectories. Formal Methods in System Design, 6(2):147-189, March 1995.
31. B. van Fraassen. Singular terms, truth-value gaps, and free logic. J. Phil., 63(17):481-495, September 1966.