Filters








366 Hits in 8.2 sec

Page 3636 of Mathematical Reviews Vol. , Issue 95f [page]

1995 Mathematical Reviews  
, RI) Optimization techniques for general purpose fixpoint algorithms.  ...  For the sake of the experiments, we focus on a single abstract seman- tics for Prolog and show the instantiations of the general-purpose algorithms to this semantics.  ... 

Evaluation of the Implementation of an Abstract Interpretation Algorithm using Tabled CLP

JOAQUÍN ARIAS, MANUEL CARRO
2019 Theory and Practice of Logic Programming  
It includes PLAI, a fixpoint algorithm for the abstract interpretation of logic programs which we adapt to use tabled constraint logic programming.  ...  AbstractCiaoPP is an analyzer and optimizer for logic programs, part of the Ciao Prolog system.  ...  Thanks are also due to Manuel Hermenegildo, who gave us very valuable feedback on the paper manuscript and also a historical account on the early relationship between tabling and efficient abstract interpretation  ... 
doi:10.1017/s1471068419000383 fatcat:yikav2352zg6jjxasnhnwor7j4

Global flow analysis as a practical compilation tool

M.V Hermenegildo, R Warren, S.K Debray
1992 The Journal of Logic Programming  
To this end, design and implementation aspects are discussed for two practical abstract interpretation-based flow analysis systems: MA3, the MCC And-parallel Analyzer and Annotator; and MS, an experimental  ...  mode inference system developed for SB-Prolog.  ...  Most of the flow analyses that have been proposed for logic programming languages are based on a technique called abstract interpretation [6] .  ... 
doi:10.1016/0743-1066(92)90053-6 fatcat:6tqrbunei5apln74ve3k6k25dm

Generic abstract interpretation algorithms for Prolog: Two optimization techniques and their experimental evaluation

