Regular vacuity

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

Volumn 3725 LNCS, Issue , 2005, Pages 191-206

  Bustan, Doron ^b   Flaisher, Alon ^a   Grumberg, Orna ^a   Kupferman, Orna ^c   Vardi, Moshe Y ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b RICE UNIVERSITY   (United States)

^c HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL SPECIFICATION; MODEL-CHECKING TOOLS; POLARITY CONSTRAINTS;

COMPUTER SCIENCE; CONSTRAINT THEORY; ERROR ANALYSIS; FINITE AUTOMATA; FORMAL LOGIC; MATHEMATICAL MODELS;

LARGE SCALE SYSTEMS;

EID: 33646406278     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11560548_16     Document Type: Conference Paper

References (27)

1. Accellera-www.accellera.org.
2. R. Armon, L. Fix, A. Flaisher, O. Grumberg, N. Piterman, A. Tiemeyer, and M. Vardi. Enhanced vacuity detection for linear temporal logic. In Proc 15th CAV, LNCS 2725, 2003.
3. R. Armoni et al. The ForSpec temporal logic: A new temporal property-specification logic. In 8th TACAS, LNCS 2280, pages 296-211, 2002
4. I. Beer, S. Ben-David, C. Eisner, D. Fisman, A. Gringauze, and Y. Rodeh. The temporal logic sugar. In Proc. 13th CAV, LNCS 2102, pages 363-367, 2001.
5. I. Beer, S. Ben-David, C. Eisner, and Y. Rodeh. Efficient detection of vacuity in ACTL formulas. FMSD 18(2): 141-162, 2001.
6. E. Börger, E. Grädel, and Y. Gurevich. The Classical Decision Problem, 1996.
7. J. Bücni. On a decision method in restricted second order arithmetic. In Proc. Internat. Congr. Logic, Method, and Philos. Sci. 1960, pages 1-12, Stanford, 1962.
8. E. Clarke, O. Grumberg, K. McMillan, and X. Zhao. Efficient generation of counterexamples and witnesses in symbolic model checking. In Proc. 32nd DAC, pages 427-432, 1995.
9. E. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, 1999.
10. T. Eiter, G. Gottlob, and T. Schwentick. Second-order logic over strings: Regular and non-regular fragments. Developments in Language Theory, pages 37-56, 2001.
11. M. Fischer and R. Ladner. Prepositional dynamic logic of regular programs. JCSS, 18:194-211, 1979.
12. P. Gastin and D. Oddoux. Fast LTL to büchi automata translation. In Proc. 13th CAV, LNCS 2102, pages 53-65, 2001.
13. R. Gerth, D. Peled, M. Vardi, and P. Wolper. Simple on-the-fly automatic verification of linear temporal logic. In Protocol Specification, Testing, and Verification, pages 3-18. Chapman & Hall, August 1995.
14. G. Gottlob, P. G. Kolaitis, and T. Schwentick. Existential second-order logic over graphs: Charting the tractability frontier. JACM, 51(2):312-362, 2000.
15. A. Gurfinkel and M. Checnik. Extending extended vacuity. In 5th FMCAD, LNCS 2212, pages 306-321, 2004.
16. A. Gurfinkel and M. Checnik. How vacuous is vacuous. In Proc. 10th TACAS, LNCS 2988, pages 451-466, 2004.
17. J. Henriksen and P. Thiagarajan. Dynamic linear time temporal logic. Annals of Pure and Applied Logic, 96(1-3):187-207, 1999.
18. J. Hopcroft and J. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979.
19. O. Kupferman and M. Vardi. Vacuity detection in temporal model checking. STTT, 4(2):224-233, February 2003.
20. R. Kurshan. FormalCheck User's Manual. Cadence Design, Inc., 1998.
21. Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer-Verlag, Berlin, January 1992.
22. M. Purandare and F. Somenzi. Vacuum cleaning CTL formulae. In Proc. 14th CAV, LNCS 2404, pages 485-499, 2002.
23. M. Rabin. Decidability of second order theories and automata on infinite trees. Transaction of the AMS, 141:1-35, 1969.
24. M. Savelsberg and P. van emde Boas. Bounded tiling, an alternative to satisfiability. In 2nd Frege conference, pages 354-363. Akademya Verlag, 1984.
25. A. Sistla and E. Clarke. The complexity of prepositional linear temporal logic. Journal ACM, 32:733-749, 1985.
26. M. Vardi. Nontraditional applications of automata theory. In Proc. STACS, LNCS 789, pages 575-597, 1994.
27. M. Vardi and P. Wolper. Reasoning about infinite computations. Information and Computation, 115(1):1-37, November 1994.