Vacuity detection in temporal model checking

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

Volumn 1703, Issue , 1999, Pages 82-98

  Kupferman, Orna ^a   Vardi, Moshe Y ^b  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b Rice University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; DESIGN; ERRORS; HARDWARE; QUERY PROCESSING; RECONFIGURABLE HARDWARE; SPECIFICATIONS; TEMPORAL LOGIC;

AUTOMATIC REASONING; GENERAL METHOD; LOGIC MODEL CHECKING; MODEL CHECKING TOOLS; TEMPORAL LOGIC SPECIFICATIONS; TEMPORAL MODELING; TRUTH VALUES; VACUITY DETECTION;

MODEL CHECKING;

EID: 84958653774     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48153-2_8     Document Type: Conference Paper

References (28)

1. D. Beaty and R. Bryant. Formally verifying a microprocessor using a simulation methodology. In Proc. 31st DAC, pp. 596–602. IEEE Computer Society, 1994.
2. I. Beer, S. Ben-David, C. Eisner, and Y. Rodeh. Efficient detection of vacuity in ACTL formulas. In Proc. 9th CAV, LNCS 1254, pp. 279–290, 1997.
3. R. Bloem, K. Ravi, and F. Somenzi. Efficient decision prcedures for model checking of linear time logic properties. In Proc. 11th CAV, LNCS, 1999.
4. E. M. Clarke and I. A. Draghicescu. Expressibility results for linear-time and branching-time logics. In Proc. Workshop on Linear Time, Branching Time, and Partial Order in Logics and Models for Concurrency, LNCS 354, pp. 428–437, 1988
5. 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, LNCS 131, pp. 52–71, 1981.
6. 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, 1986.
7. E. M. Clarke, O. Grumberg, and D. Long. Verification tools for finite-state concurrent systems. In Decade of Concurrency – Reflections and Perspectives (Proceedings of REX School), LNCS 803, pp. 124–175, 1993.
8. E. M. Clarke, O. Grumberg, K. L. McMillan, and X. Zhao. Efficient generation of counterexamples and witnesses in symbolic model checking. In Proc. 32nd DAC, pp. 427–432. IEEE Computer Society, 1995.
9. E. Clarke. Private communication, 1997.
10. E. A. Emerson and C. Jutla. The complexity of tree automata and logics of programs. In Proc. 29th FOCS, pp. 368–377, White Plains, 1988.
11. E. A. Emerson and C.-L. Lei. Modalities for model checking: Branching time logic strikes back. Science of Computer Programming, 8:275–306, 1987.
12. E. A. Emerson. Temporal and modal logic. Handbook of Theoretical Computer Science, pp. 997–1072, 1990.
13. N. Francez. Fairness. Texts and Monographs in Computer Science. Springer-Verlag, 1986.
14. S. Katz, D. Geist, and O. Grumberg. “Have I written enough properties ?” a method of comparison between specification and implementation. In 10th CHARME, LNCS, 1999.
15. R. P. Kurshan. FormalCheck User’s Manual. Cadence Design, Inc., 1998.
16. O. Kupferman and M. Y. Vardi. On the complexity of branching modular model checking. In Proc. 6th CONCUR, LNCS 962, pp. 408–422, 1995.
17. O. Kupferman and M. Y. Vardi. Freedom, weakness, and determinism: from linear-time to branching-time. In Proc. 13th LICS, pp. 81–92, 1998.
18. O. Kupferman and M. Y. Vardi. Relating linear and branching model checking. In PROCOMET, pp. 304–326, 1998. Chapman & Hall.
19. O. Lichtenstein and A. Pnueli. Checking that finite state concurrent programs satisfy their linear specification. In Proc. 12th POPL, pp. 97–107, 1985.
20. D. E. Muller and P. E. Schupp. Simulating alternating tree automata by nondeterministic automata: New results and new proofs of theorems of Rabin, McNaughton and Safra. Theoretical Computer Science, 141:69–07, 1995.
21. A. Pnueli. The temporal semantics of concurrent programs. Theoretical Computer Science, 13:45–60, 1981.
22. B. Plessier and C. Pixley. Formal verification of a commercial serial bus interface. In Proc. of 14th Annual IEEE International Phoenix Conf. On Computers and Communications, pp. 378–382, March 1995.
23. J. P. Queille and J. Sifakis. Specification and verification of concurrent systems in Cesar. In Proc. 5th International Symp. on Programming, pp. 337–351, LNCS 137, 1981.
24. A. P. Sistla and E. M. Clarke. The complexity of propositional linear temporal logic. Journal ACM, 32:733–749, 1985.
25. M. Y. Vardi and L. Stockmeyer. Improved upper and lower bounds for modal logics of programs. In Proc 17th STOC, pp. 240–251, 1985.
26. M. Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In Proc. 1st LICS, pp. 322–331, 1986.
27. 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.
28. M. Y. Vardi and P. Wolper. Reasoning about infinite computations. Information and Computation, 115(1):1–37, November 1994.