Checking finite traces using alternating automata

Electronic Notes in Theoretical Computer Science

Volumn 55, Issue 2, 2001, Pages 147-163

  Finkbeiner, Bernd ^a   Sipma, Henny ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALTERNATING AUTOMATA; FINITE TRACES; TEMPORAL LOGIC; TEMPORAL SPECIFICATION;

AUTOMATA THEORY; COMPUTER HARDWARE DESCRIPTION LANGUAGES; COMPUTER PROGRAM LISTINGS; COMPUTER SOFTWARE; FORMAL LOGIC; MATHEMATICAL OPERATORS;

ALGORITHMS;

EID: 11344251425     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)00250-6     Document Type: Conference Paper

References (12)

1. Bjørner N.S., Browne A., Colón M., Finkbeiner B., Manna Z., Sipma H.B., Uribe T.E. Verifying temporal properties of reactive systems: A STeP tutorial. Formal Methods in System Design. 16:(3):June 2000;227-270
2. th International SPIN Workshop, vol. 1885 of LNCS, pages 323-330. Springer-Verlag, 2000.
3. th International SPIN Workshop, vol. 1885 of LNCS, pages 245-264. Springer-Verlag, 2000.
4. K. Havelund and G. Rosu. Testing linear temporal logic formula on finite execution traces. 2001. Submitted for publication.
5. Z. Manna and A. Pnueli. Specification and verification of concurrent programs by ∀-automata. In B. Banieqbal, H. Barringer, and A. Pnueli, editors, Temporal Logic in Specification, number 398 in LNCS, pages 124-164. Springer-Verlag, Berlin, 1987.
6. Also in Proc. 14th ACM Symp. Princ. of Prog. Lang., Munich, Germany, pp. 1-12, January 1987.
7. Manna Z., Pnueli A. Temporal Verification of Reactive Systems: Safety. 1995;Springer-Verlag, New York
8. Z. Manna and H.B. Sipma. Alternating the temporal picture for safety. In U. Montanari, J.D. Rolim, and E. Welzl, editors, Proc. 27th Intl. Colloq. Aut. Lang. Prog., vol. 1853, pages 429-450, Geneva, Switzerland, July 2000. Springer-Verlag.
9. G. Rosu and K. Havelund. Synthesizing dynamic programming algorithms from linear temporal logic formulae. 2001. Submitted for publication.
10. Thomas W. Automata on infinite objects. van Leeuwen J. Handbook of Theoretical Computer Science. vol. B:1990;133-191 Elsevier Science Publishers, (North-Holland)
11. M.Y. Vardi. An automata-theoretic approach to linear temporal logic. In F. Moller and G. Birtwistle, editors, Logics for Concurrency. Structure versus Automata, vol. 1043 of LNCS, pages 238-266. Springer-Verlag, 1996.
12. th Intl. Conference on Automated Deduction, vol. 1249 of LNCS. Springer-Verlag, July 1997.