A relational abstraction for functions

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

Volumn 3672 LNCS, Issue , 2005, Pages 186-202

  Jeannet, B ^a   Gopan, D ^b   Reps, T ^b  

^a CAMPUS DE BEAULIEU   (France)

^b University of Wisconsin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACT DOMAINS; ABSTRACT INTERPRETATION; RELATIONAL ABSTRACTION; SHAPE ANALYSIS;

COMPUTATIONAL METHODS; COMPUTER SCIENCE; FUNCTIONS; MATHEMATICAL MODELS; PROBLEM SOLVING; SET THEORY;

ABSTRACTING;

EID: 33646066340     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11547662_14     Document Type: Conference Paper

References (14)

1. D. R. Chase, M. Wegman, and F. K. Zadeck. Analysis of pointers and structures. In Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation. ACM Press, 1990.
2. P. Cousot and R. Cousot. Systematic design of program analysis frameworks. In 6th ACM Symposium on Principles of Programming Languages, POPL'79, San Antonio, January 1979.
3. P. Cousot and R. Cousot. Abstract interpretation and application to logic programs. Journal of Logic Programming, 13(2-3):103-179, 1992.
4. P. Cousot and R. Cousot. Higher-order abstract interpretation (and application to comportment analysis generalizing strictness, termination, projection and PER analysis of functional languages), invited paper. In Proc. of the 1994 Int. Conf. on Computer Languages, Toulouse, France, May 1994. IEEE Computer Society Press.
5. P. Cousot and N. Halbwachs. Automatic discovery of linear restraints among variables of a program. In 5th ACM Symposium on Principles of Programming Languages, POPL'78, Tucson (Arizona), January 1978.
6. R. Giacobazzi and P. Ranzato. The reduced relative power operation on abstract domains. Theoretical Computer Science, 216, 1999.
7. R. Giacobazzi and P. Scozzari. A logical model for relational abstract domains. ACM Trans. Program. Lang. Syst., 20(5), 1998.
8. D. Gopan, P. DiMaio, N.Dor, T. Reps, and M. Sagiv. Numeric domains with summarized dimensions. In Int. Conf. on Tools and Algs. for the Construction and Analysis of Systems (TACAS'04), volume 2988 of LNCS, 2004.
9. D. Gopan, T. Reps, and M. Sagiv. A framework for numeric analysis of array operations. In 32th ACM Symposium on Principles of Programming Languages, (POPL'05). ACM press, January 2005.
10. N. Jones and S. Muchnick. Complexity of flow analysis, inducive assertion synthesis, and a language due to Dijkstra. In N. Jones and S. Muchnick, editors, Program Flow Analysis: Theory and Applications. Prentice-Hall, 1981.
11. A. Miné. The octagon abstract domain. In AST'01 in Working Conference on Reverse Engineering 2001. IEEE CS Press, October 2001.
12. P. Nielson. Tensor products generalize the relational data flow analysis method. In Fourth Hungarian Computer Science Conference, 1985.
13. M. Sagiv, T. Reps, and R. Wilhelm. Solving shape-analysis problems in languages with destructive updating. In Symposium on Principles of Programming Languages (POPL'96), pages 16-31, New York, NY, January 1996. ACM Press.
14. M. Sagiv, T. Reps, and R. Wilhelm. Parametric shape analysis via 3-valued logic. ACM Transactions on Programming Languages and Systems, 24(3), 2002.