Vacuity detection in temporal model checking

International Journal on Software Tools for Technology Transfer

Volumn 4, Issue 2, 2003, Pages 224-233

  Kupferman, Orna ^a   Vardi, Moshe Y ^b  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b Rice University   (United States)

Author keywords

Model checking; Vacuous satisfaction

Indexed keywords

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

ERRORS; MODEL CHECKING; QUERY PROCESSING; TOOLS;

SPECIFICATIONS;

EID: 84896693498     PISSN: 14332779     EISSN: 14332787     Source Type: Journal    
DOI: 10.1007/s100090100062     Document Type: Article

References (30)

1. Beaty, D., Bryant, R.: Formally verifying a microprocessor using a simulation methodology. In: Proc. 31st Design Automation Conference, pp. 596-602. IEEE Computer Society, 1994
2. Beer, I., Ben-David, S., Eisner, C., Rodeh Y.: Efficient detection of vacuity in ACTL formulas. Formal Methods Syst Design 18(2): 141-162, 2001
3. Browne, M.C., Clarke, E.M., Grumberg, O.: Characterizing finite Kripke structures in propositional temporal logic. Theoret Comput Sci 59: 115-131, 1988
4. Bloem, R., Ravi, K., Somenzi, F.: Efficient decision procedures for model checking of linear time logic properties. In: Computer Aided Verification, Proc. 11th Int. Conference. LNCS 1633. Berlin, Heidelberg, New York: Springer-Verlag, 1999, pp. 222-235
5. Clarke, E.M., Draghicescu, I.A.: Expressibility results for linear-time, branching-time logics. In: de Bakker, J.W., de Roever, W.P., Rozenberg, G. (eds.): Proc. Workshop on Linear Time, Branching Time, and Partial Order in Logics and Models for Concurrency. LNCS354. Berlin, Heidelberg, New York: Springer-Verlag, 1998, pp. 428-437
6. Clarke, E.M., Emerson, E.A.: Design and synthesis of synchronization skeletons using branching time temporal logic. In: Proc. Workshop on Logic of Programs. LNCS131. Berlin, Heidelberg, New York: Springer-Verlag, 1981, pp. 52-71
7. Clarke, E.M., Emerson, E.A., Sistla, A.P.: Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Trans Program Lang Syst 8(2): 244-263, 1986
8. Clarke, E.M., Grumberg, O., Long D.: Verification tools for finite-state concurrent systems. In: de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.): Decade of Concurrency - Reflections and Perspectives (Proceedings of REX School). LNCS 803. Berlin, Heidelberg, New York: Springer- Verlag, 1993, pp. 124-175
9. Clarke, E.M., Grumberg, O., McMillan, K.L., Zhao, X.: Efficient generation of counterexamples and witnesses in symbolic model checking. In: Proc. 32nd Design Automation Conference, pp. 427-432. IEEE Computer Society, 1995
10. Chockler, H., Kupferman, O., Vardi, M.Y.: Coverage metrics for temporal logic model checking. In: Tools and algorithms for the construction, analysis of systems. LNCS2031. Berlin, Heidelberg, New York: Springer-Verlag, 2001, pp. 528-542
11. Emerson, E.A., Jutla, C.: The complexity of tree automata and logics of programs. In: Proc. 29th IEEE Symp. on Foundations of Computer Science, pp. 328-337, White Plains, October 1988
12. Emerson, E.A., Lei, C.-L.: Modalities for model checking: Branching time logic strikes back. Sci Comput Program 8: 275-306, 1987
13. Emerson, E.A.: Temporal and modal logic. Handbook of Theoretical Computer Science, pp. 997-1072, 1990
14. Francez, N.: Fairness. Texts and Monographs in Computer Science. Springer, Berlin Heidelberg New York, 1986
15. Hoskote, Y., Kam, T., Ho, P.-H., Zhao, X.: Coverage estimation for symbolic model checking. In: Proc. 36th Design automation conference, pp. 300-305, 1999
16. Katz, S., Geist, D., Grumberg, O.: "Have I written enough properties? a method of comparison between specification and implementation. In: 10th Advanced Research Working Conference on Correct Hardware Design and Verification Methods. LNCS1703. Berlin, Heidelberg, New York: Springer-Verlag, 1999, pp. 280-297
17. Kurshan, R.P.: FormalCheck User's Manual. Cadence Design, 1998
18. Kupferman, O., Vardi, M.Y.: On the complexity of branching modular model checking. In: Proc. 6th Conference on Concurrency Theory. LNCS962. Berlin, Heidelberg, New York: Springer-Verlag, 1995, pp. 408-422
19. th IEEE Symp. on Logic in Computer Science, pp. 81-92, June 1998
20. Kupferman, O., Vardi, M.Y.: Relating linear and branching model checking. In: IFIP Working Conference on Programming Concepts and Methods, pp. 304-326, New York, June 1998. Chapman & Hall, London
21. Lichtenstein, O., Pnueli, A.: Checking that finite state concurrent programs satisfy their linear specification. In: Proc. 12th ACM Symp. on Principles of Programming Languages, pp. 97-107, New Orleans, January 1985
22. Muller, D.E., Schupp, P.E.: Simulating alternating tree automata by nondeterministic automata: new results and new proofs of theorems of Rabin, McNaughton and Safra. Theoret Comput Sci 141: 69-107, 1995
23. Pnueli, A.: The temporal semantics of concurrent programs. Theoret Comput Sci 13: 45-60, 1981
24. Plessier, B., Pixley, C.: 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
25. Queille, J.P., Sifakis, J.: Specification and verification of concurrent systems in Cesar. In: Proc. 5th International Symp. on Programming. LNCS137. Berlin, Heidelberg, New York: Springer-Verlag, 1981, pp. 337-351
26. Sistla, A.P., Clarke, E.M.: The complexity of propositional linear temporal logic. J ACM 32: 733-749, 1985
27. Vardi, M.Y., Stockmeyer, L.: Improved upper and lower bounds for modal logics of programs. In: Proc 17th ACM Symp. on Theory of Computing, pp. 240-251, 1985
28. Vardi, M.Y., Wolper, P.: An automata-theoretic approach to automatic program verification. In: Proc. 1st Symp. on Logic in Computer Science, pp. 332-344, Cambridge, June 1986
29. Vardi, M.Y., Wolper, P.: Automata-theoretic techniques for modal logics of programs. J Comput Syst Sci 32(2): 182-221 1986
30. Vardi, M.Y., Wolper, P.: Reasoning about infinite computations. Inf Comput 115(1): 1-37, 1994