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 Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
A Framework for Analysis of - Typed Logic Programs (2001) (Correct)
....for Sharing follows by the isomorphism. Theorem 4. Sh is a proper abstraction of Type(Sh ) 7 Related Work and Conclusion We brie y compare the approach proposed in this paper with some previous works presenting abstract domains based on regular types. Janssens and Bruynooghe present in [12] a framework for program type and mode analysis of Prolog programs based on type graphs. The abstract domains based on rigid types and integrated types are capable of inferring types and modes of a program. The later domain can track freeness as an additional mode, thus signi cantly improving the ....
....types are capable of inferring types and modes of a program. The later domain can track freeness as an additional mode, thus signi cantly improving the precision of analysis for programs manipulating partially instantiated structures. The work of Mulkers et al. 16] applies the framework of [12] for tracking liveness of Prolog structures. The abstract domain developed in this work models the execution environment of a predicate using type graphs and special arcs representing structure sharing. In Bruynooghe et al. 1] the framework of [16] is further extended and applied to liveness ....
[Article contains additional citation context not shown here]
G. Janssens and M. Bruynooghe. Deriving descriptions of possible values of program variables by means of abstract interpretation. JLP, 13(2 & 3):205-258, 1992.
Acceptability with General Orderings - De Schreye, Serebrenik (2002) (1 citation) (Correct)
....1 ; t 2 )j t 1 is a nil terminated list and t 2 is a free variableg. Then, Call(P; S) S [ fdelete(t 1 ; t 2 ; t 3 )j t 1 ; t 3 are free variables and t 2 is a nil terminated listg: Such information about S could for instance be expressed in terms of the rigid types of Janssens and Bruynooghe [21] and Call(P; S) could be computed using the type inference of [21] 2 6 The following definition generalises the notion of acceptability with respect to a set [12] in two ways: 1) it generalises it to general quasi orderings, 2) it generalises it to mutual recursion, using the standard notion of ....
.... Then, Call(P; S) S [ fdelete(t 1 ; t 2 ; t 3 )j t 1 ; t 3 are free variables and t 2 is a nil terminated listg: Such information about S could for instance be expressed in terms of the rigid types of Janssens and Bruynooghe [21] and Call(P; S) could be computed using the type inference of [21]. 2 6 The following definition generalises the notion of acceptability with respect to a set [12] in two ways: 1) it generalises it to general quasi orderings, 2) it generalises it to mutual recursion, using the standard notion of mutual recursion [2] Definition 6. Let S be a set of atomic ....
[Article contains additional citation context not shown here]
G. Janssens and M. Bruynooghe. Deriving descriptions of possible values of program variables by means of abstract interpretation. J. Logic Programming, 13(2&3):205--258, July 1992.
Combining an Improvement to PARMA Trailing with Trailing.. - Schrijvers, Demoen (2002) (2 citations) (Correct)
....could be represented more accurately, by requiring the domain to keep track of the di#erent chains contained in the structures to which the program variables are bound, their individual trailing state and how these are a#ected by the di#erent program constructs. Known techniques (see for instance [7, 6, 9]) based on type information could be used to keep track of the constructor that a variable is bound to and the trailing state of the di#erent arguments, thereby making this approach possible. This applies equally to the analysis of the classical scheme. Additionally it would be interesting to see ....
G. Janssens and M. Bruynooghe. Deriving descriptions of possible value of program variables by means of abstract interpretation. JLP, 13:205--258, 1993.
Combining an improvement to PARMA trailing with analysis in HAL - Schrijvers (2002) (Correct)
....could be represented more accurately, by requiring the domain to keep track of the di erent chains contained in the structures to which the program variables are bound, their individual trailing state and how these are a ected by the di erent program constructs. Known techniques (see for instance [7, 6, 9]) based on type information could be used to keep track of the constructor that a variable is bound to and the trailing state of the di erent arguments, thereby making this approach possible. This applies equally to the analysis of the classical scheme. Additionally it would be interesting to see ....
G. Janssens and M. Bruynooghe. Deriving descriptions of possible value of program variables by means of abstract interpretation. JLP, 13:205-258, 1993.
Trailing Analysis for HAL - Schrijvers, Banda, Demoen (2002) (1 citation) (Correct)
....bound variables more accurately, by requiring the domain to keep track of the di#erent chains contained in the structures to which the program variables are bound, their individual trailing state and how these are a#ected by the di#erent program constructs. Known techniques (see for instance [JB93,HCC95,MWB94]) based on type information could be used to keep track of the constructor that a variable is bound to and of the trailing state of the di#erent arguments, thereby making this approach possible. 5 Analysing HAL Body Constructs This section defines the notrail operations required by HAL s ....
G. Janssens and M. Bruynooghe. Deriving descriptions of possible value of program variables by means of abstract interpretation. JLP, 13:205-- 258, 1993.
Constraint-Based Mode Analysis of Mercury - Overton, Somogyi, Stuckey (2002) (Correct)
....Almost all work on mode analysis in logic programming has focused on untyped languages, mainly Prolog. As a consequence, most papers use very simple analysis domains, such as ground, free, unknown . One can use patterns from the code to derive more detailed program specific domains, as in e.g. [3, 10, 12], but such analyses must sacrifice too much precision to achieve acceptable analysis times. In [18] we proposed fixing this problem by requiring type information and using the types of variables as the domains of mode analysis. Several papers since then (e.g. 14, 17] have been based on similar ....
G. Janssens and M. Bruynooghe. Deriving descriptions of possible value of program variables by means of abstract interpretation. JLP, 13:205--258, 1993.
Inference of Well-typings for Logic Programs with.. - Bruynooghe.. (2005) Self-citation (Bruynooghe) (Correct)
No context found.
G. Janssens and M. Bruynooghe. Deriving descriptions of possible values of program variables by means of abstract interpretation. Journal of Logic Programming, 13(2-3):205--258, 1992.
When Size Does Matter - Termination Analysis for Typed.. - Vanhoof, Bruynooghe (2002) (3 citations) Self-citation (Bruynooghe) (Correct)
....that overcomes these problems has been presented in [11] considering so called typed norms. The general idea is to derive for every argument position of each atom in the program an approximation of the set of terms that can occur in that position (expressed through the formalism of rigid types [15]) and to construct a particular norm for each such set. For the above example, 11] would derive that the second argument of flat 2 contains a list of any values, whereas the rst argument may contain a list of which the elements are again lists of any values. Accordingly, it would derive exactly ....
Gerda Janssens and Maurice Bruynooghe. Deriving descriptions of possible values of program variables by means of abstract interpretation. J. Logic programming, 13(2&3):205-258, 1992.
Pos(T): Analyzing Dependencies in Typed Logic Programs - Bruynooghe, Vanhoof, Codish (2001) (5 citations) Self-citation (Bruynooghe) (Correct)
....A feature distinguishing our work from the other type based approaches is that we have an analysis for polymorphic types which eliminates the need to analyze a polymorphic predicate for each distinct type instance under which it is called. Type information can be derived by analysis, as e.g. in [18, 15]; specified by the user and verified by analysis as possible in Prolog systems such as Ciao [16] or declared and considered part of the semantics of the program as with strongly typed languages such as Godel [17] Mercury [28] and HAL [13] The analysis as worked out in this paper is for strongly ....
G. Janssens and M. Bruynooghe. Deriving descriptions of possible values of program variables by means of abstract interpretation. J. Logic programming, 13(2&3):205--258, 1992.
Regular Trees as an Abstract Domain for Program Specialisation - Gallagher, Peralta (2000) (Correct)
No context found.
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.
Polynomial Interpretations as a Basis - For Termination Analysis (Correct)
No context found.
G. Janssen and M. Bruynooghe. Deriving descriptions of possible values of program variables by means of abstract interpretation. J. Log. Program., 13(2&3):205--258, 1992.
Under consideration for publication in Theory and Practice.. - Tom Schrijvers And (Correct)
No context found.
Janssens, G. and Bruynooghe, M. 1993. Deriving Descriptions of Possible Value of Program Variables by means of Abstract Interpretation. Journal of Logic Programming 13, 205--258.
Polynomial Interpretations as a Basis - For Termination Analysis (Correct)
No context found.
G. Janssen and M. Bruynooghe. Deriving descriptions of possible values of program variables by means of abstract interpretation. J. Log. Program., 13(2&3):205--258, 1992.
Generalising Def and Pos to Type Analysis - Hill, Spoto (2002) (1 citation) (Correct)
No context found.
G. Janssens and M. Bruynooghe. Deriving Descriptions of Possible Values of Program Variables by means of Abstract Interpretation. Journal of Logic Programming, 13(2 & 3):205-258, 1992.
Non-failure Analysis and Granularity Control in Parallel.. - Garcia (2000) (Correct)
No context found.
G. Janssens and M. Bruynooghe. Deriving Descriptions of Possible Values of Program Variables by means of Abstract Interpretation. Journal of Logic Programming, 13(2 and 3):205--258, July 1992.
More Precise Yet Efficient Type Inference for Logic Programs - Vaucheret, Bueno (Correct)
No context found.
G. Janssens and M. Bruynooghe. Deriving Descriptions of Possible Values of Program Variables by means of Abstract Interpretation. Journal of Logic Programming, 13(2 and 3):205-258, July 1992.
Precise and Expressive Mode Systems for Typed Logic Programming.. - Overton (2003) (Correct)
No context found.
Gerda Janssens and Maurice Bruynooghe. Deriving descriptions of possible value of program variables by means of abstract interpretation. Journal of Logic Programming, 13(2 & 3): 205--258, 1992.
Finite-Tree Analysis for Constraint Logic-Based.. - Bagnara, Gori, Hill, .. (2001) (1 citation) (Correct)
No context found.
G. Janssens, M. Bruynooghe, Deriving descriptions of possible values of program variables by means of abstract interpretation, Journal of Logic Programming 13 (2&3) (1992) 205--258.
Finite-Tree Analysis for Constraint Logic-Based Languages - Bagnara, Gori, Hill.. (2001) (1 citation) (Correct)
No context found.
G. Janssens, M. Bruynooghe, Deriving descriptions of possible values of program variables by means of abstract interpretation, Journal of Logic Programming 13 (2&3) (1992) 205--258.
Advanced Techniques for Logic Program Specialisation - Leuschel (1997) (10 citations) (Correct)
No context found.
G. Janssens and M. Bruynooghe. Deriving descriptions of possible values of program variables by means of abstract interpretation. The Journal of Logic Programming, 13(2 & 3):205-258, 1992.
Finite-Tree Analysis for Constraint Logic-Based Languages - Bagnara, Gori, Hill.. (2001) (1 citation) (Correct)
No context found.
G. Janssens, M. Bruynooghe, Deriving descriptions of possible values of program variables by means of abstract interpretation, Journal of Logic Programming 13 (2&3) (1992) 205--258.
Finite-Tree Analysis for Constraint Logic-Based.. - Bagnara, Gori, Hill, .. (2001) (1 citation) (Correct)
No context found.
G. Janssens, M. Bruynooghe, Deriving descriptions of possible values of program variables by means of abstract interpretation, Journal of Logic Programming 13 (2&3) (1992) 205--258.
Termination Analysis of Logic Programs Using.. - Serebrenik, De Schreye (2000) (Correct)
No context found.
G. Janssens and M. Bruynooghe. Deriving descriptions of possible values of program variables by means of abstract interpretation. J. Logic Programming, 13(2&3):205--258, July 1992.
Hasta-La-Vista: Termination Analyser for Logic Programs - Serebrenik, De Schreye (Correct)
No context found.
G. Janssens and M. Bruynooghe. Deriving descriptions of possible values of program variables by means of abstract interpretation. Journal of Logic Programming, 13(2&3):205--258, July 1992.
the Garbage Collection Bibliography - Richard Jones (2003) (Correct)
No context found.
G. Janssens and Maurice Bruynooghe. Deriving descriptions of possible values of program variables by means of abstract interpretation. Journal of Logic Programming, 13(2, 3):205--258, July 1992.
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