Advertisement

Pair-Sharing Analysis of Object-Oriented Programs

  • Stefano Secci
  • Fausto Spoto
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3672)

Abstract

Pair-sharing analysis of object-oriented programs determines those pairs of program variables bound at run-time to overlapping data structures. This information is useful for program parallelisation and analysis. We follow a similar construction for logic programming and formalise the property, or abstract domain, Sh of pair-sharing. We prove that Sh induces a Galois insertion w.r.t the concrete domain of program states. We define a compositional abstract semantics for the static analysis over Sh, and prove it correct.

Keywords

Logic Program Logic Programming Method Call Abstract Interpretation Abstract Domain 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bagnara, R., Hill, P.M., Zaffanella, E.: Set-Sharing is Redundant for Pair-Sharing. Theoretical Computer Science 277(1-2), 3–46 (2002)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Bossi, A., Gabbrielli, M., Levi, G., Martelli, M.: The s-Semantics Approach: Theory and Applications. Journal of Logic Programming 19/20, 149–197 (1994)Google Scholar
  3. 3.
    Bryant, R.E.: Graph-Based Algorithms for Boolean Function Manipulation. IEEE Transactions on Computers 35(8), 677–691 (1986)zbMATHCrossRefGoogle Scholar
  4. 4.
    Bueno, F., de la Banda, M.J.G.: Set-sharing is not always redundant for pair-sharing. In: Kameyama, Y., Stuckey, P.J. (eds.) FLOPS 2004. LNCS, vol. 2998, pp. 117–131. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  5. 5.
    Choi, J.D., Burke, M., Carini, P.: Efficient Flow-Sensitive Interprocedural Computation of Pointer-Induced Aliases and Side Effects. In: Proc. of the 20th Symposium on Principles of Programming Languages (POPL), Charleston, South Carolina, pp. 232–245. ACM, New York (1993)CrossRefGoogle Scholar
  6. 6.
    Cortesi, A., Filé, G.: 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), pp. 52–61. Yale University, New Haven, (1991)Google Scholar
  7. 7.
    Cousot, P., Cousot, R.: 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), pp. 238–252 (1977)Google Scholar
  8. 8.
    Cousot, P., Cousot, R.: Abstract Interpretation and Applications to Logic Programs. Journal of Logic Programming 13(2,3), 103–179 (1992)zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Dean, J., Grove, D., Chambers, C.: Optimization of Object-Oriented Programs using Static Class Hierarchy Analysis. In: Olthoff, W.G. (ed.) ECOOP 1995. LNCS, vol. 952, pp. 77–101. Springer, Heidelberg (1995)Google Scholar
  10. 10.
    Jacobs, D., Langen, A.: Static Analysis of Logic Programs for Independent AND Parallelism. Journal of Logic Programming 13(2,3), 291–314 (1992)zbMATHCrossRefGoogle Scholar
  11. 11.
    King, A.: Pair-Sharing over Rational Trees. Journal of Logic Programming 46(1-2), 139–155 (2000)zbMATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Lagoon, V., Stuckey, P.J.: Precise Pair-Sharing Analysis of Logic Programs. In: Proc. of the 4th international ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP), Pittsburgh, PA, USA, pp. 99–108. ACM, New York (2002)CrossRefGoogle Scholar
  13. 13.
    Pollet, I., Le Charlier, B., Cortesi, A.: Distinctness and sharing domains for static analysis of java programs. In: Knudsen, J.L. (ed.) ECOOP 2001. LNCS, vol. 2072, pp. 77–98. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  14. 14.
    Secci, S., Spoto, F.: Pair-Sharing Analysis of Object-Oriented Programs (2005), Available at, http://www.sci.univr.it/~spoto/papers.html
  15. 15.
    Spoto, F.: The julia Static Analyser (2004), http://www.sci.univr.it/~spoto/julia
  16. 16.
    Steensgaard, B.: Points-to Analysis in Almost Linear Time. In: Proc. of the 23th ACM Symposium on Principles of Programming Languages (POPL), St. Petersburg Beach, Florida, USA, January 1996, pp. 32–41 (1996)Google Scholar
  17. 17.
    Tip, F., Palsberg, J.: Scalable Propagation-Based Call Graph Construction Algorithms. In: Proc. of the ACM Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA), SIGPLAN Notices, Minneapolis, Minnesota, USA, vol. 35(10), pp. 281–293. ACM, New York (2000)CrossRefGoogle Scholar
  18. 18.
    Winskel, G.: The Formal Semantics of Programming Languages. The MIT Press, Cambridge (1993)zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Stefano Secci
    • 1
  • Fausto Spoto
    • 1
  1. 1.Dipartimento di InformaticaUniversità di VeronaItaly

Personalised recommendations