Projections for strictness analysis
Proc. of a conference on Functional programming languages and computer architecture
On derived dependencies and connected databases
Journal of Logic Programming
Abstract interpretation and application to logic programs
Journal of Logic Programming
Static analysis of logic programs for independent and parallelism
Journal of Logic Programming
Inductive definitions, semantics and abstract interpretations
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
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)
An algebraic theory of observables
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)
A unifying view of abstract domain design
ACM Computing Surveys (CSUR)
A unified approach to global program optimization
POPL '73 Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages
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
Comparison of Abstract Interpretations
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
"Optimal" Collecting Semantics for Analysis in a Hierarchy of Logic Program Semantics
STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
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
The Theory and Practice of Transforming Call-by-need into Call-by-value
Proceedings of the Fourth 'Colloque International sur la Programmation' on International Symposium on Programming
Complementing Logic Program Semantics
ALP '96 Proceedings of the 5th International Conference on Algebraic and Logic Programming
Prime Factorizations of Abstract Domains Using First Order Logic
ALP '96 Proceedings of the 5th International Conference on Algebraic and Logic Programming
A logical model for relational abstract domains
ACM Transactions on Programming Languages and Systems (TOPLAS)
Sharing and groundness dependencies in logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Making abstract interpretations complete
Journal of the ACM (JACM)
A characterization of symmetric semantics by domain complementation
Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming
Compositionality in the puzzle of semantics
PEPM '02 Proceedings of the 2002 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation
Set-sharing is redundant for pair-sharing
Theoretical Computer Science
Pseudocomplements of closure operators on posets
Discrete Mathematics
Domain Compression for Complete Abstractions
VMCAI 2003 Proceedings of the 4th International Conference on Verification, Model Checking, and Abstract Interpretation
Decomposing Non-redundant Sharing by Complementation
SAS '99 Proceedings of the 6th International Symposium on Static Analysis
Parameterizing a Groundness Analysis of Logic Programs
SAS '01 Proceedings of the 8th International Symposium on Static Analysis
Abstract Interpretation Based Formal Methods and Future Challenges
Informatics - 10 Years Back. 10 Years Ahead.
Quotienting Share for Dependency Analysis
ESOP '99 Proceedings of the 8th European Symposium on Programming Languages and Systems
Transforming semantics by abstract interpretation
Theoretical Computer Science
Combining abstract interpreters
Proceedings of the 2006 ACM SIGPLAN conference on Programming language design and implementation
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
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)
Semantics-based code obfuscation by abstract interpretation
Journal of Computer Security
Precise set sharing analysis for Java-style programs
VMCAI'08 Proceedings of the 9th international conference on Verification, model checking, and abstract interpretation
Widening and narrowing operators for abstract interpretation
Computer Languages, Systems and Structures
Static analysis, abstract interpretation and verification in (constraint logic) programming
A 25-year perspective on logic programming
Semantic-based code obfuscation by abstract interpretation
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
| Hi-index | 0.00 |
Reduced product of abstract domains is a rather well-known operation for domain composition in abstract interpretation. In this article, we study its inverse operation, introducing a notion of domain complementation in abstract interpretation. Complementation provides as systematic way to design new abstract domains, and it allows to systematically decompose domains. Also, such an operation allows to simplify domain verification problems, and it yields space-saving representations for complex domains. We show that the complement exists in most coses, and we apply complementation to three well-know abstract domains, notably to Cousot and Cousot's interval domain for integer variable analysis, to Cousot and Cousot's domain for comportment analysis of functional languages, and to the domain Sharing for aliasing analysis of logic languages.