The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
Multiple specialization using minimal-function graph semantics
Open accessOverview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
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 Winsborough [1992]
Winsborough [1992] aims at minimizing polyvariance in the context of multiple specialization by optimizing compilers.
“The former aims at minimizing polyvariance in the context of multiple specialization by optimizing compilers.”
From Controlling generalization and polyvariance in partial deduction of normal logic programs (1998) · cites this paper as Winsborough [1992]
Citations
Cites
Cousot, P., & Cousot, R. (1977) · Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '77 · doi:10.1145/512950.512973 · Cited by 6,279
Foundations of Logic Programming
Lloyd, J. (1984) · Symbolic Computation · doi:10.1007/978-3-642-96826-6 · Cited by 5,772
Aho, A. V., & Ullman, J. D. (1977) · International Linear Collider · Cited by 1,003
Abstract interpretation of declarative languages
Chessel, D., Dufour, A. B., & Thioulouse, J. (1988) · Information and Software Technology · doi:10.1016/0950-5849(88)90032-8 · Cited by 320
A practical framework for theabstract interpretation of logic programs
Bruynooghe, M. (1991) · The Journal of Logic Programming · doi:10.1016/0743-1066(91)80001-t · Cited by 243
Third International Conference on Logic Programming
(1986) · Lecture notes in computer science · doi:10.1007/3-540-16492-8 · Cited by 208
Abstract interpretation and optimising transformations for applicative programs
Mycroft, A. (1982) · ERA · doi:10.7488/era/4239 · Cited by 208
An application of abstract interpretation of logic programs: Occur check reduction
Søndergaard, H. (1986) · Lecture notes in computer science · doi:10.1007/3-540-16442-1_25 · Cited by 144
Abstract interpretation of Prolog programs
Mellish, C. (1986) · Lecture notes in computer science · doi:10.1007/3-540-16492-8_95 · Cited by 142
Automatic mode inference for logic programs
Debray, S., & Warren, D. S. (1988) · The Journal of Logic Programming · doi:10.1016/0743-1066(88)90010-6 · Cited by 135
Meta-programming in logic programming
Abramson, H., & Rogers, M. H. (1989) · Medical Entomology and Zoology · Cited by 119
AND-Parallelism of Logic Programs Based on a Static Data Dependency Analysis.
Chang, J.-H., Despain, A. M., & DeGroot, D. (1985) · COMPCON · Cited by 115
Proceedings of the 1990 North American conference on Logic programming
Debray, S., & Hermenegildo, M. V. (1990) · Cited by 114
A semantics-based framework for the abstract interpretation of Prolog
Jones, N., & Søndergaard, H. (1987) · Cited by 101
Higher-order strictness analysis in untyped lambda calculus
Hudak, P., & Young, J. M. (1986) · ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (POPL) · doi:10.1145/512644.512653 · Cited by 85
Abstract interpretation: towards the global optimisation of PROLOG programs
Bruynooghe, M., Janssens, G., Callebaut, A., et al. (1987) · Lirias · Cited by 83
Bottom-up Abstract Interpretation of Logic Programs.
Marriott, K., & Søndergaard, H. (1988) · Cited by 74
Proceedings of the European Symposium on Programming
Robinet, B. J., & Wilhelm, R. (1986) · Cited by 72
Abstract Interpretation: Towards the Global Optimization of Prolog Programs.
Bruynooghe, M., Janssens, G., Callebaut, A., et al. (1987) · SLP · Cited by 69
The occur-check problem in Prolog
Plaisted, D. A. (1984) · New Generation Computing · doi:10.1007/bf03037324 · Cited by 65
Specialisation of Prolog and FCP programs using abstract interpretation
Gallagher, J. P., Codish, M., & Shapiro, E. Y. (1988) · New Generation Computing · doi:10.1007/bf03037136 · Cited by 58
Proceedings of the 1997 international symposium on Logic programming
Ramakrishnan, I. V., Swift, T., & Małuszyński, J. (1997) · International Conference on Logic Programming · Cited by 48
A Semantic Model of Reference Counting and its Abstraction
Hudak, P. (1986) · Cited by 37
O’Keefe, R. A. (1987) · Cited by 33
Analysis of shared data structures for compile-time garbage collection in logic programs
Mulkers, A., Winsborough, W. H., & Bruynooghe, M. (1990) · Lirias · Cited by 31
Self-citationPath-Dependent Reachability Analysis for Multiple Specialization.
Winsborough, W. H. (1989) · Cited by 22
Self-citationAutomatic generation of mode declarations for PROLOG programs
Mellish, C. S., & Intelligence, E. U. (. D. O. A. (1981) · OpenGrey (Institut de l'Information Scientifique et Technique) · Cited by 21
Studies in Prolog architectures
Tick, E. (1987) · Cited by 20
Using safe approximations of fixed points for analysis of logic programs
Gallagher, J. P., Codish, M., & Shapiro, E. Y. (1989) · Cited by 9
A Minimal Function Graph Semantics for Logic Programs
Winsborough, W. (1987) · Minds at UW (University of Wisconsin) · Cited by 6
Self-citationUsing Safe Approximations of Fixed Points for Analysis of Logic Programs.
Codish, M., Gallagher, J. P., & Shapiro, E. Y. (1988) · Cited by 4
Flagged first, then by citations
Cited by
Sorted by citations
Abstract interpretation and application to logic programs
Cousot, P., & Cousot, R. (1992) · The Journal of Logic Programming · doi:10.1016/0743-1066(92)90030-7 · Cited by 582
Static analysis of logic programs for independent and parallelism
Jacobs, D., & Langen, A. (1992) · The Journal of Logic Programming · doi:10.1016/0743-1066(92)90034-z · Cited by 126
Experimental evaluation of a generic abstract interpretation algorithm for PROLOG
Charlier, B. L., & Hentenryck, P. V. (1994) · ACM Transactions on Programming Languages and Systems · doi:10.1145/174625.174627 · Cited by 123
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
Incremental analysis of constraint logic programs
Hermenegildo, M. V., Puebla, G., Marriott, K., et al. (2000) · ACM Transactions on Programming Languages and Systems · doi:10.1145/349214.349216 · Cited by 85
“Such analyzetransform cycles may occur for example when program optimization and multivariant specialization are combined [Winsborough 1992; Puebla and Hermenegildo 1995; 1999].”
Type analysis of prolog using type graphs
Hentenryck, P. V., Cortesi, A., & Charlier, B. L. (1995) · The Journal of Logic Programming · doi:10.1016/0743-1066(94)00021-w · Cited by 75
The CIAO Multi-Dialect Compiler and System: An Experimentation Workbench for Future (C)LP Systems
Hermenegildo, M. V., Bueno, F., Cabeza, D., et al. (1995) · Hispana · Cited by 52
Global analysis of standard Prolog programs
Bueno, F., Cabeza, D., Hermenegildo, M. V., et al. (1996) · Lecture notes in computer science · doi:10.1007/3-540-61055-3_32 · Cited by 49
“However, if program múltiple specialization [29, 25, 26] is done, a non-optimized versión of the program should exist (since all the predicates in the program must be prepared to receive any input valué), but other optimized versions could be inferred.”
BackgroundAbstract multiple specialization and its application to program parallelization
Puebla, G., & Hermenegildo, M. V. (1999) · The Journal of Logic Programming · doi:10.1016/s0743-1066(99)00031-x · Cited by 49
“Another possibility, as in [61, 51] and which is the one we adopt, is to determine at compile-time the appropriate versión to use at each cali.”
BackgroundMethodInfluentialHentenryck, P. V., Cortesi, A., & Charlier, B. L. (1995) · The Journal of Logic Programming · doi:10.1016/0743-1066(94)00029-6 · Cited by 45
“The framework is close to the work of Marriott and Sondergaard [28] and Winsborough [ 40 ].”
ResultCortesi, A., Charlier, B. L., & Hentenryck, P. V. (2000) · Science of Computer Programming · doi:10.1016/s0167-6423(99)00045-3 · Cited by 39
Advanced Techniques for Logic Program Specialisation
Leuschel, M. (1997) · Lirias · Cited by 35
Abstract interpretation of logic programs
Cortesi, A., & Filé, G. (1991) · doi:10.1145/115865.115872 · Cited by 35
A Model for Inter-module Analysis and Optimizing Compilation
Bueno, F., Hermenegildo, M. V., Puebla, G., et al. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45142-0_6 · Cited by 29
Improved Compilation of Prolog to C Using Moded Types and Determinism Information
Morales, J. F., Carro, M., & Hermenegildo, M. V. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24836-1_7 · Cited by 28
“Opportunities for optimizations: Code optimization can be applied at the Prolog level [18,19], to WAM code [20], to lower-level code [21], and/or to native code [8,22].”
MethodType analysis of Prolog using type graphs
Hentenryck, P. V., Cortesi, A., & Charlier, B. L. (1994) · Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/178243.178479 · Cited by 25
Englebert, V., Charlier, B. L., Roland, D., et al. (1993) · Software Practice and Experience · doi:10.1002/spe.4380230406 · Cited by 25
“'^ types,16 o c ~ u r - c h e c k , ~ ~ garbage collection,ls static detection of parallel-ism19 and program specialization,20 to name a few.”
BackgroundAn integration of partial evaluation in a generic abstract interpretation framework
Puebla, G., Hermenegildo, M. V., & Gallagher, J. P. (1999) · Bristol Research (University of Bristol) · Cited by 22
Some Issues in Analysis and Specialization of Modular Ciao-Prolog Programs
Puebla, G., & Hermenegildo, M. V. (2000) · Electronic Notes in Theoretical Computer Science · doi:10.1016/s1571-0661(05)80637-1 · Cited by 22
“Though much of the discussion we present could apply to other kinds of specialization, we will focus on abstract multiple specialization [13,9,2,25,21,15,23] a technique which directly uses the results of global analysis in order to optimize the program introducing multivariant specialization if…”
The impact of granularity in abstract interpretation of Prolog
Hentenryck, P. V., Degimbe, O., Charlier, B. L., et al. (1993) · Lecture notes in computer science · doi:10.1007/3-540-57264-3_25 · Cited by 18
“- It is the finest granularity defined in this paper and is obviously appropriate for multiple specializations [37].”
BackgroundImplementation of multiple specialization in logic programs
Puebla, G., & Hermenegildo, M. (1995) · Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation - PEPM '95 · doi:10.1145/215465.215561 · Cited by 31
“Winsborough [34] presents an algorithm, based on the notion of minimal function graphs [21], that solves the two problems outlined above.”
Charlier, B. L., Degimbe, O., Michel, L. D., et al. (1993) · Lecture notes in computer science · doi:10.1007/3-540-57264-3_26 · Cited by 15
Abstract specialization and its application to program parallelization
Puebla, G., & Hermenegildo, M. V. (1997) · Lecture notes in computer science · doi:10.1007/3-540-62718-9_10 · Cited by 15
“This can be overcome by means of program multiple specialization JLW90, GH91, Bru91, Win92] (the counterpart of polyvariant specialization Bul84]), where a di(cid:11)erent version of a predicate is generated for each use, so that each one of them is optimized for the particular subset of input…”
Abstract specialization and its applications
Puebla, G., & Hermenegildo, M. V. (2003) · doi:10.1145/777388.777393 · Cited by 14
“The first complete framework for múltiple specialization based on abstract interpretation is presented in [51].”
BackgroundAbstract interpretation of logic programs
Cortesi, A., & Filé, G. (1991) · ACM SIGPLAN Notices · doi:10.1145/115866.115872 · Cited by 14
Higher-order chaotic iteration sequences
Rosendahl, M. (1993) · Lecture notes in computer science · doi:10.1007/3-540-57186-8_89 · Cited by 13
“The result of the simple iteration sequence with spurious calls is called the partial function graph in [5] and [16].”
BackgroundMethodSequence-based abstract interpretation of Prolog
Charlier, B. L., Rossi, S., & Hentenryck, P. V. (2001) · Theory and Practice of Logic Programming · doi:10.1017/s1471068402001114 · Cited by 13
Proceedings of the 13th International Workshop on Logic Programming Environments
Mesnard, F., & Serebrenik, A. (2003) · Lirias · Cited by 12
Abstract Interpretation for (Constraint) Logic Programming
Bruynooghe, M., & Boulanger, D. (1994) · NATO ASI series. Series F : Computer and system sciences · doi:10.1007/978-3-642-85983-0_9 · Cited by 11
Optimizing compilation of CLP( ℛ )
Kelly, A. D., Marriott, K., Macdonald, A., et al. (1998) · ACM Transactions on Programming Languages and Systems · doi:10.1145/295656.295661 · Cited by 11
“Our results also demonstrate the usefulness of multivariant specialization [Winsborough 1992].”
ResultInference of Termination Conditions for Numerical Loops in Prolog
Serebrenik, A., & Schreye, D. D. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45653-8_45 · Cited by 10
Inference of termination conditions for numerical loops in Prolog
Serebrenik, A., & Schreye, D. D. (2004) · Theory and Practice of Logic Programming · doi:10.1017/s1471068404002042 · Cited by 12
Constraint specialisation in Horn clause verification
Kafle, B., & Gallagher, J. P. (2017) · Science of Computer Programming · doi:10.1016/j.scico.2017.01.002 · Cited by 9
Compile-time memory reuse in logic programming languages through update in place
Gudjónsson, G., & Winsborough, W. H. (1999) · ACM Transactions on Programming Languages and Systems · doi:10.1145/319301.319309 · Cited by 9
“To enable transformation, it is necessary to perform multiple specialization [Winsborough 1992].”
BackgroundMethodInfluentialSelf-citationTermination of Floating-Point Computations
Serebrenik, A., & Schreye, D. D. (2005) · Journal of Automated Reasoning · doi:10.1007/s10817-005-6546-z · Cited by 8
“The adorning process can be regarded as similar to multiple specialisation (Puebla and Hermenegildo, 1999; Winsborough, 1992).”
BackgroundMethodInfluentialSánchez, A. G. P., Gallagher, J. P., & Hermenegildo, M. V. (1997) · Cited by 8
Call pattern analysis for functional logic programs
Hanus, M. (2008) · doi:10.1145/1389449.1389459 · Cited by 8
“Minimal function graphs have been also used to optimize logic programs (e.g., (Gallagher and Bruynooghe 1991; Winsborough 1992)).”
InfluentialTermination Analysis of Logic Programs
Serebrenik, A. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-24599-5_45 · Cited by 8
“Observe that the transformation we performed is a form of multiple specialisation, wellknown in the context of abstract interpretation (Winsborough, 1992).”
BackgroundOn Termination of Logic Programs with Floating Point Computations
Serebrenik, A., & Schreye, D. D. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45789-5_13 · Cited by 8
“[28]), that are called adornments and the program transformation is called adorning.”
BackgroundEnglebert, V., Charlier, B. L., Roland, D., et al. (1992) · Lecture notes in computer science · doi:10.1007/3-540-55844-6_144 · Cited by 8
Experiments with a Convex Polyhedral Analysis Tool for Logic ProgramsPreprint
Henriksen, K. S., Banda, G., & Gallagher, J. P. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.0712.2737 · Cited by 7
“A semantics-based approach based on Winsborough’s multiple specialisation technique [30] would work in some case, though not in the one above.”
MethodOn the Design of Generic Abstract Interpretation Frameworks.
Charlier, B. L., & Hentenryck, P. V. (1992) · WSA · Cited by 6
Proving Termination with Adornments
Serebrenik, A., & Schreye, D. D. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-25938-1_10 · Cited by 6
“It should be noted that the transformation we performed can be seen as a form of multiple specialisation [8].”
BackgroundOn Termination of Binary CLP Programs
Serebrenik, A., & Fred Mesnard, B. (2005) · Lecture notes in computer science · doi:10.1007/11506676_15 · Cited by 5
“This technique can be seen as a variant of multiple specialisation [18].”
Ramachandran, V., & Hentenryck, P. V. (1995) · Lecture notes in computer science · doi:10.1007/3-540-60360-3_48 · Cited by 5
“It is thus close to the work of Marriott and S(cid:28)ndergaard 15, 16], Winsborough [23].”
Removing Superfluous Versions in Polyvariant Specialization of Prolog Programs
Ochoa, C., Puebla, G., & Hermenegildo, M. V. (2006) · Lecture notes in computer science · doi:10.1007/11680093_6 · Cited by 4
“The problem of superfluous polyvariance has been studied both in the context of abstract múltiple specialization [18,16] and in the context of partial evaluation of normal logic programs [9].”
BackgroundType analysis of Prolog using type graphs
Hentenryck, P. V., Cortesi, A., & Charlier, B. L. (1994) · ACM SIGPLAN Notices · doi:10.1145/773473.178479 · Cited by 3
Precise goal-independent abstract interpretation of constraint logic programs
Schachte, P. (2003) · Theoretical Computer Science · doi:10.1016/s0304-3975(02)00614-x · Cited by 2
“Winsborough [23] presents another goal-dependent analysis framework, using a minimal function graph semantics.”
MethodImproving the efficiency of constraint logic programming languages by deriving specialized versions
Bruynooghe, M., Dumortier, V., & Janssens, G. (2005) · Springer eBooks · doi:10.1007/bfb0013540 · Cited by 2
“To further close the gap, some authors have proposed to generate different versions - corresponding to different patterns of usage - for the same predicate [1, 8, 11 ], e.g.”
BackgroundAbstract specialization and its applications
Puebla, G., & Hermenegildo, M. V. (2003) · ACM SIGPLAN Notices · doi:10.1145/966049.777393 · Cited by 2
Specialization and optimization of constraint programs with dynamic scheduling
Sánchez, A. G. P., & Hermenegildo, M. V. (1995) · Hispana · Cited by 2
Mode Analysis During Program Development
Marakakis, E., & Kondylakis, H. (2015) · International Journal of Artificial Intelligence Tools · doi:10.1142/s0218213016500019 · Cited by 1
Data-Flow analysis of prolog programs with extra-logical features
Carrillo, F. B., Gras, D., Hermenegildo, M. V., et al. (1995) · Cited by 1
Optimizing threads of computation in constraint logic programs
Soundarajan, N., & Pippin, W. E. (2003) · Cited by 1
Improving the compilation of prolog to C using type and determinism information: Preliminary results
Caballero, J. F. M., Liñares, M. C., & Hermenegildo, M. V. (2003) · Cited by 1
Poly-controlled partial evaluation and its application to resource-aware program specialization
Ochoa, C. (2007) · doi:10.20868/upm.thesis.329
“The problem of superfluous polyvariance has been tackled in the context of abstract multiple specialization in [130, 108], and in the context of partial evaluation of normal logic programs in [84].”
BackgroundTécnicas avanzadas de compilación para programación lógica
Caballero, J. F. M. (2010) · Dialnet (Universidad de la Rioja)
Towards a Broader Theory for Abstract Interpretation
Musumbu, K. (1995) · Springer eBooks · doi:10.1007/978-94-011-7108-3_12
On Abstracting the Procedural Behaviour of Logic Programs.
Janssens, G., & Bruynooghe, M. (1991)
Components for automatic horn clause verification
Kafle, B. (2016) · RUCforsk (Roskilde University)
Cabezas, D. (2004) · Dialnet (Universidad de la Rioja)
Notion of Semantics in Computer Science - A Systematic Literature Review
Gollapudi, S., & Choppella, V. (2017) · International conference natural language processing
Análisis del diseño de lenguajes de programación y su impacto en la calidad del software
Rosado, G. A. H. (2025) · CognitivaTech Ingeniería de Software Inteligente y Sistemas Adaptativos · doi:10.63688/cognitivatech.v2.i1.22
Metadata
- Authors
- Winsborough, W.
- Corresponding author
- Winsborough, Will
- Venue
- The Journal of Logic Programming
- Publisher
- Elsevier BV
- Published
- 1992-07
- Volume
- 13
- Issue
- 2-3
- Pages
- 259-290
- ISSN
- 0743-1066 (ISSN-L)
- OpenAlex
- W2074516823
- Semantic Scholar
- 058278368b2ea368521a99a1e4a37e0d05004572
- Cited by
- 63
- References
- 31
- Citations by year
- 2025: 1 · 2017: 2 · 2016: 1 · 2015: 1
- FWCI
- 8.92
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Licence
- Locations
- The Journal of Logic Programming (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Software › Logic, programming, and type systems
- Physical Sciences › Computer Science › Software › Model-Driven Software Engineering Techniques
- Physical Sciences › Computer Science › Computational Theory and Mathematics › semigroups and automata theory
- Keywords
- deterministic finite automata, interprocedural analysis, code expansion, optimizing compilers
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
