Parsing as abstract interpretation of grammar semantics

Theoretical Computer Science

Volumn 290, Issue 1, 2003, Pages 531-544

  Cousot, Patrick ^a   Cousot, Radhia ^b  

^a ECOLE NORMALE SUPÉRIEURE   (France)

^b ÉCOLE POLYTECHNIQUE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; ALGORITHMS; CONTEXT FREE GRAMMARS; SEMANTICS;

ABSTRACT INTERPRETATION; GRAMMAR SEMANTICS;

COMPUTER SYSTEMS;

EID: 0037209772     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00034-8     Document Type: Article

References (13)

1. Aczel P. An introduction to inductive definitions. Barwise J. Studies in Logic and the Foundations of Mathematics. Handbook of Mathematical Logic. Vol. 90:1977;739-782 Elsevier, Amsterdam.
2. P. Cousot, Types as abstract interpretations, invited paper, in: Conference Record of the 24th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, ACM Press, New York, 1997, pp. 316-331.
3. Cousot P., Cousot R. Abstract interpretation of algebraic polynomial systems. Johnson M. Proc. 6th Internat. Conf. on Algebraic Methodology and Software Technology, AMAST '97, Sydney, Australia. Lecture Notes in Computer Science. Vol. 1349:1997;138-154 Springer, Berlin.
4. P. Cousot, R. Cousot, 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, ACM Press, New York, 1977, pp. 238-252.
5. Cousot P., Cousot R. Constructive versions of Tarski's fixed point theorems. Pacific J. Math. 82(1):1979;43-57.
6. P. Cousot, R. Cousot, Systematic design of program analysis frameworks, in: Conf. Record of the Sixth Annual ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, ACM Press, New York, 1979, pp. 269-282.
7. Cousot P., Cousot R. Compositional and inductive semantic definitions in fixpoint, equational, constraint, closure-condition, rule-based and game-theoretic form, invited paper. Wolper P. Proc. 7th Internat. Conf. on Computer Aided Verification, CAV '95, Liège, Belgium. Lecture Notes in Computer Science. Vol. 939:1995;293-308 Springer, Berlin.
8. P. Cousot, R. Cousot, Temporal abstract interpretation, in: Conference Record of the 27th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, ACM Press, New York, 2000, pp. 12-25.
9. Earley J. An efficient context-free parsing algorithm. Communications of the Association for Computing Machinary. 13(2):1970;94-102.
10. Knuth D.E. On the translation of languages from left to right. Information and Control. 8:1965;607-639.
11. K. Sikkel, A. Nijholt, Parsing of context-free languages, in: G. Rozenberg, A. Salomaa (Eds.), Handbook of Formal Languages, Vol. 2, Linear Modeling: Background and Application, Springer, Berlin, 1997, pp. 61-100.
12. Sudkamp T.A. Languages and Machines: An Introduction to the Theory of Computer Science. 2nd Edition:November 1996;Addison-Wesley Pub. Co. Reading, MA.
13. Tarski A. A lattice theoretical fixpoint theorem and its applications. Pacific J. Math. 5:1955;285-310.