Making abstract interpretations complete
From MaRDI portal
Recommendations
Cited in
(78)- Code obfuscation against abstraction refinement attacks
- Lattice-based refinement in bounded model checking
- Abstract domains for type juggling
- Abstracting Nash equilibria of supermodular games
- Optimal domains for disjunctive abstract interpretation
- A theory of observables for logic programs
- Completeness of string analysis for dynamic languages
- On collecting semantics for program analysis
- Abstract neural networks
- Formal framework for reasoning about the precision of dynamic analysis
- On multi-language abstraction. Towards a static analysis of multi-language programs
- Twinning automata and regular expressions for string static analysis
- Correctness kernels of abstract interpretations
- Completeness of abstract domains for string analysis of JavaScript programs
- Unveiling metamorphism by abstract interpretation of code properties
- Combining search space partition and abstraction for LTL model checking
- Incompleteness of states w.r.t. traces in model checking
- Weakening additivity in adjoining closures
- A semantic framework for the abstract model checking of tccp programs
- Abstract interpretation from a denotational-semantics perspective
- Analyzing program analyses
- Complete abstractions everywhere
- Complete abstractions and subclassical modal logics
- An abstract interpretation-based model for safety semantics
- Cooperative query answering by abstract interpretation
- Modelling declassification policies using abstract domain completeness
- On the power of abstract interpretation
- Optimality in goal-dependent analysis of Sharing
- Abstract Interpretation from a Topological Perspective
- Transforming Abstract Interpretations by Abstract Interpretation
- Compositional characterization of observable program properties
- Inverse-limit and topological aspects of abstract interpretation
- scientific article; zbMATH DE number 1222407 (Why is no real title available?)
- An abstract interpretation framework for genotype elimination algorithms
- scientific article; zbMATH DE number 1953028 (Why is no real title available?)
- scientific article; zbMATH DE number 1759702 (Why is no real title available?)
- Abstract interpretation of database query languages
- Semantics-based software watermarking by abstract interpretation
- scientific article; zbMATH DE number 1834576 (Why is no real title available?)
- scientific article; zbMATH DE number 7559481 (Why is no real title available?)
- scientific article; zbMATH DE number 7559486 (Why is no real title available?)
- Maximal incompleteness as obfuscation potency
- Sound up-to techniques and complete abstract domains
- Comparison of abstract interpretations
- What you lose is what you leak: information leakage in declassification policies
- Extracting program logics from abstract interpretations defined by logical relations
- Abstract program slicing: an abstract interpretation-based approach to program slicing
- Comparing Completeness Properties of Static Analyses and Their Logics
- Deriving Bisimulations by Simplifying Partitions
- Internal and External Logics of Abstract Interpretations
- Making abstract models complete
- Control-flow analysis of function calls and returns by abstract interpretation
- Observational completeness on abstract interpretation
- Observational Completeness on Abstract Interpretation
- Invertible linear transforms of numerical abstract domains
- Fixpoint Theory -- Upside Down
- Deciding program properties via complete abstractions on bounded domains
- Property-driven code obfuscations reinterpreting Jones-optimality in abstract interpretation
- Local completeness logic on Kleene algebra with tests
- Logics for extensional, locally complete analysis via domain refinements
- Exploiting adjoints in property directed reachability analysis
- Syntactic and semantic soundness of structural dataflow analysis
- Abstract interpretation of indexed grammars
- Language inclusion algorithms as complete abstract interpretations
- On the Monniaux problem in abstract interpretation
- Systems of fixpoint equations: abstraction, games, up-to techniques and local algorithms
- Broadening the applicability of local completeness analysis with intensional and extensional guarantees
- On the Monniaux problem in abstract interpretation
- On multi-language abstraction: towards a static analysis of multi-language programs
- A correctness and incorrectness program logic
- Model checking as program verification by abstract interpretation
- Adjointness in property directed reachability analysis
- Abstract Lipschitz continuity. Combining semantic and quantitative approximations
- Refining abstract interpretations
- Why does Astrée scale up?
- Generalizing the Paige-Tarjan algorithm by abstract interpretation
- 3-valued abstraction: More precision at less cost
- Using abstract interpretation to add type checking for interfaces in Java bytecode verification
This page was built for publication: Making abstract interpretations complete
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5385340)
