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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
Bagnara, R., Hill, P.M., Zaffanella, E.: Set-sharing is redundant for pair-sharing. Theoretical Computer Science (2000) (to appear)
Cortesi, A., Filé, G., Winsborough, W.: The quotient of an abstract interpretation. Theor. Comput. Sci. 202(1-2), 163–192 (1998)
Cortesi, A., Filé, G., Giacobazzi, R., Palamidessi, C., Ranzato, F.: Complementation in abstract interpretation. ACM Trans. Program. Lang. Syst. 19(1), 7–47 (1997)
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)
Cortesi, A., Filé, G., Winsborough, W.: Optimal groundness analysis using propositional logic. Logic Program 27(2), 137–167 (1996)
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)
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)
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)
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)
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)
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)
Jacobs, D., Langen, A.: Static analysis of logic programs for independent ANDparallelism. Logic Program 13(2-3), 154–165 (1992)
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)
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)
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)
Muthukumar, K., Hermenegildo, M.: Compile-time derivation of variable dependency using abstract interpretation. Journal of Logic Programming 13(2-3), 315–347 (1992)
Palamidessi, C.: Algebraic properties of idempotent substitutions. In: Paterson, M. (ed.) ICALP 1990. LNCS, vol. 443, pp. 386–399. Springer, Heidelberg (1990)
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/
Scozzari, F.: Logical optimality of groundness analysis. Theoretical Computer Science, (2000) (to appear)
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)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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