Two classes of Boolean functions for dependency analysis

Science of Computer Programming

Volumn 31, Issue 1, 1998, Pages 3-45

  Armstrong, Tania ^a   Marriott, Kim ^a   Schachte, Peter ^b   Søndergaard, Harald ^b  

^a MONASH UNIVERSITY   (Australia)

^b UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION THEORY; LOGIC PROGRAMMING;

CONJUNCTIVE NORMAL FORM; DEPENDENCY ANALYSIS; DISJUNCTIVE NORMAL FORM; DUAL BLAKE CANONICAL FORM; REDUCED ORDERED BINARY DECISION DIAGRAMS (ROBDD);

BOOLEAN FUNCTIONS;

EID: 0032065846     PISSN: 01676423     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6423(96)00039-1     Document Type: Article

References (46)

1. T. Armstrong, K. Marriott, P. Schachte, H. Søndergaard, Boolean functions for dependency analysis: algebraic properties and efficient representation, in: B. Le Charlier (Ed.), Static Analysis: Proc. 1st Internat. Symp., Lecture Notes in Computer Science, vol. 864, Springer Verlag, Berlin, 1994, pp. 266-280.
2. W. Armstrong, C. Delobel, Decompositions and functional dependencies in relations, ACM Trans. Database Systems 5 (1980) 404-430.
3. N. Baker, H. Søndergaard, Definiteness analysis for CLP(R), in: G. Gupta, G. Mohay, R. Topor (Eds.), Proc. 16th Australian Computer Science Conf., Brisbane, Qld., January 1993, pp. 321-332.
4. R. Barbuti, R. Giacobazzi, G. Levi, A general framework for semantics-based bottom-up abstract interpretation of logic programs, ACM Trans. Programming Languages Systems 15 (1) (1993) 133-181.
5. P. Bigot, S. Debray, K. Marriott, Understanding finiteness analysis using abstract interpretation, in: K. Apt (Ed.), Logic Programming: Proc. Joint Internat. Conf. Symp., MIT Press, Cambridge, MA, 1992, pp. 735-749.
6. P.A. Bloniarz, H.B. Hunt III, D.J. Rosenkrantz, Algebraic structures with hard equivalence and minimization problems, J. ACM 31 (1984) 879-904.
7. A. Bossi, N. Cocco, M. Fabris, Proving termination of logic programs by exploiting term properties, in: S. Abramsky, T. Maibaum (Eds.), Proc. TAPSOFT '91, vol. 2, Lecture Notes in Computer Science, vol. 494, Springer Verlag, Berlin, 1991, pp. 153-180.
8. A. Bossi, N. Cocco, M. Fabris, Proving termination of logic programs by exploiting term properties, in: S. Abramsky, T. Maibaum (Eds.), Proc. TAPSOFT '91, vol. 2, Lecture Notes in Computer Science, vol. 494, Springer Verlag, Berlin, 1991, pp. 153-180.
9. K. Brace, R. Rudell, R. Bryant, Efficient implementation of a BDD package, Proc. 27th ACM/IEEE Design Automation Conf., IEEE Computer Soc. Press, Silver Spring, MD, 1990, pp. 40-45.
10. F.M. Brown, Boolean Reasoning: The Logic of Boolean Equations, Kluwer Academic Publishers, Dordrecht, 1990.
11. R. Bryant, Symbolic Boolean manipulation with ordered binary-decision diagrams, ACM Comput. Surveys 24 (3) (1992) 293-318.
12. C. Chang, H. Keisler, Model Theory, Studies in Logic and Foundations of Mathematics, vol. 73, North-Holland, Amsterdam, 1973.
13. K. Clark, Negation as failure, in: H. Gallaire, J. Minker (Eds.), Logic and Databases, Plenum Press, New York, 1978, pp. 293-322.
14. M. Codish, D. Dams, E. Yardeni, Bottom-up abstract interpretation of logic programs, Theoret. Comput. Sci. 124 (1) (1994) 93-125.
15. M. Codish, B. Demoen, Analysing logic programs using "Prop"-ositional logic programs and a magic wand, in: D. Miller (Ed.), Logic Programming: Proc. 1993 Internat. Symp., MIT Press, Cambridge, MA, 1993, pp. 114-129.
16. M. Codish, B. Demoen, Deriving polymorphic type dependencies for logic programs using multiple incarnations of Prop, in: B. Le Charlier (Ed.), Static Analysis: Proc. 1st Internat. Symp., Lecture Notes in Computer Science, vol. 864, Springer Verlag, Berlin, 1994, pp. 281-296.
17. M. Codish, M. Falaschi, K. Marriott, Suspension analyses for concurrent logic programs, ACM Trans. Programming Languages Systems 16 (3) (1994) 649-686.
18. P. Codognet, G. Filé, Computations, abstractions and constraints in logic programs, Proc. 4th IEEE Internat. Conf. Computer Languages, IEEE Computer Soc. Press, Silver Spring, MD, 1992, pp. 155-164.
19. S.A. Cook, The complexity of theorem-proving procedures, Proc. 3rd Ann. ACM Symp. Theory of Computing, ACM Press, New York, 1971, pp. 151-158.
20. M.-M. Corsini, K. Musumbu, A. Rauzy, B. Le Charlier, Efficient bottom-up abstract interpretation of Prolog by means of constraint solving over symbolic finite domains, in: M. Bruynooghe, J. Penjam (Eds.), Programming Language Implementation and Logic Programming, Lecture Notes in Computer Science, vol. 714, Springer Verlag, Berlin, 1993, pp. 75-91.
21. A. Cortesi, G. Filé, W. Winsborough, Prop revisited: Propositional formula as abstract domain for groundness analysis, Proc. 6th Ann. IEEE Symp. Logic in Computer Science, Amsterdam, The Netherlands, 1991, pp. 322-327.
22. A. Cortesi, B. Le Charlier, P. Van Hentenryck, Evaluation of the domain Prop, J. Logic Programming 23 (3) (1995) 237-278.
23. P. Dart, Dependency analysis and query interfaces for deductive databases, Ph.D. Thesis, The University of Melbourne, Australia, 1988.
24. P. Dart, On derived dependencies and connected databases, J. Logic Programming 11 (2) (1991) 163-188.
25. W. Dowling, J. Gallier, Linear-time algorithms for testing the satisfiability of propositional Horn formulae, J. Logic Programming 1 (3) (1984) 267-284.
26. M. Falaschi, M. Gabbrielli, K. Marriott, C. Palamidessi, Confluence and concurrent constraint programming, in: V.S. Alagar, M. Nivat (Eds.), Proc. 4th Internat. Conf. Algebraic Methodology and Software Technology (AMAST'95), Lecture Notes in Computer Science, vol. 936, Springer Verlag, Berlin, 1995, pp. 531-545.
27. G. Filé, F. Ranzato, Improving abstract interpretations by systematic lifting to the powerset, in: M. Bruynooghe (Ed.), Logic Programming: Proc. 1994 Internat. Symp., MIT Press, Cambridge, MA, 1994, pp. 655-669.
28. R. Giacobazzi, Semantic aspects of logic program analysis, Ph.D. Thesis, University of Pisa, Italy, 1993.
29. D. Hilbert, P. Bernays, Grundlagen der Mathematik, Verlag von Julius Springer, Berlin, 1934.
30. A. Langen, Advanced techniques for approximating variables in logic programs, Ph.D. Thesis, University of Southern California, Los Angeles, CA, 1991.
31. K. Marriott, H. Søndergaard, Notes for a tutorial on abstract interpretation of logic programs, North American Conf. Logic Programming, Cleveland, OH, 1989.
32. K. Marriott, H. Søndergaard, Precise and efficient groundness analysis for logic programs, ACM Lett. Programming Languages Systems 2 (1-4) (1993) 181-196.
33. K. Marriott, H. Søndergaard, N.D. Jones, Denotational abstract interpretation of logic programs, ACM Trans. Programming Languages Systems 16 (3) (1994) 607-648.
34. L. Mauborgne, Abstract interpretation using TDGs, in: B. Le Charlier (Ed.), Static Analysis: Proc. 1st Internat. Symp., Lecture Notes in Computer Science, vol. 864, Springer Verlag, Berlin, 1994, pp. 363-379.
35. C. Mellish, Some global optimizations for a Prolog compiler, J. Logic Programming 2 (1) (1985) 43-66.
36. F. Pelletier, N. Martin, Post's functional completeness theorem, Notre Dame J. Formal Logic 31 (2) (1990) 462-475.
37. R. Ramakrishnan, F. Bancilhon, A. Silberschatz, Safety of recursive Horn clauses with infinite relations, Proc. 6th ACM Symp. Principles of Database Systems, ACM Press, New York, 1987, pp. 328-339.
38. H. Rasiowa, An Algebraic Approach to Non-Classical Logics, Studies in Logic and the Foundations of Mathematics, vol. 78. North-Holland, Amsterdam, 1974.
39. H. Rasiowa, R. Sikorski, The Mathematics of Metamathematics, Polska Akademia Nauk, Monografie Matematyczne, vol. 41, Państwowe Wydawnictwo Naukowe, ul. Miodowa 10, Warsaw, Poland, 1963.
40. V. Saraswat, Concurrent Constraint Programming Languages, MIT Press, Cambridge, MA, 1990.
41. E. Schröder, Der Operationskreis des Logikkalkuls, B.G. Teubner, Leibzig, 1877.
42. E. Shapiro, The family of concurrent logic programming languages, ACM Comput. Surveys 21 (3) (1989) 412-510.
43. H. Søndergaard, An application of abstract interpretation of logic programs: Occur check reduction, in: B. Robinet, R. Wilhelm (Eds.), Proc. ESOP 86, Lecture Notes in Computer Science, vol. 213, Springer Verlag, Berlin, 1986, pp. 327-338.
44. E. Yardeni, S. Kliger, E. Shapiro, The languages FCP(:,?) and FCP(:), New Generation Comput. 7 (2) (1990) 89-107.
45. J. Zobel, Analysis of logic programs, Ph.D. Thesis, The University of Melbourne, 1990.
46. J. Zobel, P. Dart, On logic programs, functional dependencies, and types, Technical Report 90/7, Dept. of Computer Science, The University of Melbourne, 1990.