Pages that link to "Item:Q5285987"
From MaRDI portal
The following pages link to Abstract Interpretation Frameworks (Q5285987):
Displaying 50 items.
- Inverse-limit and topological aspects of abstract interpretation (Q418811) (← links)
- An abstract interpretation framework for genotype elimination algorithms (Q428908) (← links)
- Acceleration of the abstract fixpoint computation in numerical program analysis (Q435974) (← links)
- Program verification: state of the art, problems, and results. I (Q466416) (← links)
- Maximal incompleteness as obfuscation potency (Q511013) (← 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)
- Algebraic program analysis (Q832153) (← 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)
- Practical policy iterations. A practical use of policy iterations for static analysis: the quadratic case (Q888469) (← 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)
- Frameworks for abstract interpretation (Q1323307) (← links)
- Approximate fixed points in abstract interpretation (Q1330439) (← links)
- 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)
- An abstract interpretation framework for input data usage (Q2324002) (← 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 (extended abstract) (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)