See this document in CiteSeerX!

Flow Analysis of Dynamic Logic Programs (1989)  (Make Corrections)  (9 citations)
Saumya K. Debray
Journal of Logic Programming



  Home/Search   Context   Related

 
View or download:
arizona.edu/people/debray...dynprogs.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  arizona.edu/people/debray...index (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Research on flow analysis and optimization of logic programs typically assumes that the programs being analyzed are static, i.e. any code that can be executed at runtime is available for analysis at compile time. This assumption may not hold for "real" programs, which can contain dynamic goals of the form call(X), where X is a variable at compile time, or where predicates may be modified via features like assert and retract. In such contexts, a compiler must be able to take the effects of such... (Update)

Context of citations to this paper:   More

.... Many realistic programs contain such builtins, however, and so this is an important issue to address when constructing an analyser [2 4,6,7]. This note details how builtins are handled in a groundness analyser developed at the University of Kent in collaboration with the...

...to restrict hypotheses when learning. Dependencies are used in [2] to reduce inter process communication by parallel logic programs and in [4] to facilitate rules asserting and retracting other rules in the same rulebase. However, to the authors knowledge, SDML is the first...

Cited by:   More
A New Module System for Prolog - Cabeza, Hermenegildo (2000)   (Correct)
Data-Flow Analysis of Prolog Programs with.. - Bueno, Cabeza.. (1995)   (Correct)
Efficient Forward Chaining for Declarative Rules In a.. - Wallis, Moss (1995)   (Correct)

Active bibliography (related documents):   More   All
0.2:   Automatic Mode Inference for Logic Programs - Debray, Warren (1988)   (Correct)
0.2:   Static Inference of Modes and Data Dependencies in Logic Programs - Debray (1989)   (Correct)
0.1:   Efficient Dataflow Analysis of Logic Programs - Debray (1992)   (Correct)

Similar documents based on text:   More   All
0.1:   Compiler Techniques for Code Compaction - Debray, Evans, Muth, De Sutter (2000)   (Correct)
0.1:   Return Value Placement And Tail Call Optimization In High.. - Bigot, Debray (1999)   (Correct)
0.1:   Detection And Optimization Of Suspension-Free Logic Programs - Debray, Gudeman, Bigot (1996)   (Correct)

Related documents from co-citation:   More   All
5:   National Physical Laboratory (context) - for - 1995
4:   the practicality of global flow analysis of logic programs (context) - Warren, Hermenegildo et al. - 1988
4:   Static Inference of Modes and Data Dependencies in Logic Programs - Debray - 1989

BibTeX entry:   (Update)

S.K. Debray. Flow analysis of dynamic logic programs. Journal of Logic Programming, 7(2):149--176, September 1989. http://citeseer.ist.psu.edu/debray89flow.html   More

@article{ debray89flow,
    author = "Saumya K. Debray",
    title = "Flow Analysis of Dynamic Logic Programs",
    journal = "Journal of Logic Programming",
    volume = "7",
    number = "2",
    pages = "149-176",
    year = "1989",
    url = "citeseer.ist.psu.edu/debray89flow.html" }
Citations (may not include all citations):
363   Programming in Prolog (context) - Clocksin, Mellish - 1981
112   OLD-Resolution with Tabulation (context) - Tamaki, Sato - 1986
91   Towards a theory of types in Prolog (context) - Mishra - 1984
82   ACM Transactions on Programming Languages and Systems (context) - Debray, Warren et al. - 1989
62   Some Global Optimizations for a Prolog Compiler (context) - Mellish - 1985
51   Automatic Mode Inference for Logic Programs - Debray, Warren - 1988
45   Extension Tables: Memo Relations in Logic Programming (context) - Dietrich - 1987
37   Abstract Interpretation: Towards the Global Optimization of .. (context) - Bruynooghe, Demoen et al. - 1987
30   in and D. DeGroot, AND-Parallelism of Logic Programs Based o.. (context) - Chang, Despa - 1985
28   Efficient Dataflow Analysis of Logic Programs - Debray - 1988
16   Flow Analysis of Prolog Programs (context) - Mannila, Ukkonen - 1987
11   Quintus Computer Systems (context) - Reference - 1986



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://www.cs.arizona.edu/people/debray/papers/index.html):   More
Reasoning About Naming Systems - Bowman, Debray, Peterson (1993)   (Correct)
A Simple Program Transformation for Parallelism - Debray, Jain (1994)   (Correct)
Towards Banishing the Cut from Prolog - Debray, Warren (1990)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC