POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Proofs and types
Topology via logic
The semantic foundations of concurrent constraint programming
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A practical framework for the abstract interpretation of logic programs
Journal of Logic Programming
On derived dependencies and connected databases
Journal of Logic Programming
Handbook of theoretical computer science (vol. B)
Abstract interpretation and application to logic programs
Journal of Logic Programming
Static analysis of logic programs for independent and parallelism
Journal of Logic Programming
A general framework for semantics-based bottom-up abstract interpretation of logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Completeness and predicate-based abstract interpretation
PEPM '93 Proceedings of the 1993 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Automatic generation and management of interprocedural program analyses
POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Precise and efficient groundness analysis for logic programs
ACM Letters on Programming Languages and Systems (LOPLAS)
Bottom-up abstract interpretation of logic programs
Theoretical Computer Science
Deriving algorithms from type inference systems: application to strictness analysis
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Combinations of abstract domains for logic programming
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Improving abstract interpretations by systematic lifting to the powerset
ILPS '94 Proceedings of the 1994 International Symposium on Logic programming
Improving abstract interpretations by combining domains
ACM Transactions on Programming Languages and Systems (TOPLAS)
Combining analyses, combining optimizations
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM Computing Surveys (CSUR)
A unifying view of abstract domain design
ACM Computing Surveys (CSUR)
Complementation in abstract interpretation
ACM Transactions on Programming Languages and Systems (TOPLAS)
Abstract interpretation of reactive systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
The reduced relative power operation on abstract domains
Theoretical Computer Science
The powerset operator on abstract interpretations
Theoretical Computer Science
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Systematic design of program analysis frameworks
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Compositional Optimization of Disjunctive Abstract Interpretations
ESOP '96 Proceedings of the 6th European Symposium on Programming Languages and Systems
Strictness Logic and Polymorphic Invariance
TVER '92 Proceedings of the Second International Symposium on Logical Foundations of Computer Science
Complete Abstract Interpretations Made Constructive
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
Completeness in Abstract Interpretation: A Domain Perspective
AMAST '97 Proceedings of the 6th International Conference on Algebraic Methodology and Software Technology
Strong Abstract Interpretation Using Power Domains (Extended Abstract)
Proceedings of the 10th Colloquium on Automata, Languages and Programming
Refining and Compressing Abstract Domains
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
An Abstract Interpretation Scheme for Groundedness, Freeness, and Sharing Analysis of Logic Programs
Proceedings of the 12th Conference on Foundations of Software Technology and Theoretical Computer Science
Directional Type Checking of Logic Programs
SAS '94 Proceedings of the First International Static Analysis Symposium on Static Analysis
Logical Optimality of Groundness Analysis
SAS '97 Proceedings of the 4th International Symposium on Static Analysis
Non pair-sharing and freeness analysis through linear refinement
PEPM '00 Proceedings of the 2000 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation
Compositionality in the puzzle of semantics
PEPM '02 Proceedings of the 2002 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation
Logical optimality of groundness analysis
Theoretical Computer Science
Abstract Domains for Universal and Existential Properties
ESOP '00 Proceedings of the 9th European Symposium on Programming Languages and Systems
Positive Boolean Functions as Multiheaded Clauses
Proceedings of the 17th International Conference on Logic Programming
Inferring Termination Conditions for Logic Programs Using Backwards Analysis
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Domain Compression for Complete Abstractions
VMCAI 2003 Proceedings of the 4th International Conference on Verification, Model Checking, and Abstract Interpretation
Freeness Analysis Through Linear Refinement
SAS '99 Proceedings of the 6th International Symposium on Static Analysis
Pair-independence and freeness analysis through linear refinement
Information and Computation
Non-Standard Semantics for Program Slicing
Higher-Order and Symbolic Computation
Inferring termination conditions for logic programs using backwards analysis
Theory and Practice of Logic Programming
Making abstract domains condensing
ACM Transactions on Computational Logic (TOCL)
Transforming semantics by abstract interpretation
Theoretical Computer Science
A backward analysis for constraint logic programs
Theory and Practice of Logic Programming
Deriving escape analysis by abstract interpretation
Higher-Order and Symbolic Computation
Goal-directed weakening of abstract interpretation results
ACM Transactions on Programming Languages and Systems (TOPLAS)
Optimality and condensing of information flow through linear refinement
Theoretical Computer Science
Inferring non-suspension conditions for logic programs with dynamic scheduling
ACM Transactions on Computational Logic (TOCL)
Transforming Abstract Interpretations by Abstract Interpretation
SAS '08 Proceedings of the 15th international symposium on Static Analysis
Decomposing bytecode verification by abstract interpretation
ACM Transactions on Programming Languages and Systems (TOPLAS)
Goal-independent suspension analysis for logic programs with dynamic scheduling
ESOP'03 Proceedings of the 12th European conference on Programming
Static analysis, abstract interpretation and verification in (constraint logic) programming
A 25-year perspective on logic programming
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
A relational abstraction for functions
SAS'05 Proceedings of the 12th international conference on Static Analysis
Information flow is linear refinement of constancy
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
| Hi-index | 0.00 |
In this article we introduce the notion of Heyting completion in abstract interpretation. We prove that Heyting completion provides a model for Cousot's reduced cardinal power of abstract domains and that it supplies a logical basis to specify relational domains for program analysis and abstract interpretation. We study the algebraic properties of Heyting completion in relation with other well-known domain transformers, like reduced product and disjunctive completion. This provides a uniform algebraic setting where complex abstract domains can be specified by simple logic formulas, or as solutions of recursive abstract domain equations, involving few basic operations for domain construction, all characterized by a clean logical interpretation. We apply our framework to characterize directionality and condensing and in downward closed analysis of (constraint) logic programs.