An automata-theoretic approach to modular model checking

ACM Transactions on Programming Languages and Systems

Volumn 22, Issue 1, 2000, Pages 87-128

  Kupferman, Orna ^a   Vardi, Moshe Y ^b  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b Rice University   (United States)

Author keywords

Algorithms; Automata; D.2.4 Software Engineering : Software Program Verification; Modular verification; Temporal logic; Verification

Indexed keywords

SOFTWARE MODULARITY; TEMPORAL LOGICS;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; FINITE AUTOMATA; LOGIC PROGRAMMING; MATHEMATICAL MODELS; SYNCHRONIZATION;

COMPUTER SOFTWARE;

EID: 0039332719     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/345099.345104     Document Type: Article

References (50)

1. ABADI, M. AND LAMPORT, L. 1993. Composing specifications. ACM Transactions on Programming Languages and Systems 15, 1, 73-132.
2. AZIZ, A., SHIPLE, T., SINGHAL, V., AND SANGIOVANNI-VINCENTELLI, A. 1994. Formula-dependent equivalence for compositional CTL model checking. In Proc. 6th Conf. on Computer Aided Verification. Lecture Notes in Computer Science, vol. 818. Springer-Verlag, Stanford, CA, 324-337.
3. BEERI, C. 1980. On the membership problem for functional and multivalued dependencies in relational databases. ACM Trans. on Database Systems 5, 241-259.
4. 20 states and beyond. In Proc. 5th Symposium on Logic in Computer Science. Philadelphia, 428-439.
5. CLARKE, E., EMERSON, E., AND SISTLA, A. 1986. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages and Systems 8, 2 (January), 244-263.
6. CLARKE, E., GRUMBERG, O., AND PELED, D. 1999. Model Checking. MIT Press.
7. CLARKE, E., LONG, D., AND MCMILLAN, K. 1989. Compositional model checking. In Proc. 4th IEEE Symposium on Logic in Computer Science, R. Parikh, Ed. IEEE Computer Society Press, 353-362.
8. DAMM, W., DÖHMEN, G., GERSTNER, V., AND JOSKO, B. 1989. Modular verification of Petri nets: the temporal logic approach. In Stepwise Refinement of Distributed Systems: Models, Formalisms, Correctness (Proceedings of REX Workshop). Lecture Notes in Computer Science, vol. 430. Springer-Verlag, Mook, The Netherlands, 180-207.
9. DAMS, D., GRUMBERG, O., AND GERTH, R. 1993. Generation of reduced models for checking fragments of CTL. In Proc. 5th Conf. on Computer Aided Verification. Lecture Notes in Computer Science, vol. 697. Springer-Verlag, 479-490.
10. EMERSON, E. AND HALPERN, J. 1985. Decision procedures and expressiveness in the temporal logic of branching time. Journal of Computer and System Sciences 30, 1-24.
11. EMERSON, E. AND HALPERN, J. 1986. Sometimes and not never revisited: On branching versus linear time. Journal of the ACM 33, 1, 151-178.
12. EMERSON, E. AND JUTLA, C. 1988. The complexity of tree automata and logics of programs. In Proc. 29th IEEE Symposium on Foundations of Computer Science. White Plains, 328-337.
13. EMERSON, E. AND LEI, C.-L. 1985. Temporal model checking under generalized fairness constraints. In Proc. 18th Hawaii International Conference on System Sciences. Western Periodicals Company, North Holywood.
14. EMERSON, E. AND LEI, C.-L. 1987. Modalities for model checking: Branching time logic strikes back. Science of Computer Programming 8, 275-306.
15. GRUMBERG, O. AND LONG, D. 1991. Model checking and modular verification. In Proc. 2nd Conference on Concurrency Theory. Lecture Notes in Computer Science, vol. 527. Springer-Verlag, 250-265.
16. GRUMBERG, O. AND LONG, D. 1994. Model checking and modular verification. ACM Trans. on Programming Languages and Systems 16, 3, 843-871.
17. JONES, C. 1983. Specification and design of (parallel) programs. In Information Processing 83: Proc. IFIP 9th World Congress, R. Mason, Ed. IFIP, North-Holland, 321-332.
18. JONES, N. 1975. Space-bounded reducibility among combinatorial problems. Journal of Computer and System Sciences 11, 68-75.
19. JONSSON, B. AND TSAY, Y.-K. 1995. Assumption/guarantee specifications in linear-time temporal logic. In TAPSOFT '95: Theory and Practice of Software Development, P. Mosses, M. Nielsen, and M. Schwartzbach, Eds. Lecture Notes in Computer Science, vol. 915. Springer-Verlag, Aarhus, Denmark, 262-276.
20. JOSKO, B. 1987a. MCTL - an extension of CTL for modular verification of concurrent systems. In Temporal Logic in Specification, Proceedings. Lecture Notes in Computer Science, vol. 398. Springer-Verlag, Altrincham, UK, 165-187.
21. JOSKO, B. 1987b. Model checking of CTL formulae under liveness assumptions. In Proc. 14th Colloq. on Automata, Programming, and Languages (ICALP). Lecture Notes in Computer Science, vol. 267. Springer-Verlag, 280-289.
22. JOSKO, B. 1989. Verifying the correctness of AADL modules using model chekcing. In Stepwise Refinement of Distributed Systems: Models, Formalisms, Correctness (Proceedings of REX Workshop). Lecture Notes in Computer Science, vol. 430. Springer-Verlag, Mook, The Netherlands, 386-400.
23. KUPFERMAN, O. AND GRUMBERG, O. 1996. Buy one, get one free!!! Journal of Logic and Computation 6, 4, 523-539.
24. KUPFERMAN, O. AND VARDI, M. 1995. On the complexity of branching modular model checking. In Proc. 6th Conference on Concurrency Theory. Lecture Notes in Computer Science, vol. 962. Springer-Verlag, Philadelphia, 408-422.
25. KUPFERMAN, O. AND VARDI, M. 1998. Verification of fair transition systems. Chicago Journal of Theoretical Computer Science 1998, 2 (March).
26. KUPFERMAN, O., VARDI, M., AND WOLPER, P. 2000. An automata-theoretic approach to branching-time model checking. Journal of the ACM 47, 2 (March).
27. KURSHAN, R. 1987. Reducibility in analysis of coordination. Lecture Notes in Computer Science, vol. 103. Springer-Verlag, 19-39.
28. LAMPORT, L. 1980. Sometimes is sometimes "not never" - on the temporal logic of programs. In Proc. 7th ACM Symposium on Principles of Programming Languages. 174-185.
29. LAMPORT, L. 1983. Specifying concurrent program modules. ACM Trans. on Programming Languages and Systenms 5, 190-222.
30. LICHTENSTEIN, O. AND PNUELI, A. 1985. Checking that finite state concurrent programs satisfy their linear specification. In Proc. 12th ACM Symposium on Principles of Programming Languages. New Orleans, 97-107.
31. LYNCH, N. 1977. Log space recognition and translation of parenthesis languages. Journal ACM 24, 583-590.
32. MILNER, R. 1971. An algebraic definition of simulation between programs. In Proc. 2nd International Joint Conference on Artificial Intelligence. British Computer Society, 481-489.
33. MISRA, B. AND CHANDY, K. 1981. Proofs of networks of processes. IEEE Trans. on Software Engineering 7, 417-426.
34. MULLER, D. AND SCHUPP, P. 1987. Alternating automata on infinite trees. Theoretical Computer Science 54, 267-276.
35. MULLER, D., SAOUDI, A., AND SCHUPP, P. 1986. Alternating automata, the weak monadic theory of the tree and its complexity. In Proc. 13th Int. Colloquium on Automata, Languages and Programming. Springer-Verlag.
36. PNUELI, A. 1977. The temporal logic of programs. In Proc. 18th IEEE Symposium on Foundation of Computer Science. 46-57.
37. PNUELI, A. 1981. The temporal semantics of concurrent programs. Theoretical Computer Science 13, 45-60.
38. PNUELI, A. 1985a. Applications of temporal logic to the specification and verification of reactive systems: A survey of current trends. In Proc. Advanced School on Current Trends in Concurrency. Volume 224, LNCS, Springer-Verlag, Berlin, 510-584.
39. PNUELI, A. 1985b. In transition from global to modular temporal reasoning about programs. In Logics and Models of Concurrent Systems, K. Apt, Ed. NATO Advanced Summer Institutes, vol. F-13. Springer-Verlag, 123-144.
40. QUEILLE, J. AND SIFAKIS, J. 1981. Specification and verification of concurrent systems in Cesar. In Proc. 5th International Symp. on Programming. Vol. 137. Springer-Verlag, Lecture Notes in Computer Science, 337-351.
41. SAFRA, S. 1988. On the complexity of ω-automata. In Proc. 29th IEEE Symposium on Foundations of Computer Science. White Plains, 319-327.
42. SAFRA, S. 1989. Complexity of automata on infinite objects. Ph.D. thesis, Weizmann Institute of Science, Rehovot, Israel.
43. SAVITCH, W. 1970. Relationship between nondeterministic and deterministic tape complexities. Journal on Computer and System Sciences 4, 177-192.
44. SISTLA, A. AND CLARKE, E. 1985. The complexity of propositional linear temporal logic. Journal ACM 32, 733-749.
45. SISTLA, A. AND ZUCK, L. 1993. Reasoning in a restricted temporal logic. Information and Computation 102, 2, 167-195.
46. STARK, E. 1984. Foundations of theory of specifications for distributed systems. Ph.D. thesis, M.I.T.
47. VARDI, M. 1995. On the complexity of modular model checking. In Proc. 10th IEEE Symposium on Logic in Computer Science. 101-111.
48. VARDI, M. AND STOCKMEYER, L. 1985. Improved upper and lower bounds for modal logics of programs. In Proc 17th ACM Symp. on Theory of Computing. 240-251.
49. VARDI, M. AND WOLPER, P. 1986. An automata-theoretic approach to automatic program verification. In Proc. First Symposium on Logic in Computer Science. Cambridge, 332-344.
50. VARDI, M. AND WOLPER, P. 1994. Reasoning about infinite computations. Information and Computation 115, 1 (November), 1-37.