Vincent Englebert, Baudouin Le Charlier, Didier Roland, Pascal Van Hentenryck
1993 Software, Practice & Experience  
The efficient implementation of generic abstract interpretation algorithms for Prolog is reconsidered after References 1 and 2.  ...  The general-purpose character of the optimizations is also discussed. key words: Abstract interpretation PROLOG Fixpoint algorithm Experimentation Languages Performance * Of course, other (less demanding  ...  In this paper, we reconsider the problem of implementing efficiently generic abstract interpretation algorithms for Prolog.  ... 
doi:10.1002/spe.4380230406 fatcat:77tfxbmuoveoreexmrtkyhiqje

Generic abstract interpretation algorithms for prolog: Two optimization techniques and their experimental evaluation [chapter]

Vincent Englebert, Baudouin Le Charlier, Didier Roland, Pascal Van Hentenryck
1992 Lecture Notes in Computer Science  
The efficient implementation of generic abstract interpretation algorithms for Prolog is reconsidered after References 1 and 2.  ...  The general-purpose character of the optimizations is also discussed. key words: Abstract interpretation PROLOG Fixpoint algorithm Experimentation Languages Performance * Of course, other (less demanding  ...  In this paper, we reconsider the problem of implementing efficiently generic abstract interpretation algorithms for Prolog.  ... 
doi:10.1007/3-540-55844-6_144 fatcat:j73j6snvxfb3bbui4rblhnen2y

Implementation of multiple specialization in logic programs

Germán Puebla, Manuel Hermenegildo
1995 Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation - PEPM '95  
This involves in general generating several versions of a program predícate for different uses of such predícate, making use of information obtained from global analysis performed by an abstract interpreter  ...  Also, we propose an implementation technique which has the same power as the strongest of the previously proposed techniques but requires little or no modification of an existing abstract interpreter.  ...  Abstract interpretation of logic programs and the related implementation techniques are well understood for several general types of analysis and, in particular, for top-down analysis of Prolog [10, 2  ... 
doi:10.1145/215465.215561 dblp:conf/pepm/PueblaH95 fatcat:ji4i3knb4re5rccvcca566bmdq

Type analysis of prolog using type graphs

Pascal Van Hentenryck, Agostino Cortesi, Baudouin Le Charlier
1995 The Journal of Logic Programming  
GAIA ('R) is a generic fixpoint algorithm for Pro- log which, given an abstract domain~, computes the least fixpoint (finite domains) or a postfixpoint (infinite domains) of an abstract  ...  The system is best described as GAIA (Pat (Type)), where GAIA is a generic top-down fix- point algorithm for Prolog [?, ?]  ...  The replacement rule can be specified as follows: TRr(go>gn) = g, Precondition: GR(go,gn) # 0.  ... 
doi:10.1016/0743-1066(94)00021-w fatcat:c6qzejd37feu7jyzecbaudyita

Type analysis of Prolog using type graphs

P. Van Hentenryck, A. Cortesi, B. Le Charlier
1994 Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation - PLDI '94  
GAIA ('R) is a generic fixpoint algorithm for Pro- log which, given an abstract domain~, computes the least fixpoint (finite domains) or a postfixpoint (infinite domains) of an abstract  ...  The system is best described as GAIA (Pat (Type)), where GAIA is a generic top-down fix- point algorithm for Prolog [?, ?]  ...  The replacement rule can be specified as follows: TRr(go>gn) = g, Precondition: GR(go,gn) # 0.  ... 
doi:10.1145/178243.178479 dblp:conf/pldi/HentenryckCC94 fatcat:7ocnpstaunfunjsngu3n55sgki

Type analysis of Prolog using type graphs

P. Van Hentenryck, A. Cortesi, B. Le Charlier
1994 SIGPLAN notices  
GAIA ('R) is a generic fixpoint algorithm for Pro- log which, given an abstract domain~, computes the least fixpoint (finite domains) or a postfixpoint (infinite domains) of an abstract  ...  The system is best described as GAIA (Pat (Type)), where GAIA is a generic top-down fix- point algorithm for Prolog [?, ?]  ...  The replacement rule can be specified as follows: TRr(go>gn) = g, Precondition: GR(go,gn) # 0.  ... 
doi:10.1145/773473.178479 fatcat:btj3l25dxff7vi2q6krqnndire

Combinations of abstract domains for logic programming

Agostino Cortesi, Baudouin Le Charlier, Pascal Van Hentenryck
1994 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '94  
Genetic Abstract Interpretation Algorithms for Prolog: Two Optimization Techniques and Their Experimental Evaluation. Software Practice and Experience, 23(4), April 1993. R.  ...  abstract semantics; (3) the design of a fixpoint algorithm to compute the least fixpoint of the abstract semantics.  ... 
doi:10.1145/174675.177880 dblp:conf/popl/CortesiCH94 fatcat:3ktpjxvzkrf2holohj2wek3tbi

Page 2356 of Mathematical Reviews Vol. , Issue 95d [page]

1995 Mathematical Reviews  
purpose fixpoint algorithms: practical efficiency for the abstract interpreta- tion of Prolog (15-26); Niels Jorgensen, Chaotic fixpoint iteration guided by dynamic dependency (27-44); Alex Ferguson and  ...  ISBN 3-540-57264-3 The twenty-four papers in this collection include the following: Baudouin Le Charlier, Olivier Degimbe, Laurent Michel and Pas- cal Van Hentenryck, Optimization techniques for general  ... 

Incremental Analysis of Logic Programs [chapter]

1995 Logic Programming  
Finally, we present some experimental results obtained with an implementation of the algorithms in the PLAI generic abstract interpretation framework.  ...  We describe how the fixpoint algorithms in current generic analysis engines can be extended to support incremental analysis.  ...  The authors would also like to thank M. J. Garcia de la Banda, Harald Sondergaard, and the anonymous referees for useful comments.  ... 
doi:10.7551/mitpress/4298.003.0075 fatcat:jtephwesgjdgxmdjgq4unhruk4

A technique for recursive invariance detection and selective program specialization [chapter]

F. Giannotti, M. Hermenegildo
1991 Lecture Notes in Computer Science  
This paper presents a technique for achieving a class of optimizations related to the reduction of checks within cycles. The technique uses both Program Transformation and Abstract Interpretation.  ...  It also allows selective program specialization using a standard abstract interpreter not specifically designed for this purpose, thus simplifying the design of this already complex module of the compiler  ...  Acknowledgements: We would like to thank Vitor Santos-Costa of the University of Bristol and the anonymous referees for their useful comments on previous drafts of this paper.  ... 
doi:10.1007/3-540-54444-5_109 fatcat:5uwkpzdhrrhvfpogoozwa2bk5a

The Vienna abstract machine

Andreas Krall
1996 The Journal of Logic Programming  
The goal of Prolog implementations is to achieve high overall efficiency. Many high-speed implementations sacrifice the performance of the compilation built-in predicates for expensive optimizations.  ...  Different versions of the VAM are used for different purposes: the VAM2p is well suited for interpretation; the VAMIp has been designed for native code compilation.  ...  Current abstract interpretation systems for Prolog were too slow for use in an optimizing Prolog compiler. So the VAMAI (VAM for abstract interpretation) has been designed.  ... 
doi:10.1016/s0743-1066(96)00064-7 fatcat:hzggauvlirgktiudvillpwk6jq

Abstraction carrying code and resource-awareness

Manuel V. Hermenegildo, Elvira Albert, Pedro López-García, Germán Puebla
2005 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming - PPDP '05  
The generation of the certificate, i.e., the abstraction, is automatically carried out by an abstract interpretation-based analysis engine, which is parametric w.r.t. different abstract domains.  ...  ACC addresses the fundamental issues in PCC and opens the door to the applicability of the large body of frameworks and domains based on abstract interpretation as enabling technology for PCC.  ...  ACKNOWLEDGMENTS Finally, thanks are also due to the PPDP program committee members for their generous invitation to present this work and demo the system at the conference.  ... 
doi:10.1145/1069774.1069775 dblp:conf/ppdp/HermenegildoALP05 fatcat:j4zeci2carhvrig5lcepdp6gsy
« Previous Showing results 1 — 15 out of 366 results