Pages that link to "Item:Q5285987"
From MaRDI portal
The following pages link to Abstract Interpretation Frameworks (Q5285987):
Displayed 50 items.
- Set-sharing is redundant for pair-sharing (Q1605223) (← links)
- A global constraint for over-approximation of real-time streams (Q1699526) (← links)
- Class invariants as abstract interpretation of trace semantics (Q1749225) (← links)
- Abstract interpretation of mobile systems (Q1772313) (← links)
- Safe \& robust reachability analysis of hybrid systems (Q1786614) (← links)
- Abstracting Nash equilibria of supermodular games (Q1791275) (← links)
- Abstract interpretation of operational semantics for secure information flow. (Q1853040) (← links)
- Precise interprocedural dependence analysis of parallel programs (Q1884938) (← links)
- TASS: the toolkit for accurate scientific software (Q1949767) (← links)
- On collecting semantics for program analysis (Q2182314) (← links)
- Test generation from event system abstractions to cover their states and transitions (Q2216864) (← 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)
- Widening and narrowing operators for abstract interpretation (Q2275526) (← links)
- A sparse evaluation technique for detailed semantic analyses (Q2339156) (← links)
- Instruction-level security analysis for information flow in stack-based assembly languages (Q2381502) (← links)
- A class of polynomially solvable range constraints for interval analysis without widenings (Q2575737) (← links)
- A general framework for types in graph rewriting (Q2581012) (← links)
- A program auto-parallelizer based on the component technology of optimizing compiler construction (Q2654999) (← links)
- A Framework for Component Categories (Q2810956) (← links)
- Abstract Fixpoint Computations with Numerical Acceleration Methods (Q2814099) (← links)
- Static Analysis by Abstract Interpretation: A Mathematical Programming Approach (Q2814107) (← links)
- Automated formal analysis and verification: an overview (Q2871577) (← links)
- Bi-inductive Structural Semantics (Q2871828) (← links)
- Ideal Abstractions for Well-Structured Transition Systems (Q2891435) (← links)
- Static analysis of Biological Regulatory Networks dynamics using abstract interpretation (Q2909733) (← links)
- Logical Characterizations of Behavioral Relations on Transition Systems of Probability Distributions (Q2946748) (← links)
- Association of Under-Approximation Techniques for Generating Tests from Models (Q3012965) (← links)
- String Analysis as an Abstract Interpretation (Q3075489) (← links)
- Certified Static Analysis by Abstract Interpretation (Q3184788) (← links)
- Proving the Correctness of the Implementation of a Control-Command Algorithm (Q3392923) (← links)
- Abstract Interpretation from a Topological Perspective (Q3392931) (← links)
- On the interaction between sharing and linearity (Q3400961) (← links)
- Model Checking Recursive Programs with Exact Predicate Abstraction (Q3540067) (← links)
- A Scalable Segmented Decision Tree Abstract Domain (Q3587252) (← links)
- Proving the correctness of compiler optimisations based on a global analysis: a study of strictness analysis<sup>†</sup> (Q4880526) (← links)
- Geometric Quantifier Elimination Heuristics for Automatically Generating Octagonal and Max-plus Invariants (Q4913868) (← links)
- A Case Study in Abstract Interpretation Based Program Transformation (Q4917048) (← links)
- ON THE EDGE OF DECIDABILITY IN COMPLEXITY ANALYSIS OF LOOP PROGRAMS (Q4923290) (← 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)
- Gate splitting in LOTOS specifications using abstract interpretation (Q5044753) (← links)
- Three improvements to the top-down solver (Q5084314) (← links)
- The Abstract Domain of Parallelotopes (Q5170166) (← links)
- Proving Termination by Policy Iteration (Q5170173) (← links)
- Stratified Static Analysis Based on Variable Dependencies (Q5170182) (← links)
- Extracting Program Logics From Abstract Interpretations Defined by Logical Relations (Q5262946) (← links)
- Towards Abstraction-Based Verification of Shape Calculus (Q5404093) (← links)
- Optimal multibinding unification for sharing and linearity analysis (Q5418949) (← links)
- Cibai: An Abstract Interpretation-Based Static Analyzer for Modular Analysis and Verification of Java Classes (Q5452615) (← links)