M. Garc'ia de la Banda, M. Hermenegildo, M. Bruynooghe, V. Dumortier, G. Janssens, and W. Simoens. Global Analysis of Constraint Logic Programs. ACM Transactions on Programming Languages and Systems, 18(5):564--615, 1996. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Specialization Technique for Deriving.. - Fioravanti.. (Correct)
....es M i for each constrained atom c 0 A 0 which satis es M , and for each constrained goal c A G such that c 0 A 0 7 P c A G, we have that c A satis es M . Often the property that a program satis es a mode can be automatically veri ed by abstract interpretation methods [13]. De nition 3. We say that a program P is deterministic w.r.t. a mode M i P is deterministic w.r.t. every constrained atom c 0 A 0 which satis es M . Now we give a sucient condition which ensures that a program is deterministic w.r.t. a mode. We need the following de nition. De nition 4. ....
M. Garcia de la Banda, M. Hermenegildo, M. Bruynooghe, V. Dumortier, G. Janssens, and W. Simoens. Global analysis of constraint logic programs. ACM Toplas, 18(5):564-614, 1996.
Specialization with Clause Splitting for Deriving.. - Fioravanti.. (2002) (Correct)
....in t i is grounded by c. We say that P satis es M i for each constrained atom c0 A0 which satis es M , and for each constrained goal P c A G, we have that c A satis es M . Often the property that a program satis es a mode can be automatically veri ed by abstract interpretation methods [11]. We say that a program P is deterministic w.r.t. a mode M i P is deterministic w.r.t. every constrained atom c0 A0 which satis es M . Now we give a sucient condition which ensures that a program is deterministic w.r.t. a mode. We need the following de nition. De nition 2: Let us consider ....
M. Garcia de la Banda, M. Hermenegildo, M. Bruynooghe, V. Dumortier, G. Janssens, and W. Simoens. Global analysis of constraint logic programs. ACM Toplas, 18(5):564-614, 1996.
Horn Logic Denotations and Their Applications - Gupta (2 citations) (Correct)
.... vari(X) term(t(V,H,T) vari(V) hats(H) term(T) op1(op(H, hats(H) op1(op( op1(op( hats( hats( L] hats(L) vari(x) x] vari(y) y] vari(z) z] digit(0) 0] digit(1) 1] digit(2) [2]. digit(3) 3] digit(4) 4] digit(5) 5] digit(6) 6] digit(7) 7] digit(8) 8] digit(9) 9] SEMANTICS: sexp(e(X) INL,L) sterm(X,INL,ONL,L1) getlist(ONL, Bl) append(L1,Bl,L) sexp(e(T,O,E) NL,L) sterm(T,NL,OL, L1) sop(O,OL,NL1) CloseBraces is OL ....
....as a logic program, all the analysis tools that have been developed for logic programming can be applied to analyze the properties of the logical denotation. For example, abstract interpretation based analyzers can be applied to the compiled program to check if two operations are independent [2]. Program termination analyzers [24] can be applied to check if the program will terminate. Non failure analysis 29 [4] can be applied to check for non failure of the logical denotation, etc. At present, analysis tools developed for constraint logic programming [2] are being applied to analyze the ....
[Article contains additional citation context not shown here]
M. Garcia de la Banda, M. Hermenegildo, et al. Global Analysis of Constraint Logic Programs. In ACM Trans. on Prog. Languages and Systems, Vol. 18, Num. 5, pages 564-615, ACM, 1996.
A Horn Logic Denotational Framework for Specification.. - Gupta, Pontelli (1999) (3 citations) (Correct)
....denotation obtained, using the approach described above. ii) we can use abstract interpretation tools built for logic programming to abstract the concrete denotation and use that for verifying the properties; in fact, work is in progress in to use non failure analysis of constraint logic programs [8, 10] to verify properties of real time systems. A third approach that can be used to remove the niteness restriction is to use rst order theorem proving. The logical denotation of a program provides an axiomatization w.r.t. the language s semantics. These axioms can then be fed to a theorem prover, ....
M. Garcia de la Banda, M. Hermenegildo, et al. Global Analysis of Constraint Logic Programs. In ACM Trans. on Prog. Languages and Systems, Vol. 18, Num. 5, pages 564-615, ACM, 1996.
Analysis of normal CLP programs - Fages, Gori (1997) (Correct)
....logic programs (CLP) is nowadays standard practice. Several systems have been implemented and proved useful at either helping the programmer to find errors, through type checking and declarative diagnosis, or improving program efficiency, through program transformation and compilation (see e.g. [12, 3, 19]) Much work has been done in this context using the theory of abstract interpretation [6] for helping the design of such analyzers and proving their correctness. A key point in abstract interpretation is the choice of a reference semantics from which one can abstract the properties of interest. ....
M.Garcia de la Banda, M. Hermenegildo, M. Bruynooghe, V. Dumortier, G. Janssens, W. Simoens, "Global analysis of constraint logic programs", ACM Transactions on Programming Languages and Systems, 18(5):564-614, 1996.
An Assertion Language for Debugging of Constraint Logic.. - Puebla, Bueno.. (1997) Self-citation (Hermenegildo) (Correct)
No context found.
M. Garc'ia de la Banda, M. Hermenegildo, M. Bruynooghe, V. Dumortier, G. Janssens, and W. Simoens. Global Analysis of Constraint Logic Programs. ACM Transactions on Programming Languages and Systems, 18(5):564--615, 1996.
A Brief Overview of Logic Programming Research at.. - Martens.. Self-citation (Bruynooghe Janssens) (Correct)
....of bringing several analyses together in a compiler system is rather limited. Only two prototype systems have been built [71, 67] Leuven has contributed by developing a widely used top down framework [3] and, together with UPM Madrid, by adapting the framework for constraint logic programming [40]. It has a lot of experience in developing, implementing and comparing domains [6, 5, 41, 63, 65, 11, 64, 7] The domains in [39, 38, 43] are focusing on specific properties of constraint logic programs. Recently, the Leuven group has also experimented with bottom up methods [8, 9, 10] and it has ....
M. Garcia de la Banda, M. Hermenegildo, M. Bruynooghe, V. Dumortier, G. Janssens, and W. Simoens. Global analysis of constraint logic programs. Technical Report CW205, Department of Computer Science, Katholieke Universiteit Leuven, January 1995.
Live-structure Analysis for Logic Programming Languages with.. - Bruynooghe (1996) (2 citations) Self-citation (Bruynooghe Janssens) (Correct)
....on the application specific aspects: structure of abstract domain, abstraction of procedure entry, of procedure exit and of unification. For all framework specific aspects (tabulation, fixpoint iteration etc. which guarantee termination and safe approximation, the unfamiliar reader should consult [3, 8]. Under LSLD, the number of components in a substitution is restricted to the number of variables in the clause associated with the substitution. The processing of a unification instruction under LSLD is as under SLD. Procedureentry and procedure exit are processed differently. For the special ....
M. Garcia de la Banda , M. Hermenegildo, M. Bruynooghe, V. Dumortier, G. Janssens, and W. Simoens. Global analysis of constraint logic programs. ACM Trans. Prog. Lang. Syst., 1996. Accepted for publication.
Transformation Rules for Locally Stratified.. - Fioravanti.. (2004) (1 citation) (Correct)
No context found.
M. Garcia de la Banda, M. Hermenegildo, M. Bruynooghe, V. Dumortier, G. Janssens, and W. Simoens. Global analysis of constraint logic programs. ACM Transactions on Programming Languages and Systems, 18(5):564614, 1996.
Assessment of a Storage Optimisation Tool for AKL - Sjöland, Brand, Sahlin (Correct)
No context found.
M. G. de la Banda, M. Hermenegildo, M. Bruynooghe,V. Dumortier, G. Janssens and W. Simoens. Global Analysis of Constraint Logic Programs. Report CW 205, Dept. of Comp. Sci., Katholieke Univ. Leuven, 1995.
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