Skip to main content
SpringerLink
Log in
Book cover

International Static Analysis Symposium

SAS 2000: Static Analysis pp 397–412Cite as

Abstract Domains for Sharing Analysis by Optimal Semantics

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1824))

Abstract

We propose a new technique for transforming abstract domains for logic program analysis in the theory of abstract interpretation. The basic idea is to exploit the notion of optimal semantics in order to improve the precision of a given analysis, with respect to a fixed property of interest. We show an application of our technique to the analysis of variable sharing. We propose a new domain for detecting pairs of independent variables which is obtained by transforming the Jacobs and Langen’s domain for sharing analysis. The new domain has the advantage of being strictly more powerful than the original domain in detecting pair-sharing information and, at the same time, smaller in size.

Part of this work was carried out while the author was at the Laboratoire d’Informatique, École Polytechnique, Palaiseau, France.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Armstrong, T., Marriott, K., Schachte, P., Søndergaard, H.: Two classes of Boolean functions for dependency analysis. Science of Computer Programming 31(1), 3–45 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  2. Bagnara, R., Hill, P.M., Zaffanella, E.: Set-sharing is redundant for pair-sharing. Theoretical Computer Science (2000) (to appear)

    Google Scholar 

  3. Cortesi, A., Filé, G., Winsborough, W.: The quotient of an abstract interpretation. Theor. Comput. Sci. 202(1-2), 163–192 (1998)

    Article  MATH  Google Scholar 

  4. Cortesi, A., Filé, G., Giacobazzi, R., Palamidessi, C., Ranzato, F.: Complementation in abstract interpretation. ACM Trans. Program. Lang. Syst. 19(1), 7–47 (1997)

    Article  Google Scholar 

  5. Cortesi, A., Filè, G., Winsborough, W.: Prop revisited: Propositional formula as abstract domain for groundness analysis. In: Proc. Sixth IEEE Symp. on Logic In Computer Science, Los Alamitos, Calif., pp. 322–327. IEEE Computer Society Press, Los Alamitos (1991)

    Google Scholar 

  6. Cortesi, A., Filé, G., Winsborough, W.: Optimal groundness analysis using propositional logic. Logic Program 27(2), 137–167 (1996)

    Article  MATH  Google Scholar 

  7. Cousot, P., Cousot, R.: Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: Conference Record of the 4th ACM Symposium on Principles of Programming Languages (POPL 1977), New York, pp. 238–252. ACM Press, New York (1977)

    Chapter  Google Scholar 

  8. Cousot, P., Cousot, R.: Systematic design of program analysis frameworks. In: Conference Record of the 6th ACM Symposium on Principles of Programming Languages (POPL 1979), New York, pp. 269–282. ACM Press, New York (1979)

    Chapter  Google Scholar 

  9. Falaschi, M., Levi, G., Martelli, M., Palamidessi, C.: Declarative modeling of the operational behavior of logic languages. Theoretical Computer Science 69(3), 289–318 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  10. Giacobazzi, R.: ”Optimal” collecting semantics for analysis in a hierarchy of logic program semantics. In: Puech, C., Reischuk, R. (eds.) STACS 1996. LNCS, vol. 1046, pp. 503–514. Springer, Heidelberg (1996)

    Google Scholar 

  11. Giacobazzi, R., Ranzato, F., Scozzari, F.: Building complete abstract interpretations in a linear logic-based setting. In: Levi, G. (ed.) SAS 1998. LNCS, vol. 1503, pp. 215–229. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  12. Jacobs, D., Langen, A.: Accurate and efficient approximation of variable aliasing in logic programs. In: Lusk, E.L., Overbeek, R.A. (eds.) Proc. of the 1989 North American Conference on Logic Programming (NACLP 1989), Workshops in Computing, Cambridge, Mass., pp. 154–165. MIT Press, Cambridge (1989)

    Google Scholar 

  13. Jacobs, D., Langen, A.: Static analysis of logic programs for independent ANDparallelism. Logic Program 13(2-3), 154–165 (1992)

    Google Scholar 

  14. Jones, N.D., Søndergaard, H.: A semantics-based framework for the abstract interpretation of Prolog. In: Abramsky, S., Hankin, C. (eds.) Abstract Interpretation of Declarative Languages, pp. 123–142. Ellis Horwood Ltd, Chichester (1987)

    Google Scholar 

  15. Lassez, J.-L., Maher, M.J., Marriott, K.: Unification revisited. In: Minker, J. (ed.) Foundations of Deductive Databases and Logic Programming, pp. 587–625. Morgan Kaufmann, Los Altos (1988)

    Google Scholar 

  16. Marriott, K., Søndergaard, H.: Abstract interpretation of logic programs: the denotational approach. In: Bossi, A. (ed.) Proc. GULP 1990, Padova, pp. 399–425 (1990)

    Google Scholar 

  17. Muthukumar, K., Hermenegildo, M.: Compile-time derivation of variable dependency using abstract interpretation. Journal of Logic Programming 13(2-3), 315–347 (1992)

    Article  MATH  Google Scholar 

  18. Palamidessi, C.: Algebraic properties of idempotent substitutions. In: Paterson, M. (ed.) ICALP 1990. LNCS, vol. 443, pp. 386–399. Springer, Heidelberg (1990)

    Chapter  Google Scholar 

  19. Scozzari, F.: Domain theory in abstract interpretation: equations, completeness and logic. PhD thesis, Dipartimento di Matematica, Univ. di Siena (1999), Available at http://www.di.unipi.it/~scozzari/

  20. Scozzari, F.: Logical optimality of groundness analysis. Theoretical Computer Science, (2000) (to appear)

    Google Scholar 

  21. Søndergaard, H.: An application of abstract interpretation of logic programs: occur check reduction. In: Robinet, B., Wilhelm, R. (eds.) ESOP 1986. LNCS, vol. 213, pp. 327–338. Springer, Heidelberg (1986)

    Google Scholar 

  22. Zaffanella, E., Hill, P.M., Bagnara, R.: Decomposing non-redundant sharing by complementation. In: Cortesi, A., Filé, G. (eds.) SAS 1999. LNCS, vol. 1694, pp. 69–84. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, Università di Pisa, Corso Italia 40, 56125, Pisa, Italy

    Francesca Scozzari

Authors
  1. Francesca Scozzari
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of California, Los Angeles, USA

    Jens Palsberg

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Scozzari, F. (2000). Abstract Domains for Sharing Analysis by Optimal Semantics. In: Palsberg, J. (eds) Static Analysis. SAS 2000. Lecture Notes in Computer Science, vol 1824. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45099-3_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45099-3_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67668-3

  • Online ISBN: 978-3-540-45099-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation