Verification of open systems

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

Volumn 1346, Issue , 1997, Pages 250-266

  Vardi, Moshe Y ^a  

^a Rice University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

OPEN SYSTEMS; TEMPORAL LOGIC;

ALGORITHMIC METHODS; ARBITRARY ENVIRONMENT; CLOSED SYSTEMS; CURRENT MODELING; FINITE STRUCTURES; MODEL CHECKING ALGORITHM; REACTIVE PROGRAMS; TEMPORAL LOGIC FORMULA;

MODEL CHECKING;

EID: 84949209427     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0058035     Document Type: Conference Paper

References (42)

1. I. Beer, S. Ben-David, D. Geist, R. Gewirtzman, and M. Yoeli. Methodology and system for practical formal verification of reactive hardware. In Proc. 6th Conference on Computer Aided Verification, volume 818 of Lecture Notes in Computer Science, pages 182-193, Stanford, June 1994.
2. 20 states and beyond. In Proceedings of the 5th Symposium on Logic in Computer Science, pages 428-439, Philadelphia, June 1990.
3. O. Bemholtz, M.Y. Vardi, and P. Wolper. An automata-theoretic approach to branching-time model checking. In D. L. Dill, editor, Computer Aided Verification, Proc. 6th Int. Conference, volume 818 of Lecture Notes in Computer Science, pages 142-155, Stanford, June 1994. Springer-Verlag, Berlin.
4. E.M. Clarice and E.A. Emerson. Design and synthesis of synchronization skeletons using branching time temporal logic. In Proc. Workshop on Logic of Programs, volume 131 of Lecture Notes in Computer Science, pages 52-71. Springer-Verlag, 1981.
5. E.M. Clarike, E.A. Emerson, and A.P. Sistla. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages and Systems, 8(2):244-263, January 1986.
6. E.M. Clarike, O. Grumberg, and M.C. Browne. Reasoning about networks with many identical finite-state processes. In Proc. 5th ACM Symposium on Principles of Distributed Computing, pages 240-248, Calgary, Alberta, August 1986.
7. E.M. Clarke, O. Grumberg, H. Hiraishi, S. Jha, D.E. Long, K.L. McMillan, and L.A. Ness. Verification of the futurebus+ cache coherence protocol. Formal Methods in System Design, 6:217-232, 1995.
8. E.M. Clarke, O. Grumberg, and D. Long. Verification tools for finite-state concurrent systems. In J.W. de Bakker, W.-P. de Roever, and G. Rozenberg, editors, Decade of Concurrency - Reflections and Perspectives (Proceedings of REX School), volume 803 of Lecture Notes in Computer Science, pages 124-175. Springer-Verlag, 1993.
9. E.A. Emerson and J.Y. Halpem. Sometimes and not never revisited: On branching versus linear time. Joumalofthe ACM, 33(1): 151-178, 1986.
10. E.A. Emerson and C. Jutla. The complexity of tree automata and logics of programs. In Proceedings of the 29 th IEEE Symposium on Foundations of Computer Science, pages 368-377, White Plains, October 1988.
11. E.A. Emerson and C.-L. Lei. Modalities for model checking: Branching time logic strikes back. In Proceedings of the Twelfth ACM Symposiumon Principles of Programming Languages, pages 84-96, New Orleans, January 1985.
12. E.A. Emerson. Automata, tableaux, and temporal logics. In Proc. Workshop on Logic of Programs, volume 193 of Lecture Notes in Computer Science, pages 79-87. Springer-Vertag, 1985.
13. E.A. Emerson and A. P. Sistla. Deciding branching time logic. In Proc. 16th ACM Symposium on Theory of Computing, Washington, April 1984.
14. M.J. Fischer and R.E. Ladner. Propositional dynamic logic of regular programs. J. of Computer and Systems Sciences, 18:194-211, 1979.
15. M.J. Fischer and L.D. Zuck. Reasoning about uncertainty in fault-tolerant distributed systems. In M. Joseph, editor, Proc. Symp. on Formal Techniques in Real-Time and Fault-Tolerant Systems, volume 331 of Lecture Notes in Computer Science, pages 142-158. Springer-Verlag, 1988.
16. O. Grumberg and D.E. Long. Model checking and modular verification. ACM Trans, on Programming Languages and Systems, 16(3):843-871, 1994.
17. L.M. Goldschlager. The monotone and planar circuit value problems are log space complete for p. SIGACT News, 9(2):25-29, 1977.
18. C.A.R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985.
19. D. Hard and A. Pnueli. On the development of reactive systems. In K. Apt, editor, Logics and Models of Concurrent Systems, volume F-13 of NATO Advanced Summer Institutes, pages 477-498. Springer-Verlag, 1985.
20. O. Kupferman and O. Grumberg. Buy one, get one free!!! Journal of Logic and Computation, 6(4):523-539, 1996.
21. O. Kupferman and M.Y. Vardi. On the complexity of branching modular model checking. In Proc. 6th Conferance on Concurrency Theory, volume 962 of Lecture Notes in Computer Science, pages 408-422, Philadelphia, August 1995. Springer-Verlag.
22. O. Kupferman and M.Y. Vardi. Module checking. In Computer Aided Verification, Proc. 8th Int. Conference, volume 1102 of Lecture Notes in Computer Science, pages 75-86. Springer-Verlag, 1996.
23. O. Kupferman and M.Y. Vardi. Module checking revisited. In Computer Aided Verification, Proc. 9th Int. Conference, volume 1254 of Lecture Notes in Computer Science, pages 36-47. Springer-Verlag, 1997.
24. O. Kupferman and M.Y. Vardi. Weak alternating automata are not that weak. In 5th Israeli Symposium on Theory of Computing and Systems, pages 147-158. IEEE Computer Society Press, 1997.
25. O. Kupferman, M.Y. Vardi, and P. Wolper. Module checking. 1997.
26. L. Lamport. Sometimes is sometimes "not never" - on the temporal logic of programs. In Proceedings of the 7th ACM Symposium on Principles of Programming Languages, pages 174-185, January 1980.
27. O. Lichtenstein and A. Pnueli. Checking that finite state concurrent programs satisfy their linear specification. In Proceedings of the Twelfth ACM Symposium on Principles of Programming Languages, pages 97-107, New Orleans, January 1985.
28. K.L. McMillan. Symbolic model checking. Kluwer Academic Publishers, 1993.
29. R. Milner. An algebraic definition of simulation between programs. In Proceedings of the 2nd International Joint Conference on Artificial Intelligence, pages 481-489, September 1971.
30. Z. Manna and A. Pnueli. Temporal specification and verification of reactive modules. 1992.
31. D.E. Muller and P.E. Schupp. Alternating automata on infinite trees. Theoretical Computer Science, 54,:267-276, 1987.
32. D.E. Muller and P.E. Schupp. Simulating atemating tree automata by nondeterministic automata: New results and new proofs of theorems of Rabin, McNaughton and Safira. Theoretical Computer Science, 141:69-107, 1995.
33. A. Pnueli. The temporal semantics of concurrent programs. Theoretical Computer Science, 13:45-60, 1981.
34. A. Pnueli and R. Rosner. On the synthesis of a reactive module. In Proceedings of the Sixteenth ACM Symposium on Principles of Programming Languages, Austin, January 1989.
35. V.R. Pratt. A near-optimal method for reasoning about action. J. on Computer and System Sciences, 20(2):231-254, 1980.
36. J.P. Queille and J. Sifakis. Specification and verification of concurrent systems in Cesar. In Proc. 5th International Symp. on Programming, volume 137, pages 337-351. Springer-Verlag, Lecture Notes in Computer Science, 1981.
37. J.H. Reif. The complexity of two-player games of incomplete information. J. on Computer and System Sciences, 29:274-301, 1984.
38. A.P. Sistla and E.M. Clarke. The complexity of propositional linear temporal logic. J. ACM, 32:733-749, 1985.
39. M. Y. Vardi. On the complexity of modular model checking. In Proceedings of the 10th IEEE Symposium on Logic in Computer Science, June 1995.
40. M.Y. Vardi and L. Stockmeyer. Improved upper and lower bounds for modal logics of programs. In Proc 17th ACM Symp. on Theory of Computing, pages 240-251, 1985.
41. M.Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In Proceedings of the First Symposium on Logic in Computer Science, pages 322-331, Cambridge, June 1986.
42. M.Y. Vardi and P. Wolper. Automata-theoretic techniques for modal logics of programs. Journal of Computer and System Science, 32(2): 182-221, April 1986.