Pages that link to "Item:Q5285987"
From MaRDI portal
The following pages link to Abstract Interpretation Frameworks (Q5285987):
Displayed 38 items.
- Acceleration of the abstract fixpoint computation in numerical program analysis (Q435974) (← links)
- Towards the hierarchical verification of reactive systems (Q596025) (← links)
- Computing by observing: simple systems and simple observers (Q616498) (← links)
- On the consistency, expressiveness, and precision of partial modeling formalisms (Q617712) (← links)
- Finite-tree analysis for constraint logic-based languages (Q817224) (← links)
- A minimalistic look at widening operators (Q848744) (← links)
- Semantics of roundoff error propagation in finite precision calculations (Q853732) (← links)
- The octagon abstract domain (Q853733) (← links)
- On using data abstractions for model checking refinements (Q878378) (← 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)
- Bi-inductive structural semantics (Q1012127) (← links)
- Applications of polyhedral computations to the analysis and verification of hardware and software systems (Q1035700) (← links)
- OLDTNF-based evaluation method for handling recursive queries in deductive databases (Q1286645) (← links)
- Set-sharing is redundant for pair-sharing (Q1605223) (← links)
- Abstract interpretation of mobile systems (Q1772313) (← links)
- Abstract interpretation of operational semantics for secure information flow. (Q1853040) (← links)
- Precise interprocedural dependence analysis of parallel programs (Q1884938) (← links)
- Widening and narrowing operators for abstract interpretation (Q2275526) (← 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)
- Ideal Abstractions for Well-Structured Transition Systems (Q2891435) (← links)
- Static analysis of Biological Regulatory Networks dynamics using abstract interpretation (Q2909733) (← 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)
- Cibai: An Abstract Interpretation-Based Static Analyzer for Modular Analysis and Verification of Java Classes (Q5452615) (← links)
- Control-flow analysis of function calls and returns by abstract interpretation (Q5891553) (← links)