89 citations found. Retrieving documents...
Janssens, G. and M. Bruynooghe: 1992, `Deriving Descriptions of Possible Values of Program Variables by Means of Abstract Interpretation'. Journal of Logic Programming 13#2-3#, 205#258.

 Home/Search   Document Not in Database   Context   Related Articles   Check  

This paper is cited by the following papers:

First 50 documents  Next 50

A Framework for Analysis of - Typed Logic Programs (2001)   (Correct)
Acceptability with General Orderings - De Schreye, Serebrenik (2002)   (1 citation)  (Correct)
Combining an Improvement to PARMA Trailing with Trailing.. - Schrijvers, Demoen (2002)   (2 citations)  (Correct)
Combining an improvement to PARMA trailing with analysis in HAL - Schrijvers (2002)   (Correct)
Trailing Analysis for HAL - Schrijvers, Banda, Demoen (2002)   (1 citation)  (Correct)
Constraint-Based Mode Analysis of Mercury - Overton, Somogyi, Stuckey (2002)   (Correct)
Non-transformational Termination Analysis of Logic.. - Serebrenik, De Schreye (2001)   (Correct)
Abstract Interpretation over Non-Deterministic Finite Tree.. - Gallagher, al. (2001)   (4 citations)  (Correct)
Constraint-based Termination Analysis of Logic Programs - Decorte, De Schreye.. (1999)   (7 citations)  (Correct)
Analysis of Polymorphically Typed Logic Programs Using.. - Smaus (2001)   (Correct)
Abstract Interpretation over Tree Automata for Set.. - Gallagher, Puebla (2001)   (4 citations)  (Correct)
Termination in a Hierarchy of General Logic Programs - Bossi, Cocco, Etalle, Rossi (2001)   (Correct)
Using parametric set constraints for locating errors.. - Drabent, MALUSZYNSKI, ..   (Correct)
Typed Norms for Typed Logic Programs - Martin, King, Soper (1996)   (6 citations)  (Correct)
Mode Checking in HAL - Banda, Stuckey, Harvey, Marriott   (Correct)
CP Debugging Tools - Aggoun, Benhamou, Bueno, Carro, al.   (Correct)
Non-Failure Analysis for Logic Programs - Debray.. (1997)   (18 citations)  (Correct)
Demand Transformation Analysis for Concurrent Constraint.. - Falaschi, Hicks.. (1994)   (1 citation)  (Correct)
Regular Directional Types for Logic Programs - Charatonik, Podelski   (Correct)
Mode Checking in HAL - Banda, Stuckey, Harvey, Marriott (2000)   (Correct)
Cardinality Analysis of Prolog - Braem, Le Charlier, Modart, Van.. (1994)   (13 citations)  (Correct)
Type Constraint Solving for Parametric and Ad-hoc Polymorphism - Demoen, Banda, Stuckey (1999)   (3 citations)  (Correct)
Type Analysis of Prolog Using Type Graphs - Van Hentenryck, Cortesi, Le.. (1993)   (21 citations)  (Correct)
Directional Type Inference for Logic Programs - Charatonik, Podelski (1998)   (5 citations)  (Correct)
Abstract multiple Specialization and its application to.. - Puebla, Hermenegildo (1999)   (5 citations)  (Correct)
Directional Type Checking for Logic Programs: Beyond.. - Charatonik (2000)   (1 citation)  (Correct)
An Experiment in Domain Refinement: Type Domains and Type.. - Levi, Spoto (1998)   (2 citations)  (Correct)
Regular Trees as an Abstract Domain for Program Specialisation - Gallagher, Peralta (2000)   (Correct)
Polynomial Interpretations as a Basis - For Termination Analysis   (Correct)
Under consideration for publication in Theory and Practice.. - Tom Schrijvers And   (Correct)
Polynomial Interpretations as a Basis - For Termination Analysis   (Correct)
Generalising Def and Pos to Type Analysis - Hill, Spoto (2002)   (1 citation)  (Correct)
Non-failure Analysis and Granularity Control in Parallel.. - Garcia (2000)   (Correct)
More Precise Yet Efficient Type Inference for Logic Programs - Vaucheret, Bueno   (Correct)
Precise and Expressive Mode Systems for Typed Logic Programming.. - Overton (2003)   (Correct)
Finite-Tree Analysis for Constraint Logic-Based.. - Bagnara, Gori, Hill, .. (2001)   (1 citation)  (Correct)
Finite-Tree Analysis for Constraint Logic-Based Languages - Bagnara, Gori, Hill.. (2001)   (1 citation)  (Correct)
Advanced Techniques for Logic Program Specialisation - Leuschel (1997)   (10 citations)  (Correct)
Finite-Tree Analysis for Constraint Logic-Based Languages - Bagnara, Gori, Hill.. (2001)   (1 citation)  (Correct)
Finite-Tree Analysis for Constraint Logic-Based.. - Bagnara, Gori, Hill, .. (2001)   (1 citation)  (Correct)
Termination Analysis of Logic Programs Using.. - Serebrenik, De Schreye (2000)   (Correct)
Hasta-La-Vista: Termination Analyser for Logic Programs - Serebrenik, De Schreye   (Correct)
the Garbage Collection Bibliography - Richard Jones (2003)   (Correct)
Prescriptive Type Inference as an Application of.. - De Mot, Denecker, .. (1999)   (1 citation)  (Correct)
Using Regular Approximations for Generalisation During.. - Gallagher, Peralta   (5 citations)  (Correct)
Inference of Well-typings for Logic Programs with.. - Bruynooghe.. (2005)   Self-citation (Bruynooghe)   (Correct)
When Size Does Matter - Termination Analysis for Typed.. - Vanhoof, Bruynooghe (2002)   (3 citations)  Self-citation (Bruynooghe)   (Correct)
Pos(T): Analyzing Dependencies in Typed Logic Programs - Bruynooghe, Vanhoof, Codish (2001)   (5 citations)  Self-citation (Bruynooghe)   (Correct)
Pos(T): Analyzing Dependencies in Typed Logic Programs - Bruynooghe, Vanhoof, Codish (2001)   (5 citations)  Self-citation (Bruynooghe)   (Correct)
Global Analysis of Constraint Logic Programs - Banda, Hermenegildo.. (1996)   (7 citations)  Self-citation (Janssens Bruynooghe)   (Correct)

First 50 documents  Next 50

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