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.
- 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)
- Inference of Field-Sensitive Reachability and Cyclicity (Q2946745) (← links)
- Logical Characterizations of Behavioral Relations on Transition Systems of Probability Distributions (Q2946748) (← links)
- Complete Abstractions and Subclassical Modal Logics (Q2961561) (← links)
- Stabilizing Floating-Point Programs Using Provenance Analysis (Q2961567) (← links)
- Conjunctive Abstract Interpretation Using Paramodulation (Q2961582) (← links)
- An abstract interpretation-based model for safety semantics (Q2995468) (← links)
- Linear Absolute Value Relation Analysis (Q3000578) (← links)
- Abstract Diagnosis of First Order Functional Logic Programs (Q3003495) (← links)
- Probabilistic Bisimulation and Simulation Algorithms by Abstract Interpretation (Q3012928) (← links)
- Abstract Certification of Global Non-interference in Rewriting Logic (Q3066121) (← links)
- Static Contract Checking with Abstract Interpretation (Q3067530) (← links)
- Precondition Inference from Intermittent Assertions and Application to Contracts on Collections (Q3075478) (← links)
- Strengthening Induction-Based Race Checking with Lightweight Static Analysis (Q3075479) (← links)
- String Analysis as an Abstract Interpretation (Q3075489) (← links)
- Information Leakage Analysis by Abstract Interpretation (Q3075542) (← links)
- A Spectrum of Behavioral Relations over LTSs on Probability Distributions (Q3090826) (← links)
- Sound and Complete Abstract Graph Transformation (Q3098055) (← links)
- Combining Model Checking and Data-Flow Analysis (Q3176374) (← links)
- Combining Model Reductions (Q3178247) (← links)
- An Introduction to Certificate Translation (Q3184785) (← links)
- Certified Static Analysis by Abstract Interpretation (Q3184788) (← links)
- Abstract Interpretation from a Topological Perspective (Q3392931) (← links)
- Interval Polyhedra: An Abstract Domain to Infer Interval Linear Relationships (Q3392932) (← links)
- Toward Compact Abstractions for Processor Pipelines (Q3449634) (← links)
- Abstract Interpretation as Automated Deduction (Q3454115) (← links)
- Probabilistic Analysis of Programs: A Weak Limit Approach (Q3460504) (← links)
- A Systematic Approach to Probabilistic Pointer Analysis (Q3498445) (← links)
- Transforming Abstract Interpretations by Abstract Interpretation (Q3522058) (← links)
- Hiding Software Watermarks in Loop Structures (Q3522070) (← links)
- Splitting the Control Flow with Boolean Flags (Q3522080) (← links)
- Loop Summarization Using Abstract Transformers (Q3540068) (← links)
- Probabilistic Semantics and Program Analysis (Q3575027) (← links)
- A Scalable Segmented Decision Tree Abstract Domain (Q3587252) (← links)
- A Framework for Point-Free Program Transformation (Q3623946) (← links)
- (Q4010356) (← links)
- Refining and compressing abstract domains (Q4572005) (← links)
- Semantics-based software watermarking by abstract interpretation (Q4611201) (← links)
- Abstract allocation as a unified approach to polyvariance in control-flow analyses (Q4625159) (← links)
- (Q4738454) (← links)
- Operational Semantics for Reexecution-based Analysis of Logic Programs with Delay Declarations (Q4923517) (← links)
- On the Relations between Disjunctive and Linear Logic Programming (Q4923519) (← links)
- Refining and Compressing Abstract Model Checking1 1The work is partially supported by MURST project: Certificazione automatica di programmi mediante interpretazione astratta. (Q4923520) (← links)
- Logic programs as specifications in the inductive verification of logic programs (Q4923522) (← links)
- Analysis of the equality relations for the program terms (Q5030193) (← links)
- Abstract cofibered domains: Application to the alias analysis of untyped programs (Q5030205) (← links)
- Structural Invariants for the Verification of Systems with Parameterized Architectures (Q5039511) (← links)
- Accurate Evaluation of Arithmetic Expressions (Invited Talk) (Q5170165) (← links)
