Branching vs. linear time: Final showdown

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

Volumn 2031 LNCS, Issue , 2001, Pages 1-22

  Vardi, Moshe Y ^a  

^a Rice University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL VERIFICATION; MODEL CHECKING; SPECIFICATION LANGUAGES; SPECIFICATIONS; COMPUTATIONAL LINGUISTICS;

COMPOSITIONAL REASONING; EXPRESSIVE POWER; FUNDAMENTAL LIMITATIONS; INHERENT LIMITATIONS; LINEAR TEMPORAL LOGIC; SEMI-FORMAL VERIFICATIONS; SYMBOLIC SEARCH; TEMPORAL SPECIFICATION;

TEMPORAL LOGIC;

EID: 84903203138     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45319-9_1     Document Type: Conference Paper

References (106)

1. M. Abadi and L. Lamport. The existence of refinement mappings. Theoretical Computer Science, 82(2):253-284, 1991.
2. R. Armoni, L. Fix, A. Flaisher, R. Gerth, T. Kanza, A. Landver, S. Mador-Haim, A. Tiemeyer, M.Y. Vardi, and Y. Zbar. The ForSpec compiler. Submitted, 2001.
3. R. Armoni, L. Fix, R. Gerth, B. Ginsburg, T. Kanza, A. Landver, S. Mador-Haim, A. Tiemeyer, E. Singerman, and M.Y. Vardi. The ForSpec temporal language: A new temporal property-specification language. Submitted, 2001.
4. B. Banieqbal and H. Barringer. Temporal logic with fixed points. In B. Banieqbal, H. Bar-ringer, and A. Pnueli, editors, Temporal Logic in Specification, volume 398 of Lecture Notes in Computer Science, pages 62-74. Springer-Verlag, 1987.
5. H. Barringer and R. Kuiper. Hierarchical development of concurrent systems in a framework. In S.D. Brookes et al., editor, Seminar in Concurrency, Lecture Notes in Computer Science, Vol. 197, pages 35-61. Springer-Verlag, Berlin/New York, 1985.
6. 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.
7. I. Beer, S. Ben-David, and A. Landver. On-the-fly model checking for RCTL formulas. In A.J. Hu and M.Y. Vardi, editors, Computer Aided Verification, Proc. 10th Int'l Conf, volume 1427 of Lecture Notes in Computer Science, pages 184-194. Springer-Verlag, Berlin, 1998.
8. M. Ben-Ari, A. Pnueli, and Z. Manna. The temporal logic of branching time. Acta lnfor-matica, 20:207-226,1983.
9. A. Biere, A. Cimatti, E.M. Clarke, M. Fujita, and Y. Zhu. Symbolic model checking using SAT procedures instead of BDDs. In Proc. 36th Design Automation Conference, pages 317-320. IEEE Computer Society, 1999.
10. R. Bloem, K. Ravi, and F. Somenzi. Efficient decision prcedures for model checking of linear time logic properties. In Computer Aided Verification, Proc. 11th Int. Conference, volume 1633 of Lecture Notes in Computer Science,pages 222-235. Springer-Verlag, 1999.
11. R.K. Brayton, G.D. Hachtel, A. Sangiovanni-Vincentelli, F. Somenzi, A. Aziz, S.-T. Cheng, S. Edwards, S. Khatri, T. Kukimoto, A. Pardo, S. Qadeer, R.K. Ranjan, S. Sarwary, T.R. Shiple, G. Swamy, and T. Villa. VIS: a system for verification and synthesis. In Computer Aided Verification, Proc. 8th Int. Conference, volume 1102 of Lecture Notes in Computer Science, pages 428-432. Springer-Verlag, 1996.
12. M.C. Browne, E.M. Clarke, and O. Grumberg. Characterizing finite Kripke structures in propositional temporal logic. Theoretical Computer Science, 59:115-131,1988.
13. J.R. Büchi. On a decision method in restricted second order arithmetic. In Proc. Internal. Congr. Logic, Method, and Philos. Sci. 1960, pages 1-12, Stanford, 1962. Stanford University Press.
14. J.R. Burch, E.M. Clarke, K.L. McMillan, D.L. Dill, and L.J. Hwang. Symbolic model checking: 1020 states and beyond. In Proc. 5th Symp. on Logic in Computer Science, pages 428-439, Philadelphia, June 1990.
15. J.R. Burch, E.M. Clarke, K.L. McMillan, D.L. Dill, and L.J. Hwang. Symbolic model checking: 1020 states and beyond. Information and Computation, 98(2): 142-170, June 1992.
16. W. Cai and S.J. Turner. An approach to the run-time monitoring of parallel programs. The Computer JournaL, 37(4):333-345, 1994.
17. S. Campos, E.M. Clarke, and O. Grumberg. Selective quantitative analysis and interval model checking: Verifying different facets of a system. In Computer-Aided Verification, Proc. 8th Int'l Conf, volume 1102 of Lecture Notes in Computer Science, pages 257-268. Springer-Verlag, Berlin, 1996.
18. E.M. Clarke and I.A. Draghicescu. Expressibility results for linear-time and branching-time logics. In J.W. de Bakker, W.P. de Roever, and G. Rozenberg, editors, Proc. Workshop on Linear Time, Branching Time, and Partial Order in Logics and Models for Concurrency, volume 354 of Lecture Notes in Computer Science, pages 428-437. Springer-Verlag, 1988.
19. E.M. Clarke, 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.
20. 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.
21. E.M. Clarke, O. Grumberg, K.L. McMillan, and X. Zhao. Efficient generation of counterexamples and witnesses in symbolic model checking. In Proc. 32nd Design Automation Conference, pages 427-432. IEEE Computer Society, 1995.
22. E.M. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, 1999.
23. E.M. Clarke and R.P. Kurshan. Computer aided verification. IEEE Spectrum, 33:61-67, 1986.
24. E.M. Clarke, D.E. Long, and K.L. McMillan. Compositional model checking. In R. Parikh, editor, Proc. 4th IEEE Symp. on Logic in Computer Science, pages 353-362. IEEE Computer Society Press, 1989.
25. C. Courcoubetis, M.Y. Vardi, P. Wolper, and M. Yannakakis. Memory efficient algorithms for the verification of temporal properties. Formal Methods in System Design, 1:275-288, 1992.
26. W. Damm, G. Döhmen, V. Gerstner, and B. Josko. Modular verification of Petri nets: the temporal logic approach. In Stepwise Refinement of Distributed Systems: Models, Formalisms, Correctness (Proceedings of REX Workshop), volume 430 of Lecture Notes in Computer Science, pages 180-207, Mook, The Netherlands, May/June 1989. Springer-Verlag.
27. D. Dams, O. Grumberg, and R. Gerth. Generation of reduced models for checking fragments of CTL. In Proc. 5th Conf. on Computer Aided Verification, volume 697 of Lecture Notes in Computer Science, pages 479-490. Springer-Verlag, June 1993.
28. M. Daniele, P. Traverso, and M.Y. Vardi. Strong cyclic planning revisited. In S. Biundo and M. Fox, editors, 5th European Conference on Planning, pages 34-46, 1999.
29. N. Daniele, EGuinchiglia, and M.Y. Vardi. Improved automata generation for linear temporal logic. In Computer Aided Verification, Proc. 11th Int. Conference, volume 1633 of Lecture Notes in Computer Science, pages 249-260. Springer-Verlag, 1999.
30. E.A. Emerson. Temporal and modal logic. Handbook of Theoretical Computer Science, pages 997-1072,1990.
31. E.A. Emerson and E.M. Clarke. Characterizing correctness properties of parallel programs using fixpoints. In Proc. 7th Int'l Colloq. on Automata, Languages and Programming, pages 169-181,1980.
32. E.A. Emerson and J.Y Halpern. Decision procedures and expressiveness in the temporal logic of branching time. Journal of Computer and System Sciences, 30:1-24, 1985.
33. E.A. Emerson and J.Y. Halpern. Sometimes and not never revisited: On branching versus linear time. Journal of the ACM, 33(1):151-178,1986.
34. E.A. Emerson and C. Jutla. The complexity of tree automata and logics of programs. In Proc. 29th IEEE Symp. on Foundations of Computer Science, pages 328-337, White Plains, October 1988.
35. E.A. Emerson and C.-L. Lei. Modalities for model checking: Branching time logic strikes back. In Proc. 20th ACM Symp. on Principles of Programming Languages, pages 84-96, New Orleans, January 1985.
36. M.J. Fischer and RE. Ladner. Propositional dynamic logic of regular programs. Journal of Computer and Systems Sciences, 18:194-211,1979.
37. K. Fisler. Timing diagrams: Formalization and algorithmic verification. Journal of Logic, Language, and Information, 8:323-361, 1999.
38. K. Fisler and M.Y. Vardi. Bisimulation minimization in an automata-theoretic verification framework. In G. Gopalakrishnan and P. Windley, editors, Proc. Intl. Conference on Formal Methods in Computer-AidedDesign (FMCAD), number 1522 in Lecture Notes in Computer Science, pages 115-132. Springer-Verlag, 1998.
39. R. Fraer, G. Kamhi, L. Fix, and M.Y. Vardi. Evaluating semi-exhausting verification techniques for bug hunting. In Proc. 1st Int'l Workshopon Symbolic Model Checking (SMC'99), Electronic Notes in Theoretical Computer Science, pages 11-22. Elsevier, 1999.
40. D. Gabbay, A. Pnueli, S. Shelah, and J. Stavi. On the temporal analysis of fairness. In Proc. 7th ACM Symp. on Principles of Programming Languages, pages 163-173, January 1980.
41. R. Gerth, D. Peled, M.Y. Vardi, and P. Wolper. Simple on-the-fly automatic verification of linear temporal logic. In P. Dembiski and M. Sredniawa, editors, Protocol Specification, Testing, and Verification, pages 3-18. Chapman & Hall, August 1995.
42. R. Goering. Model checking expands verification's scope. Electronic Engineering Today, February 1997.
43. O. Grumberg and DE. Long. Model checking and modular verification. ACM Trans, on Programming Languages and Systems, 16(3):843-87l, 1994.
44. R.H. Hardin, Z. Har'el, and R.P. Kurshan. COSPAN. In Computer Aided Verification, Proc. 8th Int. Conference, volume 1102 of Lecture Notes in Computer Science, pages 423-427. Springer-Verlag, 1996.
45. D. Harel 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.
46. M. Hennessy and R. Milner. Algebraic laws for nondeterminism and concurrency. Journal of ACM, 32:137-161,1985.
47. C.A.R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985.
48. G.J. Holzmann. The model checker SPIN. IEEE Trans, on Software Engineering, 23(5):279-295, May 1997. Special issue on Formal Methods in Software Practice.
49. S.Y. Huang and K.T. Cheng. Formal Equivalence Checking and Design Debugging. Kluwer Academic publishers, 1998.
50. C.B. Jones. Specification and design of (parallel) programs. In R.E.A. Mason, editor, Information Processing 83: Proc. IF IP 9th World Congress, pages 321-332. IFIP, North-Holland, 1983.
51. B. Josko. Verifying the correctness of AADL modules using model chekcing. In Stepwise Refinement of Distributed Systems: Models, Formalisms, Correctness (Proceedings of REX Workshop), volume 430 of Lecture Notes in Computer Science, pages 386-400, Mook, The Netherlands, May/June 1989. Springer-Verlag.
52. D. Kozen. Results on the prepositional μ-calculus. Theoretical Computer Science, 27:333-354, 1983.
53. D. Kozen and L. Tiuryn. Logics of programs. Handbook of Theoretical Computer Science, pages 789-840,1990.
54. O. Kupferman andM.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.
55. O. Kupferman and M.Y. Vardi. Weak alternating automata are not that weak. In Proc. 5th Israeli Symp. on Theory of Computing and Systems, pages 147-158. IEEE Computer Society Press, 1997.
56. O. Kupferman and M.Y. Vardi. Freedom, weakness, and determinism: from linear-time to branching-time. In Proc. 13th IEEE Symp. on Logic in Computer Science, pages 81-92, June 1998.
57. O. Kupferman and M.Y. Vardi. Relating linear and branching model checking. In IFIP Working Conference on Programming Concepts and Methods, pages 304-326, New York, June 1998. Chapman & Hall.
58. O. Kupferman and M.Y. Vardi. Model checking of safety properties. In Computer Aided Verification, Proc. 11th Int. Conference, volume 1633 of Lecture Notes in Computer Science, pages 172-183. Springer-Verlag, 1999.
59. O. Kupferman and M.Y. Vardi. Vacuity detection in temporal model checking. In 10th Advanced Research Working Conference on Correct Hardware Design and Verification Methods, volume 1703 of Lecture Notes in Computer Science, pages 82-96. Springer-Verlag, 1999.
60. O. Kupferman and M.Y. Vardi. An automata-theoretic approach to modular model checking. ACM Transactions on Programming Languages and Systems, 22:87-128, 2000.
61. O. Kupferman, M.Y. Vardi, and P. Wolper. Module checking. To appear in Information and Computation, 2001.
62. R.P. Kurshan. Computer Aided Verification of Coordinating Processes. Princeton Univ. Press, 1994.
63. R.P. Kurshan. FormalCheck User's Manual. Cadence Design, Inc., 1998.
64. P. Ladkin and S. Leue. What do message sequence charts means? In R.L. Tenney, P.D. Amer, and M.Ü. Uyar, editors, Proc. 6th Int'l Conf. on Formal Description Techniques. North Holland, 1994.
65. L. Lamport. Sometimes is sometimes "not never" - on the temporal logic of programs. In Proc. 7th ACM Symp. on Principles of Programming Languages, pages 174-185, January 1980.
66. L. Lamport. Specifying concurrent program modules. ACM Trans, on Programming Languages and Systenms, 5:190-222,1983.
67. L. Lamport. The temporal logic of actions. ACM Transactions on Programming Languages and Systems, 16:872-923,1994.
68. O. Lichtenstein and A. Pnueli. Checking that finite state concurrent programs satisfy their linear specification. In Proc. 12th ACM Symp. on Principles of Programming Languages, pages 97-107, New Orleans, January 1985.
69. O. Lichtenstein, A. Pnueli, and L. Zuck. The glory of the past, in Logics of Programs, volume 193 of Lecture Notes in Computer Science, pages 196-218, Brooklyn, June 1985. Springer-Verlag.
70. Monika Maidl. The common fragment of CTL and LTL. In Proc. 41th Symp. on Foundations of Computer Science, pages 643-652,2000.
71. Z. Manna and A. Pnueli. The anchored version of the temporal framework. In Linear time, branching time, and partial order in logics and models for concurrency, volume 345 of Lecture Notes in Computer Science, pages, 201-284. Springer-Verlag, 1989.
72. Z. Manna and A. Pnueli. Temporal specification and verification of reactive modules. 1992.
73. K. L. McMillan. Verification of an implementation of Tomasulo's algorithm by compositional model checking. In Proc. 10th Conference on Computer Aided Verification, volume 1427 of Lecture Notes in Computer Science, cages 110-121. Springer-Verlag, 1998.
74. K.L. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, 1993.
75. R. Milner. An algebraic definition of simulation between programs. In Proc. 2nd international Joint Conference on Artificial Intelligence, cages 48l-489. British Computer Society, September 1971.
76. R. Milner. Communication and Concurrecny. Prentice-Hall, Englewood Clifs, 1989.
77. B. Misra and K.M. Chandy. Proofs of networks of processes. IEEE Trans, on Software Engineering,7:417-426, 1981.
78. A. Urquhart N. Rescher. Temporal Logic. Springer-Verlag, 1971.
79. D. Park. Concurrency and automata on infinite sequences. In P. Deussen, editor, Proc. 5th GI Conf on Theoretical Computer Science, Lecture Notes in Computer Science, Vol. 104. Springer-Verlag, Berlin/New York, 1981.
80. A. Pnueli. The temporal logic of programs. In Proc. 18th IEEE Symp. on Foundation of Computer Science, pages 46-57, 1977.
81. A. Pnueli. In transition from global to modular temporal reasoning about programs. In K. Apt, editor, Logics and Models of Concurrent Systems, volume F-13 of NATO Advanced Summer Institutes, pages 123-144. Springer-Verlag, 1985.
82. A. Pnueli. Linear and branching structures in the semantics and logics of reactive systems. In Proc. 12th Int. Colloquium on Automata, Languages and Programming, pages 15-32. Lecture Notes in Computer Science, Springer-Verlag, 1985.
83. A. Pnueli and R. Rosner. On the synthesis of a reactive module. In Proc. 16th ACM Symp. on Principles of Programming Languages, pages 179-190, Austin, January 1989.
84. A. Pnueli and R. Rosner. On the synthesis of an asynchronous reactive module. In Proc. 16th Int. Colloquium on Automata, Languages and Programming, volume 372, pages 652-671. Lecture Notes in Computer Science, Springer-Verlag, July 1989.
85. A. Prior. Past, Present, and Future. Oxford Univ. Press, 1951.
86. J.P. Queille and J. Sifakis. Specification and verification of concurrent systems in Cesar. In Proc. 5th International Symp. on Programming, volume 137 of Lecture Notes in Computer Science, pages 337-351. Springer-Verlag, 1981.
87. W.P. DeRoever R. Koymans, J. Vytopil. Real-time programming and asynchronous message passing. In Proc. 2nd ACM Symp. on Principles of Distributed Computing, pages 187-197,1983.
88. K. Ravi, R. Bloem, and E Somenzi. A comparative study of symbolic algorithms for the computation of fair cycles. In W. A. Hunt, Jr. and S. D. Johnson, editors, Formal Methods in Computer Aided Design, Lecture Notes in Computer Science 1954, pages 143-160. Springer-Verlag, 2000.
89. K. Ravi and E Somenzi. High-density reachability analysis. In Proc. Int'l Confi on Computer-Aided Design, pages 154-158, San Jose, 1995.
90. T. Schlipf, T. Buechner, R. Fritz, M. Helms, and J. Koehl. Formal verification made easy. IBM Journal of Research and Development, 41(4:5), 1997.
91. A.P. Sistla and E.M. Clarke. The complexity of propositional linear temporal logic. Journal ACM, 32:733-749,1985.
92. A.P. Sistla, M.Y. Vardi, and P. Wolper. The complementation problem for Büchi automata with applications to temporal logic. Theoretical Computer Science, 49:217-237,1987.
93. E.W. Stark. Foundations of theory of specifications for distributed systems. PhD thesis, M.I.T., 1984.
94. C. Stirling. Modal and temporal logics. Handbook ofLogic in Computer Science,2:477-563, 1992.
95. W. Thomas. A combinatorial approach to the theory of ω-automata. Information and Computation, 48:261-283, 1981.
96. W. Thomas. Automata on infinite objects. Handbook of Theoretical Computer Science, pages 165-191,1990.
97. H.J. Touati, R.K. Brayton, and R. Kurshan. Testing language containment for ω-automata usingBDD's. Information and Computation, 118(1):101-109, April 1995.
98. M.Y. Vardi. A temporal fixpoint calculus. In Proc. 15th ACM Symp. on Principles of Programming Languages, pages 250-259, San Diego, January 1988.
99. M.Y. Vardi. An automata-theoretic approach to linear temporal logic. In E Moller and G. Birtwistle, editors, Logics for Concurrency: Structure versus Automata, volume 1043 of Lecture Notes in Computer Science, cages 238-266. Springer-Verlag, Berlin, 1996.
100. M.Y. Vardi. Linear vs. branching time: A complexity-theoretic perspective. In Proc. 13th IEEE Sym.. on Logic in Computer Science, pages 394-405,1998.
101. M.Y. Vardi. Sometimes and not never re-revisited: on branching vs. linear time. In D. San-giorgi and R. de Simone, editors, Proc. 9th Int'l Conf. on Concurrency Theory, Lecture Notes in Computer Science 1466, pages 1-17, 1998.
102. 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.
103. M.Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In Proc. 1st Symp. on Logic in Computer Science, pages 332-344, Cambridge, June 1986.
104. M.Y. Vardi and P. Wolper. Reasoning about infinite computations. Information and Computation, 115(1): 1-37, November 1994.
105. P. Wolper. Temporal logic can be more expressive. Information and Control, 56(1-2):72-99, 1983.
106. J. Yuan, J. Shen, J. Abraham, and A. Aziz. On combining formal and informal verification. In Computer Aided Verification, Proc. 9th Int. Conference, volume 1254 of Lecture Notes in Computer Science, pages 376-387. Springer-Verlag, 1997.