Foundations of deductive databases and logic programming
The CLP( R ) language and system
ACM Transactions on Programming Languages and Systems (TOPLAS)
A hierarchy of constraint systems for data-flow analysis of constraint logic-based languages
Science of Computer Programming - Special issue on concurrent constraint programming
Science of Computer Programming
Set-sharing is redundant for pair-sharing
Theoretical Computer Science
PPDP '99 Proceedings of the International Conference PPDP'99 on Principles and Practice of Declarative Programming
Comparing the Galois Connection and Widening/Narrowing Approaches to Abstract Interpretation
PLILP '92 Proceedings of the 4th International Symposium on Programming Language Implementation and Logic Programming
Conceptual and Software Support for Abstract Domain Design: Generic Structural Domain and Open Product
Efficient structural information analysis for real CLP languages
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
Boolean Functions for Finite-Tree Dependencies
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Pos(T): Analyzing Dependencies in Typed Logic Programs
PSI '02 Revised Papers from the 4th International Andrei Ershov Memorial Conference on Perspectives of System Informatics: Akademgorodok, Novosibirsk, Russia
Finite-Tree Analysis for Constraint Logic-Based Languages
SAS '01 Proceedings of the 8th International Symposium on Static Analysis
Finite-tree analysis for constraint logic-based languages
Information and Computation
Efficient structural information analysis for real CLP languages
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
| Hi-index | 0.00 |
We present the rational construction of a generic domain for structural information analysis of CLP languages called Pattern(D #), where the parameter D # is an abstract domain satisfying certain properties. Our domain builds on the parameterized domain for the analysis of logic programs Pat R, which is due to Cortesi et al. However, the formalization of our CLP abstract domain is independent from specific implementation techniques: Pat R (suitably extended in order to deal with CLP systems omitting the occur-check) is one of the possible implementations. Reasoning at a higher level of abstraction we are able to appeal to familiar notions of unification theory. This higher level of abstraction also gives considerable more latitude for the implementer. Indeed, as demonstrated by the results summarized here, an analyzer that incorporates structural information analysis based on our approach can be highly competitive both from the precision and, contrary to popular belief, from the efficiency point of view.