Skip to main content
SpringerLink
Log in

Abstract interpretation of algebraic polynomial systems (Extended abstract)

  • Conference paper
  • First Online:
Algebraic Methodology and Software Technology (AMAST 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1349))

Abstract

We define a hierarchy of compositional formal semantics of algebraic polynomial systems over F-algebras by abstract interpretation. This generalizes classical formal language theoretical results and contextfree grammar flow-analysis algorithms in the same uniform framework of universal algebra and abstract interpretation.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  • A.V. Aho, R. Sethi & J.D. Ullman. Compilers. Principles, Technique and Tools. Addison-Wesley, 1986.

    Google Scholar 

  • B. Courcelle. The monadic second-order logic of graphs X: Linear orders. TCS, 160:87–143, 1996.

    Google Scholar 

  • P. Cousot & R. Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. 4 th ACM POPL, pp. 238–252, 1977.

    Google Scholar 

  • P. Cousot & R. Cousot. Systematic design of program analysis frameworks. 6th ACM POPL, pp. 269–282, 1979.

    Google Scholar 

  • P. Cousot & R. Cousot. Inductive definitions, semantics and abstract interpretation. 19th ACM POPL, pp. 83–94, 1992.

    Google Scholar 

  • P. Cousot & R. Cousot. Higher-order abstract interpretation (and application to comportment analysis generalizing strictness, termination, projection and PER analysis of functional languages), invited paper. Proc. 1994 ICCL, pp. 95–112, 1994. IEEE Comp. Soc. Press.

    Google Scholar 

  • P. Cousot and R. Cousot. Formal language, grammar and set-constraint-based program analysis by abstract interpretation. Proc. 7 th ACM FPCA, pp. 170–181, 1995.

    Google Scholar 

  • P. Cousot & N. Halbwachs. Automatic discovery of linear restraints among variables of a program. 5 th ACM POPL, pp. 84–97, 1978.

    Google Scholar 

  • J.W. de Bakker, J.-J.Ch. Meyer & J.I. Zucker. On infinite computations in denotational semantics. TCS, 26:53–82, 1983. (Corrigendum: TCS 29:229–230, 1984).

    Google Scholar 

  • S. Ginsburg & G. Rice. Two families of languages related to ALGOL. J. ACM, 9:350–371, 1962.

    Google Scholar 

  • N. Heintze. Set Based Program Analysis. PhD thesis, CMU, Pittsburgh, 1992.

    Google Scholar 

  • J. Jeuring & D. Swierstra. Bottom-up grammar analysis — a functional formulation-. Proc. ESOP '94, LNCS 788, pp. 317–332, 1994. Springer-Verlag.

    Google Scholar 

  • J. Jeuring & D. Swierstra. Constructing functional programs for grammar analysis problems. Proc. 7th ACM FPCA, pp. 259–269, 1995.

    Google Scholar 

  • N.D. Jones and S.S. Muchnick. Flow-analysis and optimization of Lisp-like structures. In S.S. Muchnick & N.D. Jones, editors, Program Flow Analysis: Theory and Applications, pp. 102–131. Prentice-Hall, 1981.

    Google Scholar 

  • K. Meinke & J.V. Tucker. Universal algebra. In S. Abramsky, D.M. Gabbay & T.S.E. Maibaum, editors, Background: Mathematical Structures, vol. 1 of Handbook of Logic in Com. Sci., ch. 3, pp. 189–411. Clarendon Press, 1992.

    Google Scholar 

  • J. Mezei & J. Wright. Algebraic automata and context-free sets. Inf. & Cont., 11:3–29, 1967.

    Google Scholar 

  • U. Möncke & R. Wilhelm. Grammar flow analysis. Proc. Int. Summer School SAGA, LNCS 545, pp. 151–186, 1991. Springer-Verlag.

    Google Scholar 

  • M. Nivat. Mots infinis engendrés par une grammaire algébrique. RAIRO Informatique Théorique, 11:311–327, 1977.

    Google Scholar 

  • M. Nivat. Sur les ensembles de mots infinis engendrés par une grammaire algébrique. RAIRO Informatique Théorique, 12:259–278, 1978.

    Google Scholar 

  • R.J. Parikh. On context-free languages. J. ACM, 13(4):570–581, 1966.

    Google Scholar 

  • M.P. Schützenberger. On a theorem of R. Jungen. Proc. Amer. Math. Soc., 13:885–889, 1962.

    Google Scholar 

  • J.S. Uhl and R.N. Horspool. Flow grammars — a flow analysis methodology. Proc. CC'94, LNCS 786, pp. 203–217, 1994. Springer-Verlag.

    Google Scholar 

  • M. Ward. The closure operators of a lattice. Ann. Math., 43:191–196, 1942.

    Google Scholar 

  • R. Wilhelm & D. Maurer. Compiler Design. Addison-Wesley, 1995.

    Google Scholar 

  • M. Wirsing. Algebraic specification. In J. van Leeuwen, editor, Formal Models and Semantics, vol. B of Handbook of TCS, ch. 13, pp. 675–788. Elsevier, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIENS, école Normale Supérieure, 45 rue d'Ulm, 75230, Paris cedex 05, France

    Patrick Cousot

  2. LIX, CNRS & école Polytechnique, 91140, Palaiseau cedex, France

    Radhia Cousot

Authors
  1. Patrick Cousot
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Radhia Cousot
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Michael Johnson

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cousot, P., Cousot, R. (1997). Abstract interpretation of algebraic polynomial systems (Extended abstract). In: Johnson, M. (eds) Algebraic Methodology and Software Technology. AMAST 1997. Lecture Notes in Computer Science, vol 1349. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0000468

Download citation

  • DOI: https://doi.org/10.1007/BFb0000468

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63888-9

  • Online ISBN: 978-3-540-69661-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation