Pair-sharing analysis of object-oriented programs

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

Volumn 3672 LNCS, Issue , 2005, Pages 320-335

  Secci, Stefano ^a   Spoto, Fausto ^a  

^a UNIVERSITY OF VERONA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; INFORMATION ANALYSIS; LOGIC PROGRAMMING; SEMANTICS;

OBJECT-ORIENTED PROGRAMS; PAIR-SHARING ANALYSIS; PROGRAM PARALLELISATION;

OBJECT ORIENTED PROGRAMMING;

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

References (18)

1. R. Bagnara, P. M. Hill, and E. Zaffanella. Set-Sharing is Redundant for Pair-Sharing. Theoretical Computer Science, 277(1-2).-3-46, April 2002.
2. A. Bossi, M. Gabbrielli, G. Levi, and M. Martelli. The s-Semantics Approach: Theory and Applications. Journal of Logic Programming, 19/20:149-197, 1994.
3. R. E. Bryant. Graph-Based Algorithms for Boolean Function Manipulation. IEEE Transactions on Computers, 35(8):677-691, 1986.
4. F. Bueno and M. J. García de la Banda. Set-Sharing Is Not Always Redundant for Pair-Sharing. In Y. Kameyama and P. J. Stuckey, editors, Proc. of FLOPS'04, volume 2998 of Lecture Notts in Computer Science, pages 117-131, Narti, Japan, April 2004. Springer-Verlag.
5. J. D. Choi, M. Burke, and P. Carini. Efficient Flow-Sensitive Interprocedural Computation of Pointer-Induced Aliases and Side Effects. In Proc. of the 20th Symposium, on Principles of Programming Languages (POPL), pages 232-245, Charleston, South Carolina, January 1993. ACM.
6. A. Cortesi and G. Filé. Abstract Interpretation of Logic Programs: An Abstract Domain for Groundness, Sharing, Freeness and Compoundness Analysis. In Proc. of Partial Evaluation and Semantics-Based Program. Manipulation (PEPM), pages 52-61, Yale University, New Haven, Connecticut, USA, June 1991.
7. P. Cousot and R. Cousot. Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. In Proc. of the 4th ACM Symposium on Principles of Programming Languages (POPL), pages 238-252, 1977.
8. P. Cousot and R. Cousot. Abstract Interpretation and Applications to Logic Programs. Journal of Logic Programming, 13(2 & 3): 103-179, 1992.
9. J. Dean, D. Grove, and C. Chambers. Optimization of Object-Oriented Programs using Static Class Hierarchy Analysis. In W. G. Olthoff, editor, Proc. of the European Conference on Object-Oriented Programming (ECOOP), volume 952 of LNCS, pages 77-101, Århus, Denmark, August 1995. Springer.
10. D. Jacobs and A. Langen. Static Analysis of Logic Programs for Independent AND Parallelism. Journal of Logic Programming, 13(2 & 3):291-314, 1992.
11. A. King. Pair-Sharing over Rational Trees. Journal of Logic Programming, 46(1-2): 139-155, December 2000.
12. V. Lagoon and P. J. Stuckey. Precise Pair-Sharing Analysis of Logic Programs. In Proc. of the 4th international ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP), pages 99-108, Pittsburgh, PA, USA, October 2002. ACM.
13. I. Pollet, B. Le Charlier, and A. Cortesi. Distinctness and Sharing Domains for Static Analysis of Java Programs. In Proc. of the 25th European Conference on Object-Oriented Programming (ECOOP), volume 2072 of Lecture Notes in Computer Science, pages 77-98, Budapest, Hungary, June 2001.
14. S. Secci and F. Spoto. Pair-Sharing Analysis of Object-Oriented Programs. Available at www.sci.univr.it/~spoto/papers.html, 2005.
15. F. Spoto. The JULIA Static Analyser, www.sci.univr.it/~spoto/julia, 2004.
16. B. Steensgaard. Points-to Analysis in Almost Linear Time. In Proc. of the 23th ACM Symposium on Principles of Programming Languages (POPL), pages 32-41, St. Petersburg Beach, Florida, USA, January 1996.
17. F. Tip and J. Palsberg, Scalable Propagation-Based Call Graph Construction Algorithms. In Proc. of the ACM Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA), volume 35(10) of SIGPLAN Notices, pages 281-293, Minneapolis, Minnesota, USA, October 2000. ACM.
18. G. Winskel. The Formal Semantics of Programming Languages. The MIT Press, 1993.