Module checking

Information and Computation

Volumn 164, Issue 2, 2001, Pages 322-344

  Kupferman, Orna ^a   Vardi, Moshe Y ^b   Wolper, Pierre ^c  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b Rice University   (United States)

^c UNIVERSITY OF LIÈGE   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; FORMAL LOGIC; OPEN SYSTEMS; SYSTEMS ANALYSIS;

TEMPORAL LOGICS;

AUTOMATA THEORY;

EID: 0035966851     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.2000.2893     Document Type: Conference Paper

References (50)

1. [AHK97] Alur, R., Henzinger, T. A., and Kupferman, O. (1997), Alternating-time temporal logic, in "Proc. 38th IEEE Symposium on Foundations of Computer Science. Florida,"
2. [ALW89] Abadi, M., Lamport, L., and Wolper, P. (1989). Realizable and unrealizable concurrent program specifications, in "Proc. 16th Int. Colloquium on Automata, Languages and Programming." Lecture Notes in Computer Science. Vol. 372. pp. 1-17. Springer-Verlag. Berlin New York.
3. [Ant95] Antoniotti, M. (1995). "Synthesis and Verification of Discrete Controllers for Robotics and Manufacturing Devices with temporal Logic and the Control-D System." Ph.D. thesis. New York University. New York.
4. [ASSS94] Aziz, A., Shiple, T. R., Singhal, V., and Sangiovanni-Vincentelli. A. L. (1994), Formula-dependent equivalence for compositional CTL model checking, in "Proc. 6th ConF. on Computer Aided Verification. Stanford. CA," Lecture Notes in Computer Science. Vol. 818. pp. 324-337, Springer-Verlag. Berlin New York.
5. +94] Beer, I., Ben-David, S., Geist, D., Gewirtzman, P., and Yoeli, M. (1994). Methodology and system for practical formal verification of reactive hardware, in "Proc. 6th Conference on Computer Aided Verification, Stanford. CA." Lecture Notes in Computer Science. Vol., 818. pp. 182-193.
6. [BCG88] Browne, M. C., Clarke, E. M., and Grumberg, O. (1988), Characterizing finite Kripke structures in propositional temporal logic. Theoret. Comput. Sci. 59. 115-131.
7. 20 states and beyond, in "Proc. 5th Symposium on Logic in Computer Science. Philadelphia." pp. 428-439.
8. [CE81] Clarke, E. M., and Emerson, E. A. (1981), Design and synthesis of synchronization skeletons using branching time temporal logic. in "Proc. Workshop on Logic of Programs." Lecture Notes in Computer Science. Vol. 131. pp. 52-71. Springer-Verlag, Berlin New York.
9. [CES86] Clarke, E. M., Emerson, E. A. and Sistla, A. P. (1986), Automatic verification of finite-state concurrent system using temporal logic specifications. ACM Trans. Programming Lang. Systems 8. 244-263.
10. [CGL93] Clarke, E. M. Grumberg, O., and Long, D. (1993). Verification tools for finite-state con-current systems, in "Decade of Concurrency Reflections and Perspectives. Proceedings of REX School" (J. W. de Bakker, W.-P. de Roever, and G. Rozenberg, Eds.). Lecture Notes in Computer Science. Vol. 803. pp. 124-175. Springer-Verlag, Berlin New York.
11. [Cle93] Cleaveland, R. (1993), A linear-time model-checking algorithm for the alternation-free modal μ-calculus. Formal Methods in System Design 2, 121-147.
12. [EH86] Emerson, E. A. and Halpern, J. Y. (1986). Sometimes and not never revisited: On branching versus linear time. J. Assoc. Comput. Mach. 33. 151-178.
13. [EJ88] Emerson, E. A., 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." pp. 368-377.
14. [EL85] Emerson, E. A., and Lei, C.-L. (1985). Temporal model checking under generalized fairness constraints, in "Proc. 18th Hawaii International Conference on System Sciences, North Hollywood." Western Periodicals.
15. [Eme90] Emerson, E. A. (1990), Temporal and modal logic, in "Handbook of Theoretical Computer Science," pp. 997-1072.
16. [ES84] Emerson, E. A., and Sistla, A. P. (1984). Deciding branching time logic, in "Proc. 16th ACM Symposium on Theory of Computing. Washington."
17. [FL79] Fischer, M. J., and Ladner, R. E. (1979). Propositional dynamic logic of regular programs. J. Comput. Systems Sci. 18. 194-211.
18. [Flo67] Floyd, R. W. (1967). Assigning meaning to programs, in "Proceedings Symposium on Applied Mathematics," Vol. 19.
19. [FZ88] Fischer, M. J., and Zuck, L. D. (1988), Reasoning about uncertainty in fault-tolerant distributed systems in "Proc. Symp. on Formal Techniques in Real-time and Fault-Tolerant Systems" (M. Joseph. Ed.) Lecture Notes in Computer Science. Vol. 331. pp. 142-158. Springer-Verlag, Berlin New York.
20. [GJ79] Garey, M., and Johnson, D. S. (1979), "Computer and Intractability: A Guide to the Theory of NP-completeness," Freeman. San Francisco.
21. [GL94] Grumberg, O., and Long, D. E. (1994). Model checking and modular verification. ACM Trans. Programming Languages Systems 16, 843-871.
22. [Gol77] Goldschlager, L. M. (1977) The monotone and planar circuit value problems are log space complete for P. SIGACT News 9. 25-29.
23. [Hoa69] Hoare, C. A. R. (1969). An axiomatic basis of computer programming. Commun. Assoc. Comput. Mach. 12. 576-583.
24. [Hoa85] Hoare, C. A. R. (1985). "Communicating Sequential Processes." Prentice-Hall. Englewood Cliffs. NJ.
25. [HP85] Harel, D., and Pnueli, A. (1985). On the development of reactive systems, in "Logics and Models of Concurrent Systems" (K. Apt. Ed.), NATO Advanced Summer Institutes. Vol. F-13, pp. 477-498, Springer-Verlag. Berlin New York
26. [KG96] Kupferman, O., and Grumberg, O. (1996), Buy one, get one free!!!., Logic Comput. 6. 523-539.
27. [Koz83] Kozen, D. (1983) Results on the propositional μ-calculus. Theoret. Comput. Sci. 27. 333-354.
28. [Kup97] Kupferman, O. (1997). Augmenting branching temporal logics with existential quantification over atomic propositions. J. Logic Comput. 7. 1-14.
29. [KV95] Kupferman, O., and Vardi, M. Y. (1995), On the complexity of branching modular model checking, in "Proc. 6th Conference on Concurrency Theory. Philadelphia," Lecture Notes in Computer Science. Vol. 962. pp. 408-422. Springer-Verlag. Berlin New York.
30. [KVW00] Kupferman, O., Vardi, M. Y., and Wolper, P. (2000). An automata-theoretic approach to branching-time model checking. Assoc. Comput. Mach. 42 (2).
31. [Lam80] Lamport, L. (1980). Sometimes is sometimes "not never"-on the temporal logic of programs, in "Proc. 7th ACM Symposium on Principles of Programming Languages," pp. 174-185.
32. [Lar89] Larsen, K. G. (1989). Modal specifications, in "Automatic Verification Methods for Finite State Systems. Proc. Int. Workshop, Grenoble." Lecture Notes in Computer Science, Vol. 407, pp. 232-246. Springer-Verlag. Berlin New York.
33. [Lon93] Long, D. E. (1993). "Model Checking. Abstraction and Compositional Verification," Ph.D. thesis, Carnegie-Mellon University. Pittsburgh.
34. [LP85] 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." pp. 97-107.
35. [LT88] Larsen, K. G., and Thomsen, G. B. (1988). A modal process logic, in "Proc. 3th Symposium on Logic in Computer Science. Edinburgh."
36. [McM93] McMillan, K. L. (1993). "Symbolic Model Checking," Kluwer Academic, Dordrecht Norwell, MA.
37. [Mil71] Milner, R. (1971), An algebraic definition of simulation between programs. in "Proc. 2nd International Joint Conference on Artificial Intelligence." pp. 481-489. British Computer Society.
38. [MP92] Manna, Z., and Pnueli, A. (1992), Temporal specification and verification of reactive modules.
39. [Pnu77] Pnueli, A. (1977), The temporal logic of programs. in "Proc. 18th IEEE Symposium on Foundation of Computer Science," pp. 46-57.
40. [PR89a] Pnueli, A., and Rosner, R. (1989). On the synthesis of a reactive module, in "Proc. 16th ACM Symposium on Principles of Programming Languages. Austin."
41. [PR89b] Pnueli, A., and Rosner, R. (1989). On the synthesis of an asynchronous reactive module. in "Proc. 16th Int. Colloquium on Automata. Languages and Programming," Lecture Notes in Computer Science. Vol. 372. pp. 652-671. Springer-Verlag. Berlin New York.
42. [Pra80] Pratt, V. R. (1980), A near-optimal method for reasoning about action, J. Comput. System Sci. 20. 231-254.
43. [QS81] Queille, J. P., and Sifakis, J. (1981), Specification and verification of concurrent systems in Cesar. in "Proc. 5th International Symp. on Programming," Lecture Notes in Computer Science. Vol. 127. pp.337-351. Springer-Verlag. Berlin New York.
44. [Rab69] Rabin, M.O. (1969), Decidability of second order theories and automata on infinite trees, Trans. Amer. Math. Soc. 141. 1-35.
45. [SC85] Sistla, A.P. and Clarke E. M. (1985). The complexity of propositional linear temporal logic. J. Assoc. Comput. Mach. 32. 733-749.
46. [Var95] Vardi, M. Y. (1995). On the complexity of modular model checking, in "Proc. 10th IEEE Symposium on Logic in Computer Science."
47. [VS85] Vardi, M. Y., and Stockmeyer, L. (1985). Improved upper and lower bounds for modal logics of programs. in "Proc 17th ACM Symp. on Theory of Computing," pp. 240-251.
48. [VW86a] Vardi, M. Y., and Wolper, P. (1986), An automata-theoretic approach to automatic program verification. in "Proc. First Symposium on Logic in Computer Science." pp. 322-331. Cambridge, MA.
49. [VW86b] Vardi, M. Y., and Wolper, P. (1986), Automata-theoretic techniques for modal logics of programs. J. Comput. System Sci. 32, 182-221.
50. [VW94] Vardi, M.Y., and Wolper, P. (1994). Reasoning about infinite computations. Inform. and Comput. 115, 1-37.