Efficient model checking via büchi tableau automata

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

Volumn 2102, Issue , 2001, Pages 38-52

  Bhat, Girish S ^a   Cleaveland, Rance ^b   Groce, Alex ^c  

^a Cosine Communications Inc ^*  (United States)

^b STONY BROOK UNIVERSITY   (United States)

^c Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTER AIDED ANALYSIS; COMPUTER CIRCUITS; RECONFIGURABLE HARDWARE; TEMPORAL LOGIC;

ALTERNATING TREE AUTOMATON; COMPILE TIME; INFERENCE RULES; MODEL CHECKER; NC VERIFICATION; ON THE FLIES; SYSTEM PROPERTY; TEMPORAL FORMULAE;

MODEL CHECKING;

EID: 84958768224     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44585-4_5     Document Type: Conference Paper

References (32)

1. LICS '86, Cambridge, Massachusetts, June 1986. IEEE Computer Society Press.
2. R. Alur, C. Courcoubetis, and D. Dill. Model-checking for real-time systems. In LICS '90, pages 414-125, Philadelphia, Jun. 1990. IEEE Computer Society Press.
3. H.R. Andersen. Model checking and boolean graphs. 7CS, 126(1):3-30, Apr. 1994.
4. H.R. Andersen. Partial model checking. In LICS '95, pages 398-107, San Diego, Jul. 1995. IEEE Computer Society Press.
5. G. Bhat and R. Cleaveland. Efficient local model checking for fragments of the modal /i-calculus. In T. Margaria and B. Steffen, eds., TACAS '96, LNCS 1055:107-126, Passau, Mar. 1996. Springer-Verlag.
6. G. Bhat and R. Cleaveland. Efficient model checking via the equational /-calculus. In LICS '96, pages 304-312, New Brunswick, Jul. 1996. IEEE Computer Society Press.
7. G. Bhat, R. Cleaveland, and G. Luettgen. A practical approach to implementing real-time semantics. Annals of Software Engineering, 7:127-155, Oct. 1999.
8. J.R. Burch, E.M. Clarke, K.L. McMillan, D.L. Dill, and L.J. Hwang. Symbolic model checking: 1020 states and beyond. Information and Computation, 98(2):142-170, Jun. 1992.
9. E.M. Clarke, E.A. Emerson, and A.P. Sistla. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM TOPLAS, 8(2):244-263, Apr. 1986.
10. E.M. Clarke and J.M. Wing. Formal methods: state of the art and future directions. ACM Computing Surveys, 28(4):626-643, Dec. 1996.
11. R. Cleaveland, G. Luettgen, V. Natarajan, and S. Sims. Modeling and verifying distributed systems using priorities: A case study. Software Concepts and Tools, 17(2):50-62, 1996.
12. R. Cleaveland and S. Sims. The NCSU Concurrency Workbench. In R. Alur and T. Hen-zinger, eds., CAV '96, LNCS 1102:394-397, New Brunswick, Jul. 1996. Springer-Verlag.
13. R. Cleaveland and S. Sims. Generic tools for verifying concurrent systems. Science of Computer Programming, to appear.
14. R. Cleaveland and B. Steffen. A linear-time model-checking algorithm for the alternation-free modal mu-calculus. Formal Methods in System Design, 2:121-147, 1993.
15. C. Courcoubetis, M.Y. Vardi, P. Wolper, and M. Yannakakis. Memory efficient algorithms for verification of temporal properties. Formal Methods in System Design, 1:275-288, 1992.
16. M. Dam. CTL* and ECTL* as fragments of the modal mu-calculus. TCS, 126(1):77-96, Apr. 1994.
17. E.A. Emerson, C. Jutla, and A.P. Sistla. On model-checking for fragments of /-calculus. In C. Courcoubetis, ed., CAV '93, LNCS 697:385-396, Elounda, Jul. 1993. Springer-Verlag.
18. E.A. Emerson and C.-L. Lei. Efficient model checking in fragments of the propositional mu-calculus. In [1], pages 267-278.
19. K. Etessami and G. Holzmann. Optimizing buechi automata. In C. Palamidessi, ed., CONCUR 2000, LNCS 1877:153-169, State College, Aug. 2000. Springer-Verlag.
20. R. Gerth, D. Peled, M. Vardi, and P. Wolper. Simple on-the-fly automatic verification of linear temporal logic. In PSTV '95, pages 3-18, Warsaw, Jun. 1995. Chapman and Hall.
21. G.J. Holzmann. Design and Validation of Computer Protocols. Prentice-Hall, 1991.
22. D. Kozen. Results on the propositional /-calculus. TCS, 27(3):333-354, Dec. 1983.
23. O. Kupferman, M.Y. Vardi, and P. Wolper. An automata-theoretic approach to branching-time model checking. JACM, 47(2):312-360, Mar. 2000.
24. K. Larsen, P. Pettersson, and W. Yi. UPPAAL in a nutshell. Software Tools for Technology Transfer, 1(1-2):134-152, Oct. 1997.
25. R. Mateescu and H. Garavel. XTL: A meta-language and tool for temporal logic model-checking. In T. Margaria and B. Steffen, eds., STTT'98, Aalborg, Jul. 1998.
26. R. Milner. Communication and Concurrency. Prentice-Hall, London, 1989.
27. J.P. Queille and J. Sifakis. Specification and verification of concurrent systems in CESAR. In M. Dezani-Ciancaglini and U. Montanari, eds., Proc. Int. Symp. in Programming, LNCS 137: 337-351, Turin, Apr. 1982. Springer-Verlag.
28. F. Somenzi and R. Bloem. Efficient Biichi automata from LTL formulae. In E.A. Emerson and A.P. Sistla, eds., CAV2000, LNCS 1855:247-263, Chicago, Jul. 2000. Springer-Verlag.
29. M. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In [1], pages 332-344.
30. W. Visser and H. Barringer. Practical CTL* model checking - should SPIN be extended? Software Tools for Technology Transfer, 2(4):350-365, Apr. 2000.
31. W. Visser, H. Barringer, D. Fellows, G. Gough, and A. Williams. Efficient CTL* model checking for analysis of rainbow designs. In H. Li and D. Probst, eds., CHARME'97, pages 128-145, Montreal, Oct. 1997. IFIP WG 10.5, Chapman and Hall.
32. J. Yang, A. Mok, and Farn Wang. Symbolic model checking for event-driven real-time systems. ACM TOPLAS 19(2):386-412, Mar. 1997.