Pages that link to "Item:Q5178905"
From MaRDI portal
The following pages link to Systematic design of program transformation frameworks by abstract interpretation (Q5178905):
Displaying 50 items.
- Inferring complete initialization of arrays (Q383356) (← links)
- On invariant checking (Q394493) (← links)
- Mathematical programming: Turing completeness and applications to software analysis (Q405669) (← links)
- Abstract interpretation of database query languages (Q456469) (← links)
- Maximal incompleteness as obfuscation potency (Q511013) (← links)
- Context-sensitive analysis without calling-context (Q656869) (← links)
- Regular algebra applied to language problems (Q817577) (← links)
- Extending separation logic with fixpoints and postponed substitution (Q820139) (← links)
- Enhancing the implementation of mathematical formulas for fixed-point and floating-point arithmetics (Q845241) (← links)
- An empirical study on classification methods for alarms from a bug-finding static C analyzer (Q845982) (← links)
- Analyzing the environment structure of higher-order languages using frame strings (Q879361) (← links)
- Practical policy iterations. A practical use of policy iterations for static analysis: the quadratic case (Q888469) (← links)
- Generalizing the Paige-Tarjan algorithm by abstract interpretation (Q924726) (← links)
- Using abstract interpretation to add type checking for interfaces in Java bytecode verification (Q974112) (← links)
- Abstract interpretation based verification of temporal properties for BioAmbients (Q989287) (← links)
- Bi-inductive structural semantics (Q1012127) (← links)
- An efficient simulation algorithm based on abstract interpretation (Q1049401) (← links)
- Logical optimality of groundness analysis (Q1605228) (← links)
- Lattice-based refinement in bounded model checking (Q1629959) (← links)
- The map equality domain (Q1629967) (← links)
- Software watermarking: a semantics-based approach (Q1650961) (← links)
- Descending chains and narrowing on template abstract domains (Q1671249) (← links)
- The abstract domain of trapezoid step functions (Q1749121) (← links)
- Abstracting Nash equilibria of supermodular games (Q1791275) (← links)
- Parsing as abstract interpretation of grammar semantics (Q1853600) (← links)
- An abstract interpretation framework to reason on finite failure and other properties of finite and infinite computations. (Q1853617) (← links)
- A theory of observables for logic programs (Q1854446) (← links)
- Pair-independence and freeness analysis through linear refinement. (Q1873754) (← links)
- A relational shape abstract domain (Q2058389) (← links)
- Hardware Trojan detection via rewriting logic (Q2141287) (← links)
- Relational string abstract domains (Q2152641) (← links)
- Fast three-valued abstract bit-vector arithmetic (Q2152654) (← links)
- Characterization and computation of ancestors in reaction systems (Q2157013) (← links)
- A new abstraction framework for affine transformers (Q2322316) (← links)
- Abstract interpretation as automated deduction (Q2360874) (← links)
- Finding suitable variability abstractions for lifted analysis (Q2414252) (← links)
- A survey of strategies in rule-based program transformation systems (Q2456575) (← links)
- Optimality and condensing of information flow through linear refinement (Q2464935) (← links)
- Transformation of a PID controller for numerical accuracy (Q2520677) (← links)
- Weakening additivity in adjoining closures (Q2520722) (← links)
- On the verification of finite failure (Q2575838) (← links)
- View-Augmented Abstractions (Q2814101) (← links)
- Relational Abstract Domain of Weighted Hexagons (Q2814105) (← links)
- Model Checking Erlang Programs – Abstracting Recursive Function Calls (Q2841292) (← links)
- Semantic Abstraction and Quantum Computation (Q2870205) (← links)
- On Probabilistic Techniques for Data Flow Analysis (Q2870284) (← links)
- Abstract Domains for Automated Reasoning about List-Manipulating Programs with Infinite Data (Q2891398) (← links)
- Automatic Inference of Access Permissions (Q2891412) (← links)
- Ideal Abstractions for Well-Structured Transition Systems (Q2891435) (← links)
- Semantics of Probabilistic Programs: A Weak Limit Approach (Q2937792) (← links)
