On locally checkable properties

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

Volumn 4246 LNAI, Issue , 2006, Pages 302-316

  Kupferman, Orna ^a   Lustig, Yoad ^a   Vardi, Moshe Y ^b,c  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b Rice University   (United States)

^c MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STORAGE EQUIPMENT; FORMAL LANGUAGES; MATHEMATICAL MODELS;

COMPUTATION CYCLES; MODEL CHECKING; RUN-TIME VERIFICATION;

COMPUTATION THEORY;

EID: 33845199945     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11916277_21     Document Type: Conference Paper

References (20)

1. M. Aagaard, R.B. Jones, and C.-J.H Seger. Combining theorem proving and trajectory evaluation in an industrial environment. In 35th DAC, pp. 538-541, 1998.
2. B. Alpern and F.B. Schneider. Defining liveness. IPL, 21:181-185, 1985.
3. B. Alpern and F.B. Schneider. Recognizing safety and liveness. Distributed computing, 2:117-126, 1987.
4. H. Barringer, A. Goldberg, K. Havelund, and K. Sen. Rule-based runtime verification. In Proc. 5th VMCAI, LNCS 2937, pages 44-57, 2004.
5. I. Beer, S. Ben-David, and A. Landver. On-the-fly model checking of RCTL formulas. In Proc. 10th CAV, LNCS 1427, pages 184-194, 1998.
6. E. M. Clarke, A. Bierea, R. Raimi, and Y. Zhu. Bounded model checking using satisfiability solving. FMSD, 19(1):7-34, 2001.
7. M. d'Amorim and G. Rosu. Efficient monitoring of omega-languages. In Proc. 17th CAV, LNCS 3576, 2005.
8. K. Havelund and G. Rosu. Synthesizing monitors for safety properties. In Proc. 8th TACAS, LNCS 2280, pages 342-356, 2002.
9. T.A. Henzinger, S.C. Krishnan, O. Kupferman, and F.Y.C. Mang. Synthesis of uninitialized systems. In Proc. 29th ICALP, LNCS 2380, pages 644-656, 2002.
10. O. Kupferman and M.Y. Vardi. Model checking of safety properties. Formal methods in System Design, 19(3):291-314, November 2001.
11. O. Kupferman and M.Y. Vardi. On bounded specifications. In Proc. 8th LPAR, LNCS 2250, pages 24-38. 2001.
12. R.P. Kurshan. Computer Aided Verification of Coordinating Processes. Princeton Univ. Press, 1994.
13. R. McNaughton and S. Papert. counter-free automata. MIT Pres, 1971.
14. A. Pnueli. The temporal semantics of concurrent programs. TCS, 13:45-60, 1981.
15. C.J.H. Seger and R.E. Bryant. Formal verification by symbolic evaluation of partially-ordered trajectories. FMSD, 6:147-189, 1995.
16. A.P. Sistla. Safety, liveness and fairness in temporal logic. Formal Aspects of Computing, 6:495-511, 1994.
17. W. Thomas. Automata on infinite objects. Handbook of Theoretical Computer Science, pages 133-191, 1990.
18. M.Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In Proc. 1st LICS, pages 332-344, 1986.
19. M.Y. Vardi and P. Wolper. Reasoning about infinite computations. Information and Computation, 115(1):1-37, November 1994.
20. T. Wilke. Locally threshold testable languages of infinite words. In 10th STAGS, LNCS 665, pages 607-616. 1993.