Pages that link to "Item:Q5385340"
From MaRDI portal
The following pages link to Making abstract interpretations complete (Q5385340):
Displaying 45 items.
- Inverse-limit and topological aspects of abstract interpretation (Q418811) (← links)
- An abstract interpretation framework for genotype elimination algorithms (Q428908) (← links)
- Abstract interpretation of database query languages (Q456469) (← links)
- Maximal incompleteness as obfuscation potency (Q511013) (← links)
- Why does Astrée scale up? (Q845249) (← links)
- Generalizing the Paige-Tarjan algorithm by abstract interpretation (Q924726) (← links)
- 3-valued abstraction: More precision at less cost (Q958307) (← links)
- Using abstract interpretation to add type checking for interfaces in Java bytecode verification (Q974112) (← links)
- Code obfuscation against abstraction refinement attacks (Q1624593) (← links)
- Lattice-based refinement in bounded model checking (Q1629959) (← links)
- Abstract domains for type juggling (Q1650957) (← links)
- Abstracting Nash equilibria of supermodular games (Q1791275) (← links)
- A theory of observables for logic programs (Q1854446) (← links)
- Completeness of string analysis for dynamic languages (Q2051812) (← links)
- On collecting semantics for program analysis (Q2182314) (← links)
- Abstract neural networks (Q2233525) (← links)
- Formal framework for reasoning about the precision of dynamic analysis (Q2233534) (← links)
- On multi-language abstraction. Towards a static analysis of multi-language programs (Q2233542) (← links)
- Twinning automata and regular expressions for string static analysis (Q2234078) (← links)
- Correctness kernels of abstract interpretations (Q2252528) (← links)
- Unveiling metamorphism by abstract interpretation of code properties (Q2339470) (← links)
- Combining search space partition and abstraction for LTL model checking (Q2465733) (← links)
- Incompleteness of states w.r.t. traces in model checking (Q2492186) (← links)
- Weakening additivity in adjoining closures (Q2520722) (← links)
- A semantic framework for the abstract model checking of tccp programs (Q2576949) (← links)
- Abstract Interpretation From a Denotational-semantics Perspective (Q2805148) (← links)
- Complete Abstractions and Subclassical Modal Logics (Q2961561) (← links)
- An abstract interpretation-based model for safety semantics (Q2995468) (← links)
- Cooperative Query Answering by Abstract Interpretation (Q3075526) (← links)
- Modelling declassification policies using abstract domain completeness (Q3103614) (← links)
- Optimality in goal-dependent analysis of Sharing (Q3181746) (← links)
- Abstract Interpretation from a Topological Perspective (Q3392931) (← links)
- Transforming Abstract Interpretations by Abstract Interpretation (Q3522058) (← links)
- Semantics-based software watermarking by abstract interpretation (Q4611201) (← links)
- (Q5089290) (← links)
- (Q5089296) (← links)
- What You Lose is What You Leak: Information Leakage in Declassification Policies (Q5262929) (← links)
- Extracting Program Logics From Abstract Interpretations Defined by Logical Relations (Q5262946) (← links)
- Abstract Program Slicing (Q5278199) (← links)
- Deriving Bisimulations by Simplifying Partitions (Q5452714) (← links)
- Internal and External Logics of Abstract Interpretations (Q5452722) (← links)
- Making abstract models complete (Q5741575) (← links)
- Control-flow analysis of function calls and returns by abstract interpretation (Q5891553) (← links)
- Observational Completeness on Abstract Interpretation (Q5902155) (← links)
- Fixpoint Theory -- Upside Down (Q6135764) (← links)
