Skip to main content

Abstract Interpretation of Non-monotone Bi-inductive Semantic Definitions

  • Conference paper
Verification, Model Checking, and Abstract Interpretation (VMCAI 2008)

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

Abstract

Divergence/nonterminating behaviors definitely need to be considered in static program analysis [13], in particular for typing [2,11].

Divergence information is part of the classical order-theoretic fixpoint denotational semantics [12] but not explicit in small-step/abstract-machine-based operational semantics [14,15,16] and absent of big-step/natural operational semantics [8]. A standard approach is therefore to generate an execution trace semantics from a (labelled) transition system/small-step operational semantics, using either an order-theoretic [3] or metric [19] fixpoint definition or else a categorical definition as a final coalgebra for a behavior functor (modeling the transition relation) up to a weak bisimulation [7,10,18] or using an equational definition for recursion in an order-enriched category [9].

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

Access this chapter

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 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. Cousot, P.: Méthodes itératives de construction et d’approximation de points fixes d’opérateurs monotones sur un treillis, analyse sémantique de programmes (in French). In: Thèse d’État ès sciences mathématiques, Université scientifique et médicale de Grenoble, Grenoble, France (March 21, 1978)

    Google Scholar 

  2. Cousot, P.: Types as abstract interpretations, invited paper. In: Conference Record of the Twentyfourth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, January 1997, pp. 316–331. ACM Press, New York (1997)

    Google Scholar 

  3. Cousot, P.: Constructive design of a hierarchy of semantics of a transition system by abstract interpretation. Theoretical Computer Science 277(1–2), 47–103 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  4. Cousot, P., Cousot, R.: Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: Conference Record of the Fourth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Los Angeles, California, pp. 238–252. ACM Press, New York (1977)

    Google Scholar 

  5. Cousot, P., Cousot, R.: Systematic design of program analysis frameworks. In: Conference Record of the Sixth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 269–282. ACM Press, New York (1979)

    Google Scholar 

  6. Cousot, P., Cousot, R.: Inductive definitions, semantics and abstract interpretation. In: Conference Record of the Nineteenth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 83–94. ACM Press, New York (1992)

    Google Scholar 

  7. Jacobs, B., Rutten, J.: A tutorial on (co)algebras and (co)induction. EATCS Bulletin 62, 222–269 (1997)

    MATH  Google Scholar 

  8. Kahn, G.: Natural semantics. In: Fuchi, K., Nivat, M. (eds.) Programming of Future Generation Computers, pp. 237–258. Elsevier Science Publishers, B.V., Amsterdam, The Netherlands (1988)

    Google Scholar 

  9. Klin, B.: Adding recursive constructs to bialgebraic semantics. Journal of Logic and Algebraic Programming 60-61, 259–286 (2004)

    Google Scholar 

  10. Klin, B.: Bialgebraic methods in structural operational semantics. Electronic Notes in Theoretical Computer Science 175(1), 33–43 (2007)

    Article  Google Scholar 

  11. Leroy, X.: Coinductive big-step operational semantics. In: Sestoft, P. (ed.) ESOP 2006 and ETAPS 2006. LNCS, vol. 3924, pp. 54–68. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  12. Mosses, P.D.: Denotational semantics. In: van Leeuwen, J. (ed.) Formal Models and Semantics, volume B of Handbook of Theoretical Computer Science, vol. 11, pp. 575–631. Elsevier Science Publishers, B.V., Amsterdam, The Netherlands (1990)

    Google Scholar 

  13. Mycroft, A.: The theory and practice of transforming call-by-need into call-by-value. In: Robinet, B. (ed.) Programming 1980. LNCS, vol. 83, pp. 270–281. Springer, Heidelberg (1980)

    Google Scholar 

  14. Plotkin, G.D.: A structural approach to operational semantics. Technical Report DAIMI FN-19, Aarhus University, Denmark (September 1981)

    Google Scholar 

  15. Plotkin, G.D.: The origins of structural operational semantics. Journal of Logic and Algebraic Programming 60–61, 3–15 (2004)

    Google Scholar 

  16. Plotkin, G.D.: A structural approach to operational semantics. Journal of Logic and Algebraic Programming 60–61, 17–139 (2004)

    Google Scholar 

  17. Steckler, P., Wand, M.: Selective thunkification. In: LeCharlier, B. (ed.) SAS 1994. LNCS, vol. 864, pp. 162–178. Springer, Heidelberg (1994)

    Google Scholar 

  18. Turi, D., Plotkin, G.D.: Towards a mathematical operational semantics. In: Proceedings of the Twelfth LICS 1997, Warsaw, Poland, California, United States, June 29 – July 2, 1997, pp. 280–291. IEEE Computer Society Press, Los Alamitos (1997)

    Google Scholar 

  19. van Breugel, F.: An introduction to metric semantics: operational and denotational models for programming and specification languages. Theoretical Computer Science 258, 1–98 (2001)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Francesco Logozzo Doron A. Peled Lenore D. Zuck

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cousot, R. (2008). Abstract Interpretation of Non-monotone Bi-inductive Semantic Definitions. In: Logozzo, F., Peled, D.A., Zuck, L.D. (eds) Verification, Model Checking, and Abstract Interpretation. VMCAI 2008. Lecture Notes in Computer Science, vol 4905. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78163-9_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-78163-9_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-78162-2

  • Online ISBN: 978-3-540-78163-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics