Program Analysis: The Abstract Interpretation Perspective

ACM Computing Surveys

Volumn 28, Issue 4, 1996, Pages 1-5

  Cousot, Patrick ^a  

^a ECOLE NORMALE SUPÉRIEURE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0042402467     PISSN: 03600300     EISSN: 15577341     Source Type: Journal    
DOI: 10.1145/242224.242433     Document Type: Article

References (19)

1. Cousot, P. and Cousot, R. 1992a. Abstract interpretation and application to logic programs. Journal of Logic Programming 13, 2-3, 103-179.
2. Cousot, P. and Cousot, R. 1992b. Inductive definitions, semantics and abstract interpretation. In Conf. Rec. Ninthteenth ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages (Albuquerque, New Mexico, 1992), pp. 83-94. ACM Press.
3. Cousot, P. and Cousot, R. 1993. Galois connection based abstract interpretations for strictness analysis, invited paper. In D. Bjøfner, M. Broy, and I. Pottosin Eds., Proc. Int. Conf. on Formal Methods in Programming and their Applications, Academgorodok, Novosibirsk, Russia, Lecture Notes in Computer Science 735, pp. 98-127. Springer-Verlag.
4. Cousot, P. and Cousot, R. 1994. Higher-order abstract interpretation (and application to comportment analysis generalizing strictness, termination, projection and PER analysis of functional languages), invited paper. In Proc. 1994 Int. Conf. on Computer Languages, Toulouse, France (16-19 May 1994), pp. 95-112. IEEE Computer Society Press.
5. Cousot, P. and Cousot, R. 1995a. Compositional and inductive semantic definitions in fixpoint, equational, constraint, closure-condition, rule-based and game-theoretic form, invited paper. In P. WOLPER Ed., Proc. Seventh Int. Conf. on Computer Aided Verification, CAV ’95, Liège, Belgium, Lecture Notes in Computer Science 939 (3-5 July 1995), pp. 293-308. Springer-Verlag.
6. Cousot, P. and Cousot, R. 1995b. Formal language, grammar and set-constraint-based program analysis by abstract interpretation. In Proc. Seventh ACM Conf. on Functional Programming Languages and Computer Architecture (La Jolla, Ca., 25-28 June 1995), pp. 170-181. ACM Press.
7. Cousot, P. and Halbwachs, N. 1978. Automatic discovery of linear restraints among variables of a program. In Conf. Rec. Fifth ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages (Tucson, Arizona, 1978), pp. 84-97. ACM Press.
8. Cridlig, R. 1995. Semantic analysis of shared-memory concurrent languages using abstract model-checking. In Proc. ACM Symp. on Partial Evaluation and Semantics-Based Program Manipulation, PEPM ’95, La Jolla, Ca., 21-23 June 1995 (June 1995). ACM Press.
9. Debray, S. 1994. Formal bases for dataflow analysis of logic programs. In G. Levi Ed., Advances in Logic Programming Theory, International Schools for Computer Scientists, Section 3, pp. 115-182. Clarendon Press, Oxford, UK.
10. Deutsch, A. 1992. A storeless model of aliasing and its abstraction using finite representations of right-regular equivalence relations. In Proc. 1992 Int. Conf. on Computer Languages, Oakland, California (20-23 April 1992), pp. 2-13. IEEE Computer Society Press.
11. Granger, P. 1991. Static analysis of linear congruence equalities among variables of a program. In S. Abramsky and T. Maibaum Eds., Proc. of the Int. Joint Conf. on Theory and Practice of Software Development, TAPSOFT ’91, Brighton, U. K., Volume 1 (CAAP ’91), Lecture Notes in Computer Science 493, pp. 169-192. Springer-Verlag.
12. Halbwachs, N. 1994. About synchronous programming and abstract interpretation. In B. Le Charlier Ed., Proc. of the Static Analysis Symp., SAS ’94, Namur Belgium, 20-22 Sept. 1994, Lecture Notes in Computer Science 864, pp. 179-192. Springer-Verlag.
13. Halbwachs, N., Proy, J.-É., and Raymond, P. 1994. Verification of linear hybrid systems by means of convex approximations. In B. Le CHARLIER Ed., Proc. of the Static Analysis Symp., SAS ’94, Namur Belgium, 20-22 Sept. 1994, Lecture Notes in Computer Science 864, pp. 223-237. Springer-Verlag.
14. Jones, N. and Nielson, F. 1995. Abstract interpretation: a semantic-based tool for program analysis. In S. Abramsky, G. D. M., and M. T. S. E. Eds., Semantic modelling, Number 4 in Handbook of Logic in Comp. Sci. Clarendon Press.
15. Masdupuy, F. 1992. Array operations abstraction using semantic analysis of trapezoid congruences. In Proc. ACM Int. Conf. on Supercomputing, ICS’92 (Washington D. C., July 1992), pp. 226-235.
16. Mauborgne, L. 1994. Abstract interpretation using TDGs. In B. Le Charlier Ed., Proc. of the Static Analysis Symp., SAS ’94, Namur Belgium, 20-22 Sept. 1994, Lecture Notes in Computer Science 864, pp. 363-379. Springer-Verlag.
17. Monsuez, B. 1995. System F and abstract interpretation. In A. MYCROFT Ed., Proc. of the Static Analysis Symp., SAS ’95, Glasgow, UK, 25-27 Sept. 1995, Lecture Notes in Computer Science 983, pp. 279-295. Springer-Verlag.
18. Mycroft, A. 1981. Abstract interpretation and optimising transformations for applicative programs. Ph. D. thesis, Department of Computer Science, University of Edinburgh, Scotland.
19. Venet, A. 1996. Abstract coĥbred domains: Application to the alias analysis of untyped programs. In R. Cousot and D. Schmidt Eds., Proc. of the Static Analysis Symp., SAS’96, Aachen, Germany, 24-26 Sept. 1996, Lecture Notes in Computer Science 1145, pp. 368-382. Springer-Verlag.