Download:
|
by Michael Codish, Peter J. Stuckey
ACM Transactions on Programming Languages and Systems
http://www.cs.mu.oz.au/~pjs/papers/toplas99.ps.gz
Add To MetaCart
Abstract:
We investigate Jacobs and Langen's Sharing domain, introduced for the analysis of variable sharing in logic programs, and show that it is isomorphic to Marriott and Sndergaard's Pos domain, introduced for the analysis of groundness dependencies. Our key idea is to view the sets of variables in a Sharing domain element as the models of a corresponding Boolean function. This leads to a recasting of sharing analysis in terms of the property of \not being aected by the binding of a single variable. " Such an \unaectedness dependency " analysis has close connections with groundness dependency analysis using positive Boolean functions. This new view improves our understanding of sharing analysis, and leads to an elegant expression of its combination with groundness dependency analysis based on the reduced product of Sharing and Pos. It also opens up new avenues for the ecient implementation of sharing analysis, for example using reduced order binary decision diagrams, as well as ecient implementation of the reduced product, using domain factorizations.
Citations
|
723
|
Symbolic Boolean manipulation with ordered binary-decision diagrams
– Bryant
- 1992
|
|
436
|
Systematic Design of Program Analysis Frameworks
– Cousot, Cousot
- 1979
|
|
246
|
Abstract interpretation and application to logic programs
– Cousot, Cousot
- 1992
|
|
154
|
Abstract interpretation: A uni lattice model for static analysis of programs by construction or approximation of
– Cousot, Cousot
- 1977
|
|
88
|
Static analysis of logic programs for independent AND-parallelism
– Jacobs, Langen
- 1992
|
|
67
|
Bottom-up abstract interpretation of logic programs
– Marriott, Sondergaard
- 1988
|
|
63
|
Prop revisited: Propositional Formula as Abstract Domain for Groundness Analysis
– Cortesi, Filè, et al.
- 1991
|
|
58
|
Two classes of Boolean functions for dependency analysis
– Armstrong, Marriott, et al.
|
|
41
|
Improving abstract interpretations by combining domains
– Codish, Mulkers, et al.
- 1993
|
|
39
|
An application of abstract interpretation of logic programs: occur check reduction
– Sndergaard
- 1986
|
|
36
|
Set-sharing is redundant for pair-sharing
– Bagnara, Hill, et al.
- 1997
|
|
35
|
Complementation in abstract interpretation
– Cortesi, Fil'e, et al.
- 1997
|
|
35
|
Optimal Groundness Analysis Using Propositional Logic
– Cortesi, File, et al.
- 1996
|
|
30
|
Factorizing equivalent variable pairs in ROBDDbased implementations of Pos
– Bagnara, Schachte
- 1999
|
|
27
|
Comparison of abstract interpretations
– Cortesi, File, et al.
- 1992
|
|
26
|
Notes for a tutorial on abstract interpretation of logic programs
– Marriott, Sndergaard
- 1989
|
|
17
|
Precise and ecient groundness analysis for logic programs
– Marriott, Sndergaard
- 1993
|
|
16
|
Sharing is optimal
– Cortesi, Filé
- 1999
|
|
15
|
Abstrakte Interpretation logischer Programme: Theorie, Implementierung, Generierung
– Fecht
- 1997
|
|
13
|
Charlier. Evaluation of the domain Prop
– Hentenryck, Cortesi, et al.
- 1995
|
|
11
|
Accurate and ecient approximation of variable aliasing in logic programs
– Jacobs, Langen
- 1989
|
|
11
|
Advanced Techniques for Approximating Variable Aliasing in Logic Programs
– Langen
- 1990
|
|
5
|
The Boolean logic of set sharing analysis
– Codish, Sndergaard
- 1998
|
|
5
|
Precise and Ecient Static Analysis of Logic Programs
– Schachte
- 1999
|
|
1
|
Operationskreis des Logikkalkuls
– oder, E
|
|
1
|
Sharing is optimal. Technical note to appear
– Cortesi, Fil'e
|
