The powerset operator on abstract interpretations

Theoretical Computer Science

Volumn 222, Issue 1-2, 1999, Pages 77-111

  Filé, Gilberto ^a   Ranzato, Francesco ^a  

^a UNIVERSITY OF PADOVA   (Italy)

Author keywords

Abstract interpretation; Logic program ground dependency analysis; Powerset operator

Indexed keywords

EID: 0008850013     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00007-3     Document Type: Article

References (38)

1. T. Armstrong, K. Marriott, P. Schachte, H. Søndergaard, Two classes of Boolean functions for dependency analysis, Sci. Comput. Program., to appear. A preliminary version appeared in Proc. SAS '94, Lecture Notes in Computer Science, vol. 864, Springer, Berlin, 1994.
2. R. Balbes, P. Dwinger, Distributive Lattices, University of Missouri Press, Columbia, Missouri, 1974.
3. R. Barbuti, R. Giacobazzi, G. Levi, A general framework for semantics-based bottom-up abstract interpretation of logic programs, ACM Trans. Program. Lang. Syst. 15(1) (1993) 133-181.
4. G.L. Burn, C.L. Hankin, S. Abramsky, Strictness analysis for higher-order functions, Sci. Comput. Program. 7 (1986) 249-278.
5. M. Codish, D. Dams, E. Yardeni, Bottom-up abstract interpretation of logic programs, Theoret. Comput. Sci. 124(1) (1994) 93-126.
6. M. Codish, M. Falaschi, K. Marriott, Suspension analyses for concurrent logic programs, ACM Trans. Program. Lang. Syst. 16(3) (1994) 649-686.
7. A. Cortesi, G. Filé, R. Giacobazzi, C. Palamidessi, F. Ranzato, Complementation in abstract interpretation, ACM Trans. Program. Lang. Syst. 19(1) (1997) 7-47.
8. A. Cortesi, G. Filé, W. Winsborough, Prop revisited: propositional formula as abstract domain for groundness analysis, in: Proc. 6th IEEE Symp. on Logic in Computer Science (LICS '91), IEEE Computer Society Press, Los Alamitos, CA, 1991, pp. 322-327.
9. A. Cortesi, G. Filé, W. Winsborough, Comparison of abstract interpretations, in: W. Kuich (Ed), Proc. 19th Internat. Colloq. on Automata, Languages and Programming (ICALP '92), Lecture Notes in Computer Science, vol. 623, Springer, Berlin, 1992, pp. 521-532.
10. A. Cortesi, G. Filé, W. Winsborough, Optimal groundness analysis using propositional logic, J. Logic Program. 27(2) (1996) 137-167.
11. P. Cousot, Abstract interpretation, ACM Comput. Surveys 28(2) (1996) 324-328.
12. P. Cousot, Types as abstract interpretations (Invited Paper), in Conf. Record of the 24th ACM Symp. on Principles of Programming Languages (POPL '97), ACM Press, New York, 1997, pp. 316-331.
13. P. Cousot, R. Cousot, Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints, in: Conf. Record of the 4th ACM Symp. on Principles of Programming Languages (POPL '77), ACM Press, New York, 1977, pp. 238-252.
14. P. Cousot, R. Cousot, Systematic design of program analysis frameworks, in: Conf. Record of the 6th ACM Symp. on Principles of Programming Languages (POPL '79), ACM Press, New York, 1979, pp. 269-282.
15. P. Cousot, R. Cousot, Abstract interpretation and application to logic programs, J. Logic Program. 13(2-3) (1992) 103-179.
16. P. Cousot, R. Cousot, Inductive definitions, semantics and abstract interpretation, in: Conf. Record of the 19th ACM Symp. on Principles of Programming Languages (POPL '92), ACM Press, New York, 1992, pp. 83-94.
17. P. Cousot, R. Cousot, Higher-order abstract interpretation (and application to comportment analysis generalizing strictness, termination, projection and PER analysis of functional languages) (Invited Paper), in: Proc. IEEE Internat. Conf. on Computer Languages (ICCL '94), IEEE Computer Society Press, Los Alamitos, CA, 1994, pp. 95-112.
18. P. Dart, On derived dependencies and connected databases, J. Logic Program. 11(2) (1991) 163-188.
19. B.A. Davey, H.A. Priestley, Introduction to Lattices and Order, Cambridge University Press, Cambridge, UK, 1990.
20. M. Falaschi, G. Levi, M. Martelli, C. Palamidessi, Declarative modeling of the operational behavior of logic languages, Theoret. Comput. Sci. 69(3) (1989) 289-318.
21. G. Filé, R. Giacobazzi, F. Ranzato, A unifying view of abstract domain design, ACM Comput. Surveys 28(2) (1996) 333-336.
22. G. Filé, F. Ranzato, Improving abstract interpretations by systematic lifting to the powerset, in: M. Bruynooghe (Ed.), Proc. Internat. Logic Programming Symp. (ILPS '94), The MIT Press, Cambridge, MA, 1994, 655-669.
23. R. Giacobazzi, F. Ranzato, Complementing logic program semantics, in: M. Hanus, M. Rodríguez-Artalejo (Eds.), Proc. 5th Internat. Conf. on Algebraic and Logic Programming (ALP '96), Lecture Notes in Computer Science, vol. 1139, Springer, Berlin, 1996, pp. 238-253.
24. R. Giacobazzi, F. Ranzato, Optimal domains for disjunctive abstract interpretation, Sci. Comput. Program., 1998, to appear.
25. G. Gierz, K.H. Hofmann, K. Keimel, J.D. Lawson, M. Mislove, D.S. Scott, A Compendium of Continuous Lattices, Springer, Berlin, 1980.
26. C.A. Gunter, D.S. Scott, Semantic domains, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, vol. B: Formal Models and Semantics, Elsevier, Amsterdam, and The MIT Press, Cambridge, MA, 1990, pp. 633-674.
27. M. Hermenegildo, D.S. Warren, S.K. Debray, Global flow analysis as a practical compilation tool, J. Logic Program. 13(4) (1992) 349-366.
28. D. Jacobs, A. Langen, Static analysis of logic programs for independent AND-parallelism, J. Logic Program. 13(2-3) (1992) 154-165.
29. T.P. Jensen, Disjunctive strictness analysis, in: Proc. 7th IEEE Symp. on Logic in Computer Science (LICS '92), IEEE Computer Society Press, Los Alamitos, CA, 1992, pp. 174-185.
30. J.L. Lassez, M.J. Maher, K. Marriott, Unification revisited, in: J. Minker (Ed.), Foundations of Deductive Databases and Logic Programming, Morgan Kaufmann, Los Altos, CA, 1988, pp. 587-625.
31. K. Marriott, H. Søndergaard, Precise and efficient groundness analysis for logic programs, ACM Lett. Program. Lang. Syst. 2(1-4) (1993) 181-196.
32. K. Marriott, H. Søndergaard, N.D. Jones, Denotational abstract interpretation of logic programs, ACM Trans. Program. Lang. Syst. 16(3) (1994) 607-648.
33. A. Mycroft, The theory and practice of transforming call-by-need into call-by-value, in: B. Robinet (Ed.), Proc. 4th Internat. Symp. on Programming, Lecture Notes in Computer Science, vol. 83, Springer, Berlin, 1980, pp. 270-281.
34. A. Mycroft, Completeness and predicate-based abstract interpretation, in: Proc. ACM Symp. on Partial Evaluation and Program Manipulation (PEPM '93), ACM Press, New York, 1993, pp. 179-185.
35. F. Nielson, Tensor products generalize the relational data flow analysis method, in: M. Arató, I. Kátai, L. Varga, (Eds.), Proc. 4th Hungarian Computer Science Conf., 1985, pp. 211-225.
36. H.R. Nielson, F. Nielson, Bounded fixed point iteration, in: Conf. Record of the 19th ACM Symp. on Principles of Programming Languages (POPL '92), ACM Press, New York, 1992, pp. 71-82.
37. P. Van Roy, A.M. Despain, The benefits of global dataflow analysis for an optimizing Prolog compiler, in: S.K. Debray, M. Hermenegildo (Eds.), Proc. North American Conf. on Logic Programming (NACLP '90), The MIT Press, Cambridge, MA, 1990, pp. 501-515.
38. I. Wegener, The Complexity of Boolean Functions, Wiley-Teubner Series in Computer Science, Wiley, New York, 1987.