Prime factorizations of abstract domains using first-order logic

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1139, Issue , 1996, Pages 209-223

  Marchiori, Elena ^a,b  

^a CWI   (Netherlands)

^b LEIDEN UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTATIONAL LINGUISTICS; FACTORIZATION; FORMAL LOGIC; LOGIC PROGRAMMING; RECONFIGURABLE HARDWARE;

ABSTRACT DOMAINS; ABSTRACT INTERPRETATIONS; ALIASING; ASSERTION LANGUAGE; FIRST ORDER LOGIC; PRIME FACTORIZATION;

COMPUTER CIRCUITS;

EID: 84969235370     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61735-3_14     Document Type: Conference Paper

References (18)

1. K.R. Apt and E. Marchiori. Reasoning about Prolog programs: from Modes through types to assertions. In Formal Aspects of Computing, vol. 6A, pug. 743-764, 1994.
2. T. Armstrong, K. Marriott, P. Schachte and H. Søndergaard. Boolean Functions for Dependency Analysis: Algebraic Properties and Efficient Representation. Prec. SAS'94, B. Le Charlier ed., Springer-Verlag, LNCS 864 pp. 266-280, 1994.
3. P. Cousot and R. Cousot. Systematic design of program analysis frameworks. Proc. POPL '79, pp. 269-282. ACM Press, 1979.
4. A. Cortesi G. Filfé, R. Giacobazzi, C. Palamidessi and F. Ranzato. Complementation in abstract interpretation. Proc. SAS '95th A. Mycroft ed., LNCS Vol. 983, pp. 100-117. Springer-Verlag, 1995.
5. A. Cortesi, G. Filé, and W. Winsborough. Prop revised: propositional formula as abstract domain for groundness analysis. Proc. LICS '91, G. Kahn ed., pp. 322-327, 1991.
6. A. Cortesi, G. Filé, and W. Winsborough. Comparison of abstract interpretations. Proc. ICALP '92, W. Kuich, ed. LNCS Vol. 623 pp. 521-532. Springer-Verlag, 1992.
7. A. Cortesi, G. Filé, and W. Winsborough. The quotient of an abstract interpretation. Technical Report 12/94, Dipartimento di Matematica Pura ed Applicata, Université di Padova, 1994.
8. P. Dart. On derived dependencies and connected databases. Journal of Logic Programming, 11(2):163-188, 1991.
9. S. Debray. On the Complexity of Dataflow Analysis of Logic Programs. Proc. ICALP '92, Springer Verlag, pp. 509-520, LNCS 623, 1992.
10. D. Jacobs and A. Langen. Static analysis of logic programs for independent ANDparallelism. Journal of Logic Programming, 13(2,3):154-165, 1992.
11. T.P. Jensen. Strictness Analysis in Logical Form. Proc. Conference on Functional Programming Languages and Computer Architectures Springer Verlag, pp. 352-366, LNCS 523, 1991.
12. N.D. Jones and H. Søndergaard. A Semantics-Based Framework for the Abstract Interpretation of Prolog. Abstract Interpretation of Declarative Languages, eds. S. Abramsky and C. Hankin, Ellis Horwood, Chichester, U.K., pp. 123-142, 1987.
13. E. Marchiori. A Logic for Variable Abasing in Logic Programs. Proc. ALP '94, G. Levi, M. Rodriguez-Artalejo eds., Springer Verlag, pp. 287-304, LNCS 850, 1994.
14. K. Marriott and H. SCndergaard. Notes for a tutorial on abstract interpretation of logic programs. North American Conference on Logic Programming, 1989.
15. K. Marriott and H. SCndergaaxd. Precise and efficient groundness analysis for logic programs. ACM LoPLaS, 2(1-4):181-196, 1993.
16. K. Marriott, H. SCndergaard and N.D. Jones. Denotational abstract interpretation of logic programs. ACM Transactions on Programming Languages and Systems, ACM-TOPLAS, 16(3):607-648, 1994.
17. C. Mellish. Some Global Optimizations for a Prolog Compiler. The Jourrial of Logic Programming, 2(1):43-66, 1985.
18. H. Sondergaard. An Application ofAbstract Interpretation ofLogic Programs: Occur Check Reduction. Proc. ESOP '86, eds. B. Rob]net and R. Wilhelm, Springer Verlag, pp. 327-338, LNCS 213, 1986.