Buy one, get one free !!!

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

Volumn 827 LNAI, Issue , 1994, Pages 210-224

  Bernholtz, Orna ^a   Grumberg, Orna ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; DISTRIBUTED COMPUTER SYSTEMS; MODEL CHECKING; SPECIFICATION LANGUAGES; SPECIFICATIONS;

ACTIVE AREA; EXPRESSIVE POWER; LINEAR TIME; LTL MODEL-CHECKING; MODEL CHECKER; NEW APPROACHES; SUBLANGUAGES;

TEMPORAL LOGIC;

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

References (19)

1. M.C. Browne. An improved algorithm for the automatic verification of finite state systems using temporal logic. In Proceedings of the First Symposium on Logic in Computer Science, pages 260-266, Cambridge, June 1986.
2. R.E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers, C-35(8), 1986.
3. E.M. Clarke 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.
4. 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.
5. E.A. Emerson and E.M. Clarke. Using branching time logic to synthesize synchronization skeletons. Science of Computer Programming, 2:241-266, 1982.
6. 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.
7. E.A. Emerson and C. Jutla. The complexity of tree automata and logics of programs. In Proceedings of the 29th IEEE Symposium on Foundations of Computer Science, White Plains, Oct 1988.
8. E.A. Emerson. Temporal and modal logic. Handbook of theoretical computer science, pages 997-1072, 1990.
9. A.E. Emerson and A.P. Sistla. Deciding full branching time logics. Information and Control, 61(3):175-201, 1984.
10. O. Grumberg and D. Long. Model checking and modular verification. In Proc. 2nd Conference on Concurrency Theory, volume 527 of Lecture Notes in Computer Science, 1991.
11. L. Lamport. Sometimes is sometimes “not never” - on the temporal logic of programs. In Proceedings of the 7th A CM Symposium on Principles of Programming Languages, pages 174-185, January 1980.
12. K.L. McMillan. Symbolic model checking. Kluwer Academic Publishers, 1993.
13. A. Pnueli. The tempor semantics of concurrent programs. Theoretical Computer Science, 13:45-60, 1981.
14. M.O. Rabin. Weakly definable relations and special automata. In Proc. Syrup. Math. Logic and Foundations of Set Theory, pages 1-23. North Holland, 1970.
15. A.P. Sistla and E.M. Clarke. The complexity of propositional linear time logic. ACM, 32(3):733-749, 1985.
16. R.E. Tarjan. Depth first search and linear graph algorithms. SIAM Journal of Computing, 1(2):146-160, 1972.
17. P. Wolper and P. Godefroid. Partial-order methods for temporal verification. In Proc. 4th Conferance on Concurrency Theory, volume 715 of Lecture Notes in Computer Science, pages 233-246, Hildesheim, August 1993. Springer-Verlag.
18. P. Wolper. Specification and synthesis of communicating processes using an extended temporal logic. In Proc. 9th Symposium on Principles of Programming Languageseedings, pages 20-33, Albuquerque, January 1982.
19. P. Wolper. Temporal logic can be more expressive. Information and Control, 56(1-2):72-99, 1983.