The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Implementation of multiple specialization in logic programs
Open accessAbstract
We study the multiple specialization of logic programs based on abstract interpretation.This involves in general generating several versions of a program predicate for different uses of such predicate, making use of information obtained from global analysis performed by an abstract interpreter, and finally producing a new, '~multiply specialized" program.While the topic of multiple specialization of logic programs has received considerable theoretical attention, it has never been actually incorporated in a compiler and its effects quantified.We perform such a study in the context of a parallelizing compiler and show that it is indeed a relevant technique in practice.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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
A similar use of the minimization algorithm is made by Winsborough [1992] and Puebla and Hermenegildo [1995].
“A similar use of this minimization algorithm is made by Winsborough [1992] and Puebla and Hermenegildo [1995].”
From Controlling generalization and polyvariance in partial deduction of normal logic programs (1998) · cites this paper as Puebla and Hermenegildo [1995]
Puebla and Hermenegildo [1995], in a somewhat different context, studies polyvariant parallelization and specialization of logic programs based on abstract interpretation.
“The latter, in a somewhat different context, studies polyvariant parallelization and specialization of logic programs based on abstract interpretation.”
From Controlling generalization and polyvariance in partial deduction of normal logic programs (1998) · cites this paper as Puebla and Hermenegildo [1995]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Multiple specialization using minimal-function graph semantics
Winsborough, W. (1992) · The Journal of Logic Programming · doi:10.1016/0743-1066(92)90033-y · Cited by 63 · cited 3×
“Winsborough [34] presents an algorithm, based on the notion of minimal function graphs [21], that solves the two problems outlined above.”
Flagged first, then by citations
Research works printed but not linked: 5
- A. Aho and J.D. Unman. Principles of Compiler De- sign. Addison-Wesley, Reading, Mass., 1977.
- M. Bruynooghe. A Practical Framework for the Ab- st ract Interpret at ion of Logic Programs. Journal of Logtc Prog~amming, 10:91-124, 1991.
- F. Bueno, M. Garcia de la Banda, and M. Hermenegildo. Effectiveness of Global Analysis in Strict Independence-Based Automatic Program Paral- lelization. In International Symposium on Logic Pro- grammmg, pages 320-336.
- B. Le Charlier and P. Van Hentenryck. Experimental Evaluation of a Generic Abstract Interpretation Algo- rithm for Prolog. ACM Transactions on Programming Languages and Systems, 16(1):35-101, 1994.
- C. Consel and O. Danvy. Tutorial Notes on Partial Evaluation. In ACM SIGPLAN-SIGA CT Symposium on Principles of Programming Languages POPL '93, pages 493-501, Charleston, South Carolina, 1993. ACM.
Cited by
Sorted by citations
Controlling generalization and polyvariance in partial deduction of normal logic programs
Leuschel, M., Martens, B., & De Schreye, D. (1998) · ACM Transactions on Programming Languages and Systems · doi:10.1145/271510.271525 · Cited by 88
Metadata
- Authors
- Puebla, G., & Hermenegildo, M.
- Affiliations
- Universidad Politécnica de Madrid (ES)
- ORCID
- Hermenegildo, Manuel
- Venue
- Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation - PEPM '95
- Publisher
- ACM Press
- Published
- 1995
- Pages
- 77-87
- OpenAlex
- W2026803730
- Cited by
- 31
- References
- 1
- Citations by year
- 2025: 1 · 2013: 1
- FWCI
- 4.41
- Type
- conference paper
- Language
- en
- Open access
- bronze
- doi.org
- Locations
- ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation (PEPM) (publishedVersion)
- Hispana (acceptedVersion, cc-by-nc-nd)
- Archivo Digital UPM (Universidad Politécnica de Madrid) (submittedVersion, cc-by-nc-nd)
- Topics
- Physical Sciences › Computer Science › Software › Logic, programming, and type systems
- Physical Sciences › Computer Science › Hardware and Architecture › Parallel Computing and Optimization Techniques
- Physical Sciences › Computer Science › Information Systems › Advanced Database Systems and Queries
- Keywords
- logic programs, abstract interpretation, global analysis, parallelizing compilers, program specialization, compiler implementation
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
