Utilizing Symmetry when Model-Checking under Fairness Assumptions: An Automata-Theoretic Approach

ACM Transactions on Programming Languages and Systems

Volumn 19, Issue 4, 1997, Pages 617-638

  Emerson, E A ^a,c   Sistla, A P ^b,d  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^b UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

^c University of Texas at Austin   (United States)

^d University of Illinois   (United States)

Author keywords

Abstraction; Algorithms; Automata; Concurrent Programming; D.2.4 Software Engineering ; D. 1.3 Programming Techniques ; Model checking; Program Verification; F.3.1 Logics and Meanings of Programs verification; Verification

Indexed keywords

ALGORITHMS; AUTOMATA THEORY; COMPUTER AIDED SOFTWARE ENGINEERING;

STATE EXPLOSION PROBLEM; TEMPORAL LOGIC MODEL CHECKING;

COMPUTER PROGRAMMING;

EID: 0031191101     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/262004.262008     Document Type: Article

References (24)

1. AGGARWAL, S., KURSHAN, R. P., AND SABNANI, K. K. 1983. A calculus for protocol specification and validation. In Protocol Specification, Testing and Verification III, H. Ruden and C. West, Eds. North-Holland, Amsterdam.
2. BOUAJJANI, A., FERNANDEZ, J., HALBWICHS, N., RAYMOND, P., AND RATEL, C. 1992. Minimal state generation. Sci. Comput. Program. 18, 247-269.
3. BROWNE, M. C., CLARKE, E. M., AND GRUMBERG, O. 1989. Reasoning about networks with many identical finite-state processes. Inf. Comput. 81, 13-31.
4. CLARKE, E. M. AND EMERSON, E. A. 1981. Design and verification of synchronization skeletons using branching time temporal logic. In Logics of Programs Workshop. Lecture Notes in Computer Science, vol. 131. Springer-Verlag, Berlin.
5. CLARKE, E. M., EMERSON, E. A., AND SISTLA, A. P. 1983. Automatic verification of finite state concurrent programs using temporal logic: A practical approach. In Proceedings of the ACM Symposium on Principles of Programming Languages (Austin, Tex.). ACM, New York. Also ACM Trans. Program. Lang. Syst. 8, 2 (Apr. 1986), 244-263.
6. CLARKE, E. M., EMERSON, E. A., AND SISTLA, A. P. 1983. Automatic verification of finite state concurrent programs using temporal logic: A practical approach. In Proceedings of the ACM Symposium on Principles of Programming Languages (Austin, Tex.). ACM, New York. Also ACM Trans. Program. Lang. Syst. 8, 2 (Apr. 1986), 244-263.
7. CLARKE, E. M., FILKORN, T., AND JHA, S. 1993. Exploiting symmetry in temporal logic model checking. In 5th International Conference on Computer Aided Verification. Lecture Notes in Computer Science, vol. 697. Springer-Verlag, Berlin.
8. CLEAVELAND, R. 1993. Analyzing concurrent systems using the concurrency workbench. In Functional Programming, Concurrency, Simulation, and Automated Reasoning. Lecture Notes in Computer Science, vol. 693. Springer-Verlag, Berlin.
9. DAMS, D., GRUMBERG, O., AND GERTH, R. 1993. Generation of reduced models for checking fragments of ctl. In Proceedings of the International Conference on Computer Aided Verification. Lecture Notes in Computer Science, vol. 697. Springer-Verlag, Berlin.
10. EMERSON, E. A. 1991. Temporal and modal logic. In Handbook of Theoretical Computer Science, J. van Leeuwen, Ed. Elsevier/North-Holland, Amsterdam.
11. EMERSON, E. A. AND LEI, C. L. 1987. Modalities for model checking: Branching time strikes back. Sci. Comput. Program. 8, 275-306.
12. EMERSON, E. A. AND SISTLA, A. P. 1993. Symmetry and model checking. In 5th International Conference on Computer Aided Verification. Lecture Notes in Computer Science, vol. 697. Springer-Verlag, Berlin. (Journal version appeared in J. Formal Methods Syst. Des., vol. 9, 1996, pp 105-131).
13. EMERSON, E. A. AND SISTLA, A. P. 1993. Symmetry and model checking. In 5th International Conference on Computer Aided Verification. Lecture Notes in Computer Science, vol. 697. Springer-Verlag, Berlin. (Journal version appeared in J. Formal Methods Syst. Des., vol. 9, 1996, pp 105-131).
14. FRANCEZ, N. 1986. Fairness. Springer-Verlag, New York.
15. IP, N. C. AND DILL, D. L. 1996. Better verification through symmetry. J. Formal Methods Syst. Des. 9, 41-75. Preliminary version appeared in the International Symposium on Computer Hardware Description Languages and Their Application, April 1993.
16. JENSEN, K. 1994. Colored Petri Nets: Basic Concepts, Analysis Methods, and Practical Use. EATCS Monographs, vol. 2. Springer-Verlag, Berlin.
17. JENSEN, K. AND ROZENBERG, G. 1991. High-Level Petri Nets: Theory and Application. Springer-Verlag, Berlin.
18. KURSHAN, R. P. 1986. Testing containment of omega-regular languages. Bell Labs Rep. 1121-861010-33, Bell Labs, Murray-Hill, N.J. Also in Lecture Notes in Computer Science, vol. 103. Springer-Verlag, Berlin, 1987, pp 19-39.
19. KURSHAN, R. P. 1994. Computer-Aided Verification of Coordinating Processes: The Automata-Theoretic Approach. Princeton University Press, Princeton, N.J.
20. LEE, D. AND YANNAKAKIS, M. 1992. On-line minimization of transition systems. In Proceedings of the ACM Symposium on Theoretical Computer Science. ACM, New York.
21. LITCHTENSTEIN, O. AND PNUELI, A. 1985. Checking that finite state concurrent programs satisfy their linear specifications. In Proceedings of the ACM Symposium on Priciples of Programming Languages. ACM, New York.
22. STREETT, R. 1981. Prepositional dynamic logic of looping and converse. Ph.D. thesis, MIT, Cambridge, Mass.
23. VARDI, M. AND WOLPER, P. 1984. An automata-theoretic framework for modal logics of programs. In Proceedings of the ACM Symposium on the Theory of Computing. ACM, New York.
24. VARDI, M. AND WOLPER, P. 1986. An automata-theoretic framework for automatic program verification. In Proceedings of the International Symposium on Logic in Computer Science. IEEE Computer Society, Washington, D.C.