Abstract interpretation of algebraic polynomial systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1349, Issue , 1997, Pages 138-154

  Cousot, Patrick ^a   Cousot, Radhia ^b  

^a ECOLE NORMALE SUPÉRIEURE   (France)

^b CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; CONTEXT FREE GRAMMARS; CONTEXT FREE LANGUAGES; FORMAL METHODS; MODEL CHECKING; SEMANTICS;

ABSTRACT INTERPRETATIONS; ALGEBRAIC POLYNOMIALS; FLOW ANALYSIS; FORMAL SEMANTICS; UNIFORM FRAMEWORK; UNIVERSAL ALGEBRA;

ALGEBRA;

EID: 84947944391     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0000468     Document Type: Conference Paper

References (25)

1. A.V. Aho, R. Sethi & J.D. Ullman. Compilers. Principles, Technique and Tools. Addison-Wesley, 1986.
2. B. Courcelle. The monadic second-order logic of graphs X: Linear orders. TCS, 160:87-143, 1996.
3. P. Cousot & R. Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. 4th ACM POPL, pp. 238-252, 1977
4. P. Cousot & R. Cousot. Systematic design of program analysis frameworks. 6th ACM POPL, pp. 269-282, 1979.
5. P. Cousot & R. Cousot. Inductive definitions, semantics and abstract interpretation. 19th ACM POPL, pp. 83-94, 1992.
6. P. Cousot & R. Cousot. Higher-order abstract interpretation (and application to comportment analysis generalizing strictness, termination, projection and PElt analysis of functional languages), invited paper. Proc. 1994 ICCL, pp. 95-112, 1994. IEEE Comp. Soc. Press.
7. P. Cousot and R. Cousot. Formal language, grammar and set-constraint-based program analysis by abstract interpretation. Proc. 7th ACM FPCA, pp. 170-181, 1995.
8. P. Cousot & N. Halbwachs. Automatic discovery of linear restraints among variables of a program. 5th ACM POPL, pp. 84-97, 1978.
9. 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).
10. S. Ginsburg & G. Rice. Two families of languages related to ALGOL. J. ACM, 9:350-371, 1962.
11. N. Heintze. Set Based Program Analysis. PhD thesis, CMU, Pittsburgh, 1992.
12. J. Jeuring & D. Swierstra. Bottom-up grammar analysis - a functional formulation. Proc. ESOP '94, LNCS 788, pp. 317-332, 1994. Springer-Verlag.
13. J. Jeuring & D. Swierstra. Constructing functional programs for grammar analysis problems. Proc. 7th ACM FPCA, pp. 259-269, 1995.
14. 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.
15. 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 Corn. Sci., ch. 3, pp. 189-411. Clarendon Press, 1992.
16. J. Mezei & J. Wright. Algebraic automata and context-free sets. Inf.& Cont., 11:3-29, 1967.
17. U. Möncke & R. Wilhelm. Grammar flow analysis. Proc. Int. Summer School SAGA, LNCS 545, pp. 151-186, 1991. Springer-Verlag.
18. M. Nivat. Mots infinis engendrés par une grammaire algébrique. RAIRO Informatique Thgorique, 11:311-327, 1977.
19. M. Nivat. Sur les ensembles de mots infinis engendrés par une grammaire algébrique. RAIRO Informatique Théorique, 12:259-278, 1978.
20. R.J. Parikh. On context-free languages. J. ACM, 13(4):570-581, 1966.
21. M.P. Schiitzenberger. On a theorem of It. Jungen. Proc. Amer. Math. Soc., 13:885-889, 1962.
22. J.S. Uhl and R.N. Horspool. Flow grammars -- a flow analysis methodology. Proc. CC '94, LNCS 786, pp. 203-217, 1994. Springer-Verlag.
23. M. Ward. The closure operators of a lattice. Ann. Math., 43:191-196, 1942.
24. R. Wilhelm & D. Maurer. Compiler Design. Addison-Wesley, 1995.
25. 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.