Compositional and inductive semantic definitions in fixpoint, equational, constraint, closure-condition, rule-based and game-theoretic form

Invited paper
  • Patrick Cousot
  • Radhia Cousot
Session 9: Invited Talk
Part of the Lecture Notes in Computer Science book series (LNCS, volume 939)


We present a language and semantics-independent, compositional and inductive method for specifying formal semantics or semantic properties of programs in equivalent fixpoint, equational, constraint, closure-condition, rule-based and game-theoretic form. The definitional method is obtained by extending set-theoretic definitions in the context of partial orders. It is parameterized by the language syntax, by the semantic domains and by the semantic transformers corresponding to atomic and compound program components. The definitional method is shown to be preserved by abstract interpretation in either fixpoint, equational, constraint, closure-condition, rule-based or game-theoretic form. The features common to all possible instantiations are factored out thus allowing for results of general scope such as well-definedness, semantic equivalence, soundness and relative completeness of abstract interpretations, etc. to be proved compositionally in a general language and semantics-independent framework.


  1. [1]
    S. Abramsky, R. Jagadeesan, & P. Malacaria. Full abstraction for PCF (extended abstract). Proc. TACS'94, LNCS 789, 1–15, 1994.Google Scholar
  2. [2]
    P. Aczel. An introduction to inductive definitions. In J. Barwise, ed., Handbook of Mathematical Logic, vol. 90, 739–782. Elsevier, 1977.Google Scholar
  3. [3]
    J. Berstel & L. Boasson. Context-free languages. In [18], ch. 2, 61–102.Google Scholar
  4. [4]
    P. Cousot. Methods and logics for proving programs. In [18], ch. 15, 843–993.Google Scholar
  5. [5]
    P. Cousot et R. Cousot. Static determination of dynamic properties of recursive procedures. In E. Neuhold, ed., IFIP Conference on Formal Description of Programming Concepts, St-Andrews, N.B., Canada, 237–277. North-Holland Pub. Co., 1977.Google Scholar
  6. [6]
    P. Cousot & R. Cousot. Systematic design of program analysis frameworks. In 6 th ACM POPL, 269–282, 1979.Google Scholar
  7. [7]
    P. Cousot & R. Cousot. A language independent proof of the soundness and completeness of generalized Hoare logic. Inf. & Comp., 80(2):165–191, 1989.Google Scholar
  8. [8]
    P. Cousot & R. Cousot. Inductive definitions, semantics and abstract interpretation. In 196 th ACM POPL, 83–94, 1992.Google Scholar
  9. [9]
    P. Cousot & R. Cousot. Higher-order abstract interpretation (and application to comportment analysis generalizing strictness, termination, projection and PER analysis of functional languages). In Proc. IEEE 1994 ICCL, 95–112, 1994.Google Scholar
  10. [10]
    L. Damas & R. Milner. Principle type schemes for functional programs. In 96 th ACM POPL, 207–212, 1982.Google Scholar
  11. [11]
    N. Heintze. Set-based analysis of ML programs (extended abstract). In Proc. ACM Conf. Lisp & Func. Prog., 1994.Google Scholar
  12. [12]
    C. A. R. Hoare. An axiomatic basis for computer programming. Comm. ACM, 12(10):576–580, 583, 1969.CrossRefGoogle Scholar
  13. [13]
    R. Milner. A complete axiomatization for observational congruence of finite state behaviors. Inf. & Comp., 81:227–247, 1989.Google Scholar
  14. [14]
    P. D. Mosses. Denotational semantics. In [18], ch. 11, 575–631.Google Scholar
  15. [15]
    J. Palsberg & P. O'Keefe. A type system equivalent to flow analysis. In 226 th ACM POPL, 367–378, 1995.Google Scholar
  16. [16]
    J. Palsberg & M. I. Schwartzbach. Binding-time analysis: Abstract interpretation versus type inference. In Proc. IEEE 1994 ICCL, 289–298, 1994.Google Scholar
  17. [17]
    G. D. Plotkin. A structural approach to operational semantics. Tech. Rep. DAIMI FN-19, Aarhus University, (DK), Sept. 1981.Google Scholar
  18. [18]
    J. van Leeuwen, ed. Formal Models and Semantics, vol. B of Handbook of Theoretical Computer Science. Elsevier, 1990.Google Scholar
  19. [19]
    M. Wirsing. Algebraic specifications. In [18], ch. 13, 675–788.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Patrick Cousot
    • 1
  • Radhia Cousot
    • 2
  1. 1.École Normale SupérieureLIENSParis cedex 05France
  2. 2.LIX, CNRS & École PolytechniquePalaiseau CedexFrance

Personalised recommendations