Skip to main content
SpringerLink
Log in

Abstracting an Operational Semantics to Finite Automata

  • Conference paper
  • First Online:
Information and Communication Technologies in Education, Research, and Industrial Applications (ICTERI 2015)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 594))

Included in the following conference series:

  • 363 Accesses

Abstract

There is an apparent similarity between the descriptions of small-step operational semantics of imperative programs and the semantics of finite automata, so defining an abstraction mapping from semantics to automata and proving a simulation property seems to be easy. This paper aims at identifying the reasons why simple proofs break, among them artifacts in the semantics that lead to stuttering steps in the simulation. We then present a semantics based on the zipper data structure, with a direct interpretation of evaluation as navigation in the syntax tree. The abstraction function is then defined by an equivalence class construction.

N. Baklanova and M. Strecker were partially supported by the project Verisync (ANR-10-BLAN-0310).

W. Ricciotti and J.-G. Smaus are supported by the project Ajitprop (121-AO12-1209) of the Fondation Airbus.

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

References

  1. Alur, R., Courcoubetis, C., Dill, D.L.: Model-checking for real-time systems. In: LICS, pp. 414–425. IEEE Computer Society (1990)

    Google Scholar 

  2. Alur, R., Dill, D.L.: A theory of timed automata. Theor. Comput. Sci. 126, 183–235 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  3. Appel, A.W., Blazy, S.: Separation logic for small-step cminor. In: Schneider, K., Brandt, J. (eds.) TPHOLs 2007. LNCS, vol. 4732, pp. 5–21. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  4. Baier, C., Katoen, J.-P.: Principles of Model Checking. MIT Press, Cambridge (2008)

    MATH  Google Scholar 

  5. Baklanova, N.: Semantics and Proof Methods for a Real-Time Modeling Language. PhD thesis, Université de Toulouse (2014)

    Google Scholar 

  6. Baklanova, N., Ricciotti, W., Smaus, J.-G., Strecker, M.: Abstracting an operational semantics to finite automata (formalization) (2014). https://bitbucket.org/Martin_Strecker/abstracting_op_sem_to_automata

  7. Baklanova, N., Ricciotti, W., Smaus, J.-G., Strecker, M.: Abstracting an operational semantics to finite automata. In: Proceedings of the 11th International Conference on ICT in Education, Research and Industrial Applications: Integration, Harmonization and Knowledge Transfer, Lviv, Ukraine, 14–16 May 2015, pp. 354–365 (2015)

    Google Scholar 

  8. Baklanova, N., Strecker, M.: Abstraction and verification of properties of a real-time java. In: Ermolayev, V., Mayr, H.C., Nikitchenko, M., Spivakovsky, A., Zholtkevych, G. (eds.) ICTERI 2012. CCIS, vol. 347, pp. 1–18. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  9. Bengtsson, J.E., Yi, W.: Timed automata: semantics, algorithms and tools. In: Desel, J., Reisig, W., Rozenberg, G. (eds.) Lectures on Concurrency and Petri Nets. LNCS, vol. 3098, pp. 87–124. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  10. Huet, G.: Functional pearl: the zipper. J. Funct. Program. 7(5), 549–554 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  11. Khoussainov, B., Nerode, A.: Automata Theory and Its Applications. Birkhauser, Boston (2001)

    Book  MATH  Google Scholar 

  12. Klein, G., Nipkow, T.: A machine-checked model for a Java-like language, virtual machine, and compiler. ACM Trans. Program. Lang. Syst. 28, 619–695 (2006)

    Article  Google Scholar 

  13. Krebbers, R., Wiedijk, F.: Separation logic for non-local control flow and block scope variables. In: Pfenning, F. (ed.) FOSSACS 2013 (ETAPS 2013). LNCS, vol. 7794, pp. 257–272. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  14. Leroy, X.: A formally verified compiler back-end. J. Autom. Reasoning 43(4), 363–446 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  15. Nipkow, T., Paulson, L., Wenzel, M.: Isabelle/HOL: A Proof Assistant for Higher-Order Logic. Lecture Notes in Computer Science, vol. 2283. Springer, Heidelberg (2002)

    Google Scholar 

  16. Winskel, G.: The Formal Semantics of Programming Languages: An Introduction. MIT Press, Cambridge (1993)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IRIT (Institut de Recherche en Informatique de Toulouse), Université de Toulouse, Toulouse, France

    Nadezhda Baklanova, Wilmer Ricciotti, Jan-Georg Smaus & Martin Strecker

Authors
  1. Nadezhda Baklanova
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wilmer Ricciotti
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jan-Georg Smaus
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Martin Strecker
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Wilmer Ricciotti .

Editor information

Editors and Affiliations

  1. Lviv Polytechnic National University, Lviv, Ukraine

    Vitaliy Yakovyna

  2. Institute of Applied Informatics, Alpen-Adria-Universität Klagenfurt, Klagenfurt, Austria

    Heinrich C. Mayr

  3. Taras Shevchenko National Univ. Kyi, Kyiv, Ukraine

    Mykola Nikitchenko

  4. V.N. Karazin Kharkiv National University, Kharkiv, Ukraine

    Grygoriy Zholtkevych

  5. Kherson State University, Kherson, Ukraine

    Aleksander Spivakovsky

  6. University of Huddersfield, Huddersfiled, United Kingdom

    Sotiris Batsakis

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Baklanova, N., Ricciotti, W., Smaus, JG., Strecker, M. (2016). Abstracting an Operational Semantics to Finite Automata. In: Yakovyna, V., Mayr, H., Nikitchenko, M., Zholtkevych, G., Spivakovsky, A., Batsakis, S. (eds) Information and Communication Technologies in Education, Research, and Industrial Applications. ICTERI 2015. Communications in Computer and Information Science, vol 594. Springer, Cham. https://doi.org/10.1007/978-3-319-30246-1_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-30246-1_7

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-30245-4

  • Online ISBN: 978-3-319-30246-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation