Countable nondeterminism and random assignment
Journal of the ACM (JACM)
Optimal run time optimization proved by a new look at abstract interpretations
The International Joint Conference on theory and practice of software development on TAPSOFT '87
Foundations of deductive databases and logic programming
Declarative modeling of the operational behavior of logic languages
Theoretical Computer Science
The benefits of global dataflow analysis for an optimizing Prolog compiler
Proceedings of the 1990 North American conference on 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
PLDI '92 Proceedings of the ACM SIGPLAN 1992 conference on Programming language design and implementation
Inductive definitions, semantics and abstract interpretations
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Global flow analysis as a practical compilation tool
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
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
Denotational abstract interpretation of logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Suspension analyses for concurrent logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Model checking and abstraction
ACM Transactions on Programming Languages and Systems (TOPLAS)
An algebraic theory of observables
ILPS '94 Proceedings of the 1994 International Symposium on Logic programming
On the complexity of dataflow analysis of logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Information Processing Letters - Special issue on the calculational method
Property preserving abstractions for the verification of concurrent systems
Formal Methods in System Design - Special issue on computer-aided verification (based on CAV'92 workshop)
Handbook of logic in computer science (vol. 3)
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)
Program analysis: the abstract interpretation perspective
ACM Computing Surveys (CSUR) - Special issue: position statements on strategic directions in computing research
Abstract interpretation of reactive systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
On the power and limitations of strictness analysis
Journal of the ACM (JACM)
Types as abstract interpretations
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On the complexity of escape analysis
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The quotient of an abstract interpretation
Theoretical Computer Science
Two classes of Boolean functions for dependency analysis
Science of Computer Programming
Optimal domains for disjunctive abstract interpretation
Science of Computer Programming - Special issue on the 6th European symposium on programming
The powerset operator on abstract interpretations
Theoretical Computer Science
Closures on CPOs form complete lattices
Information and Computation
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Constructive design of a hierarchy of semantics of a transition system by abstract interpretation
Theoretical Computer Science
Systematic design of program analysis frameworks
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Optimal Data Flow Analysis via Observational Equivalence
MFCS '89 Proceedings on Mathematical Foundations of Computer Science 1989
Complete Abstract Interpretations Made Constructive
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
Abstract Interpretation of Algebraic Polynomial Systems (Extended Abstract)
AMAST '97 Proceedings of the 6th International Conference on Algebraic Methodology and Software Technology
Refining and Compressing Abstract Domains
ICALP '97 Proceedings of the 24th 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
TAPSOFT '95 Proceedings of the 6th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Testing-Based Abstractions for Value-Passing Systems
CONCUR '94 Proceedings of the Concurrency Theory
Galois Connection Based Abstract Interpretations for Strictness Analysis (Invited Paper)
Proceedings of the International Conference on Formal Methods in Programming and Their Applications
Abstract Interpretation of the pi-Calculus
Selected papers from the 5th LOMAPS Workshop on Analysis and Verification of Multiple-Agent Languages
Optimality in Abstractions of Model Checking
SAS '95 Proceedings of the Second International Symposium on Static Analysis
System F and Abstract Interpretation
SAS '95 Proceedings of the Second International Symposium on Static Analysis
Set-Sharing is Redundant for Pair-Sharing
SAS '97 Proceedings of the 4th International Symposium on Static Analysis
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
Proceedings of the 7th International Conference on Computer Aided Verification
Journal of Functional Programming
Distributed Computing - Special issue: Verification of lazy caching
Deriving specialized program analyses for certifying component-client conformance
PLDI '02 Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation
Abstract Domains for Universal and Existential Properties
ESOP '00 Proceedings of the 9th European Symposium on Programming Languages and Systems
On the Completeness of Model Checking
ESOP '01 Proceedings of the 10th European Symposium on Programming Languages and Systems
Partial Completeness of Abstract Fixpoint Checking
SARA '02 Proceedings of the 4th International Symposium on Abstraction, Reformulation, and Approximation
An Algebraic Framework for Abstract Model Checking
Proceedings of the 5th International Symposium on Abstraction, Reformulation and Approximation
Domain Compression for Complete Abstractions
VMCAI 2003 Proceedings of the 4th International Conference on Verification, Model Checking, and Abstract Interpretation
Software Model Checking with Abstraction Refinement
VMCAI 2003 Proceedings of the 4th International Conference on Verification, Model Checking, and Abstract Interpretation
Property Checking Driven Abstract Interpretation-Based Static Analysis
VMCAI 2003 Proceedings of the 4th International Conference on Verification, Model Checking, and Abstract Interpretation
Making Abstract Model Checking Strongly Preserving
SAS '02 Proceedings of the 9th International Symposium on Static Analysis
Incompleteness, Counterexamples, and Refinements in Abstract Model-Checking
SAS '01 Proceedings of the 8th International Symposium on Static Analysis
States vs. Traces in Model Checking by Abstract Interpretation
SAS '02 Proceedings of the 9th International Symposium on Static Analysis
Refinement of LTL Formulas for Abstract Model Checking
SAS '02 Proceedings of the 9th International Symposium on Static Analysis
Abstract Interpretation Based Formal Methods and Future Challenges
Informatics - 10 Years Back. 10 Years Ahead.
Modular Static Program Analysis
CC '02 Proceedings of the 11th International Conference on Compiler Construction
Mechanical Abstraction of CSPZ Processes
FME '02 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods - Getting IT Right
On Abstraction in Software Verification
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Boolean and Cartesian Abstraction for Model Checking C Programs
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Abstract non-interference: parameterizing non-interference by abstract interpretation
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Making abstract domains condensing
ACM Transactions on Computational Logic (TOCL)
Control Code Obfuscation by Abstract Interpretation
SEFM '05 Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods
On flow-sensitive security types
Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Typestate verification: abstraction techniques and complexity results
Science of Computer Programming - Special issue: Static analysis symposium (SAS 2003)
A semantic framework for the abstract model checking of tccp programs
Theoretical Computer Science - Quantitative aspects of programming languages (QAPL 2004)
Combining abstract interpreters
Proceedings of the 2006 ACM SIGPLAN conference on Programming language design and implementation
Imcompleteness of States w.r.t traces in model Checking
Information and Computation
A calculus of logical relations for over- and underapproximating static analyses
Science of Computer Programming
Abstract interpretation of combinational asynchronous circuits
Science of Computer Programming
What You Lose is What You Leak: Information Leakage in Declassification Policies
Electronic Notes in Theoretical Computer Science (ENTCS)
Extracting Program Logics From Abstract Interpretations Defined by Logical Relations
Electronic Notes in Theoretical Computer Science (ENTCS)
Goal-directed weakening of abstract interpretation results
ACM Transactions on Programming Languages and Systems (TOPLAS)
Data dependencies and program slicing: from syntax to abstract semantics
PEPM '08 Proceedings of the 2008 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Generalizing the Paige--Tarjan algorithm by abstract interpretation
Information and Computation
Program Verification by Using DISCOVERER
Verified Software: Theories, Tools, Experiments
Transforming Abstract Interpretations by Abstract Interpretation
SAS '08 Proceedings of the 15th international symposium on Static Analysis
Conflict Analysis of Programs with Procedures, Dynamic Thread Creation, and Monitors
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)
3-Valued abstraction: More precision at less cost
Information and Computation
Observational Completeness on Abstract Interpretation
WoLLIC '09 Proceedings of the 16th International Workshop on Logic, Language, Information and Computation
Abstract Interpretation From a Denotational-semantics Perspective
Electronic Notes in Theoretical Computer Science (ENTCS)
Control-flow analysis of function calls and returns by abstract interpretation
Proceedings of the 14th ACM SIGPLAN international conference on Functional programming
Abstract Interpretation from a Topological Perspective
SAS '09 Proceedings of the 16th International Symposium on Static Analysis
Optimality in goal-dependent analysis of sharing
Theory and Practice of Logic Programming
Semantics-based code obfuscation by abstract interpretation
Journal of Computer Security
An Approach to Behavioral Subtyping Based on Static Analysis
Electronic Notes in Theoretical Computer Science (ENTCS)
Incompleteness of states w.r.t. traces in model checking
Information and Computation
Formal Methods in System Design
Typestate verification: abstraction techniques and complexity results
SAS'03 Proceedings of the 10th international conference on Static analysis
Using abstract interpretation to add type checking for interfaces in Java bytecode verification
Theoretical Computer Science
Using abstract interpretation to add type checking for interfaces in Java bytecode verification
Theoretical Computer Science
Deriving bisimulations by simplifying partitions
VMCAI'08 Proceedings of the 9th international conference on Verification, model checking, and abstract interpretation
Internal and external logics of abstract interpretations
VMCAI'08 Proceedings of the 9th international conference on Verification, model checking, and abstract interpretation
Adjoining classified and unclassified information by abstract interpretation
Journal of Computer Security
Dependence condition graph for semantics-based abstract program slicing
Proceedings of the Tenth Workshop on Language Descriptions, Tools and Applications
Static analysis, abstract interpretation and verification in (constraint logic) programming
A 25-year perspective on logic programming
Example-guided abstraction simplification
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Modelling metamorphism by abstract interpretation
SAS'10 Proceedings of the 17th international conference on Static analysis
Thread-modular counterexample-guided abstraction refinement
SAS'10 Proceedings of the 17th international conference on Static analysis
Cooperative query answering by abstract interpretation
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Underapproximating predicate transformers
SAS'06 Proceedings of the 13th international conference on Static Analysis
An abstract interpretation perspective on linear vs. branching time
APLAS'05 Proceedings of the Third Asian conference on Programming Languages and Systems
Timed abstract non-interference
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
Obfuscation by partial evaluation of distorted interpreters
PEPM '12 Proceedings of the ACM SIGPLAN 2012 workshop on Partial evaluation and program manipulation
Semantic-based code obfuscation by abstract interpretation
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
A theory of predicate-complete test coverage and generation
FMCO'04 Proceedings of the Third international conference on Formal Methods for Components and Objects
Abstract interpretation-based protection
VMCAI'10 Proceedings of the 11th international conference on Verification, Model Checking, and Abstract Interpretation
VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
Control-flow analysis of function calls and returns by abstract interpretation
Information and Computation
Modelling declassification policies using abstract domain completeness
Mathematical Structures in Computer Science - Programming Language Interference and Dependence
An abstract interpretation-based refinement algorithm for strong preservation
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Adjoining declassification and attack models by abstract interpretation
ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
Strong preservation of temporal fixpoint-based operators by abstract interpretation
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
Abstraction refinement via inductive learning
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
SAS'05 Proceedings of the 12th international conference on Static Analysis
The PER model of abstract non-interference
SAS'05 Proceedings of the 12th international conference on Static Analysis
Understanding the origin of alarms in ASTRÉE
SAS'05 Proceedings of the 12th international conference on Static Analysis
Opaque predicates detection by abstract interpretation
AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology
Comparing completeness properties of static analyses and their logics
APLAS'06 Proceedings of the 4th Asian conference on Programming Languages and Systems
Propositional interpolation and abstract interpretation
ESOP'10 Proceedings of the 19th European conference on Programming Languages and Systems
On the strength of owicki-gries for resources
APLAS'11 Proceedings of the 9th Asian conference on Programming Languages and Systems
Inverse-limit and topological aspects of abstract interpretation
Theoretical Computer Science
Abstract interpretation of database query languages
Computer Languages, Systems and Structures
An Abstract Interpretation framework for genotype elimination algorithms
Theoretical Computer Science
Observational Completeness on Abstract Interpretation
Fundamenta Informaticae - Logic, Language, Information and Computation
Making abstract interpretation incomplete: modeling the potency of obfuscation
SAS'12 Proceedings of the 19th international conference on Static Analysis
Deriving a complete type inference for hindley-milner and vector sizes using expansion
PEPM '13 Proceedings of the ACM SIGPLAN 2013 workshop on Partial evaluation and program manipulation
A formal framework for property-driven obfuscation strategies
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Hi-index | 0.01 |
Completeness is an ideal, although uncommon, feature of abstract interpretations, formalizing the intuition that, relatively to the properties encoded by the underlying abstract domains, there is no loss of information accumulated in abstract computations. Thus, complete abstract interpretations can be rightly understood as optimal. We deal with both pointwise completeness, involving generic semantic operations, and (least) fixpoint completeness. Completeness and fixpoint completeness are shown to be properties that depend on the underlying abstract domains only. Our primary goal is then to solve the problem of making abstract interpretations complete by minimally extending or restricting the underlying abstract domains. Under the weak and reasonable hypothesis of dealing with continuous semantic operations, we provide constructive characterizations for the least complete extensions and the greatest complete restrictions of abstract domains. As far as fixpoint completeness is concerned, for merely monotone semantic operators, the greatest restrictions of abstract domains are constructively characterized, while it is shown that the existence of least extensions of abstract domains cannot be, in general, guaranteed, even under strong hypotheses. These methodologies, which in finite settings give rise to effective algorithms, provide advanced formal tools for manipulating and comparing abstract interpretations, useful both in static program analysis and in semantics design. A number of examples illustrating these techniques are given.