Büchi complementation and size-change termination

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

Volumn 5505 LNCS, Issue , 2009, Pages 16-30

  Fogarty, Seth ^a   Vardi, Moshe Y ^a  

^a Rice University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ANALYSIS ALGORITHMS; COMPLEMENTATION; COMPLEMENTATION CONSTRUCTIONS; EMPIRICAL ANALYSIS; EMPIRICAL PERFORMANCE; PROBLEM SPACE; PROGRAM VERIFICATION; TERMINATION ANALYSIS;

AUTOMATA THEORY; COMPUTER SOFTWARE; MACHINE TOOLS; ROBOTS; TRANSLATION (LANGUAGES);

ALGORITHMS;

EID: 70350233035     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-00768-2_2     Document Type: Conference Paper

References (17)

1. Daedalus, http://www.di.ens.fr/̃cousot/projects/DAEDALUS/
2. Ben-Amram, A.M., Lee, C.: Program termination analysis in polynomial time. ACM Trans. Program. Lang. Syst 29(1) (2007)
3. Büchi, J.R.: On a decision method in restricted second order arithmetic. In: ICLMPS, pp. 1-12. Stanford University Press (1962)
4. Choueka, Y.: Theories of automata on ω-tapes: A simplified approach. Journal of Computer and Systems Science 8, 117-141 (1974)
5. Doyen, L., Raskin, J.-F.: Improved algorithms for the automata-based approach to modelchecking. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol. 4424, pp. 451-465. Springer, Heidelberg (2007)
6. Emerson, A.E., Sistla, A.P.: Deciding full branching time logics. Information and Control 61(3), 175-201 (1984)
7. Frederiksen, C.C.: A simple implementation of the size-change termination principle. Tech. Rep. D-442, DIKU (2001)
8. Glenstrup, A.J.: Terminator ii: Stopping partial evaluation of fully recursive programs. Master's thesis, DIKU, University of Copenhagen (June 1999)
9. Kupferman, O., Vardi, M.Y.: Weak alternating automata are not that weak. Transactions on Computational Logic, 409-429 (2001)
10. Lee, C., Jones, N.D., Ben-Amram, A.M.: The size-change principle for program termination. In: POPL, pp. 81-92 (2001)
11. Michel, M.: Complementation is more difficult with automata on infinite words. In: CNET, Paris (1988)
12. Sereni, D., Jones, N.D.: Termination analysis of higher-order functional programs. In: Yi, K. (ed.) APLAS 2005. LNCS, vol. 3780, pp. 281-297. Springer, Heidelberg (2005)
13. Safra, S.: On the Complexity of ?-Automat. In: FOCS, pp. 319-327 (1988)
14. Sistla, A.P., Vardi, M.Y., Wolper, P.: The complementation problem for Büchi automata with applications to temporal logic. In: Brauer, W. (ed.) ICALP 1985. LNCS, vol. 194, pp. 217-237. Springer, Heidelberg (1985)
15. Tabakov, D., Vardi, M.Y.: Experimental evaluation of classical automata constructions. In: Sutcliffe, G., Voronkov, A. (eds.) LPAR 2005. LNCS, vol. 3835, pp. 396-411. Springer, Heidelberg (2005)
16. Vardi, M.Y.: Automata-theoretic model checking revisited. In: Cook, B., Podelski, A. (eds.) VMCAI 2007. LNCS, vol. 4349, pp. 137-150. Springer, Heidelberg (2007)
17. Wahlstedt, D.: Detecting termination using size-change in parameter values. Master's thesis, Göteborgs Universitet (2000)