Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Foundations of deductive databases and logic programming
A practical framework for the abstract interpretation of logic programs
Journal of Logic Programming
A type system for logic program
Journal of Logic Programming
Handbook of theoretical computer science (vol. B)
Partial evaluation in logic programming
Journal of Logic Programming
Abstract interpretation and application to logic programs
Journal of Logic Programming
Global flow analysis as a practical compilation tool
Journal of Logic Programming
Partial evaluation and automatic program generation
Partial evaluation and automatic program generation
Tutorial on specialisation of logic programs
PEPM '93 Proceedings of the 1993 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Parameterized partial evaluation
ACM Transactions on Programming Languages and Systems (TOPLAS)
Fast and precise regular approximations of logic programs
Proceedings of the eleventh international conference on Logic programming
Controlling generalization and polyvariance in partial deduction of normal logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Program specialisation and abstract interpretation reconciled
JICSLP'98 Proceedings of the 1998 joint international conference and symposium on Logic programming
Using regular approximations for generalisation during partial evalution
PEPM '00 Proceedings of the 2000 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation
Model checking
Solving coverability problems of petri nets by partial deduction
Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming
Well-structured transition systems everywhere!
Theoretical Computer Science
Regular Tree Languages as an Abstract Domain in Program Specialisation
Higher-Order and Symbolic Computation
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
Partial Evaluation - Practice and Theory, DIKU 1998 International Summer School
PADL '02 Proceedings of the 4th International Symposium on Practical Aspects of Declarative Languages
Set-Based Analysis of Reactive Infinite-State Systems
TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Logic Program Specialisation: How To Be More Specific
PLILP '96 Proceedings of the 8th International Symposium on Programming Languages: Implementations, Logics, and Programs
Detecting Unsolvable Queries for Definite Logic Programs
PLILP '98/ALP '98 Proceedings of the 10th International Symposium on Principles of Declarative Programming
Logic Programming and Model Checking
PLILP '98/ALP '98 Proceedings of the 10th International Symposium on Principles of Declarative Programming
Constraint Logic Programming Applied to Model Checking
LOPSTR'99 Selected papers from the 9th International Workshop on Logic Programming Synthesis and Transformation
Infinite State Model Checking by Abstract Interpretation and Program Specialisation
LOPSTR'99 Selected papers from the 9th International Workshop on Logic Programming Synthesis and Transformation
Conjunctive Partial Deduction in Practice
LOPSTR '96 Proceedings of the 6th International Workshop on Logic Programming Synthesis and Transformation
Verification of Infinite-State Systems by Specialization of CLP Programs
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Constraint Logic Programming for Local and Symbolic Model-Checking
CL '00 Proceedings of the First International Conference on Computational Logic
Coverability of Reset Petri Nets and Other Well-Structured Transition Systems by Partial Deduction
CL '00 Proceedings of the First International Conference on Computational Logic
Efficient Model Checking Using Tabled Resolution
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
The Applicability of Logic Program Analysis and Transformation to Theorem Proving
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
Combining Abstract Interpretation and Partial Evaluation (Brief Overview)
SAS '97 Proceedings of the 4th International Symposium on Static Analysis
A Bottom-Up Analysis Toolkit
Logic program specialisation through partial deduction: Control issues
Theory and Practice of Logic Programming
Efficient Real-Time Model Checking Using Tabled Logic Programming and Constraints
ICLP '02 Proceedings of the 18th International Conference on Logic Programming
Abstract specialization and its applications
Proceedings of the 2003 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation
A framework for the integration of partial evaluation and abstract interpretation of logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
The Ecce and Logen partial evaluators and their web interfaces
Proceedings of the 2006 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Convex hull abstractions in specialization of CLP programs
LOPSTR'02 Proceedings of the 12th international conference on Logic based program synthesis and transformation
Abstract partial deduction challenged
LOPSTR'02 Proceedings of the 12th international conference on Logic based program synthesis and transformation
Abstract interpretation with specialized definitions
SAS'06 Proceedings of the 13th international conference on Static Analysis
| Hi-index | 0.00 |
We present an abstract partial deduction technique which uses regular types as its domain and which can handle conjunctions, and thus perform deforestation and tupling.We provide a detailed description of all the required operations and present an implementation within the ecce system. We discuss the power of this new specialisation algorithm, especially in the light of verifying and specialising infinite state process algebras. Here, our new algorithm can provide a more precise treatment of synchronisation and can be used for refinement checking.