Skip to main content
SpringerLink
Log in

Automata and Program Analysis

  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 2017)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10472))

Included in the following conference series:

Abstract

We show how recent results concerning quantitative forms of automata help providing refined understanding of the properties of a system (for instance, a program). In particular, combining the size-change abstraction together with results concerning the asymptotic behavior of tropical automata yields extremely fine complexity analysis of some pieces of code.

This abstract gives an informal, yet precise, explanation of why termination and complexity analysis are related to automata theory.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    Though we take the principle, we do not use the standard notation of max-plus automata, which are traditionally defined as automata weighted over the max-plus semiring.

  2. 2.

    In the standard terminology, non-costly transitions would be given weight 0, while costly ones would be attributed weight 1.

References

  1. Anderson, H., Khoo, S.-C.: Affine-based size-change termination. In: Ohori, A. (ed.) APLAS 2003. LNCS, vol. 2895, pp. 122–140. Springer, Heidelberg (2003). doi:10.1007/978-3-540-40018-9_9

    Chapter  Google Scholar 

  2. Ben-Amram, A.M.: Size-change termination with difference constraints. ACM Trans. Program. Lang. Syst. 30(3), 16 (2008)

    Article  Google Scholar 

  3. Ben-Amram, A.M.: Monotonicity constraints for termination in the integer domain. Logical Methods Comput. Sci. 7(3), 1–43 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  4. Bozzelli, L., Pinchinat, S.: Verification of gap-order constraint abstractions of counter systems. In: Kuncak, V., Rybalchenko, A. (eds.) VMCAI 2012. LNCS, vol. 7148, pp. 88–103. Springer, Heidelberg (2012). doi:10.1007/978-3-642-27940-9_7

    Chapter  Google Scholar 

  5. Codish, M., Fuhs, C., Giesl, J., Schneider-Kamp, P.: Lazy abstraction for size-change termination. In: Fermüller, C.G., Voronkov, A. (eds.) LPAR 2010. LNCS, vol. 6397, pp. 217–232. Springer, Heidelberg (2010). doi:10.1007/978-3-642-16242-8_16

    Chapter  Google Scholar 

  6. Codish, M., Gonopolskiy, I., Ben-Amram, A.M., Fuhs, C., Giesl, J.: Sat-based termination analysis using monotonicity constraints over the integers. TPLP 11(4–5), 503–520 (2011)

    MathSciNet  MATH  Google Scholar 

  7. Colcombet, T., Daviaud, L., Zuleger, F.: Size-change abstraction and max-plus automata. In: Csuhaj-Varjú, E., Dietzfelbinger, M., Ésik, Z. (eds.) MFCS 2014. LNCS, vol. 8634, pp. 208–219. Springer, Heidelberg (2014). doi:10.1007/978-3-662-44522-8_18

    Google Scholar 

  8. Krauss, A.: Certified size-change termination. In: Pfenning, F. (ed.) CADE 2007. LNCS (LNAI), vol. 4603, pp. 460–475. Springer, Heidelberg (2007). doi:10.1007/978-3-540-73595-3_34

    Chapter  Google Scholar 

  9. Lee, C.S.: Ranking functions for size-change termination. ACM Trans. Program. Lang. Syst. 31(3), 10:1–10:42 (2009)

    Article  Google Scholar 

  10. Lee, C.S., Jones, N.D., Ben-Amram, A.M.: The size-change principle for program termination. In: POPL, pp. 81–92 (2001)

    Google Scholar 

  11. Manolios, P., Vroon, D.: Termination analysis with calling context graphs. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 401–414. Springer, Heidelberg (2006). doi:10.1007/11817963_36

    Chapter  Google Scholar 

  12. Vidal, G.: Quasi-terminating logic programs for ensuring the termination of partial evaluation. In: PEPM, pp. 51–60 (2007)

    Google Scholar 

  13. Zuleger, F.: Asymptotically precise ranking functions for deterministic size-change systems. In: Beklemishev, L.D., Musatov, D.V. (eds.) CSR 2015. LNCS, vol. 9139, pp. 426–442. Springer, Cham (2015). doi:10.1007/978-3-319-20297-6_27

    Google Scholar 

  14. Zuleger, F., Gulwani, S., Sinn, M., Veith, H.: Bound analysis of imperative programs with the size-change abstraction. In: Yahav, E. (ed.) SAS 2011. LNCS, vol. 6887, pp. 280–297. Springer, Heidelberg (2011). doi:10.1007/978-3-642-23702-7_22

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IRIF, Case 7014 Université Paris Diderot, 75205, Paris Cedex 13, France

    Thomas Colcombet

  2. MIMUW, Banacha 2, 02-097, Warszawa, Poland

    Laure Daviaud

  3. Institut für Informationssysteme 184/4, Technische Universität Wien, Favoritenstraße 9–11, 1040, Wien, Austria

    Florian Zuleger

Authors
  1. Thomas Colcombet
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Laure Daviaud
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Florian Zuleger
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Thomas Colcombet .

Editor information

Editors and Affiliations

  1. CNRS, University of Bordeaux, Talence cedex, France

    Ralf Klasing

  2. LaBRI, University of Bordeaux, Talence cedex, France

    Marc Zeitoun

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer-Verlag GmbH Germany

About this paper

Cite this paper

Colcombet, T., Daviaud, L., Zuleger, F. (2017). Automata and Program Analysis. In: Klasing, R., Zeitoun, M. (eds) Fundamentals of Computation Theory. FCT 2017. Lecture Notes in Computer Science(), vol 10472. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-55751-8_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-55751-8_1

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-55750-1

  • Online ISBN: 978-3-662-55751-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation