Abstract Interpretation Frameworks
From MaRDI portal
Publication:5285987
DOI10.1093/LOGCOM/2.4.511zbMATH Open0783.68073OpenAlexW2084875723MaRDI QIDQ5285987FDOQ5285987
Authors: Patrick Cousot, Radhia Cousot 
Publication date: 29 June 1993
Published in: Journal Of Logic And Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/logcom/2.4.511
Recommendations
Galois connectionsabstract interpretationdiscrete approximationconcretizationconcrete and abstract semanticsnarrowingssoundness relationwidenings
Cited In (88)
- On the interaction between sharing and linearity
- An abstract interpretation framework for input data usage
- Abstract interpretation of operational semantics for secure information flow.
- Class invariants as abstract interpretation of trace semantics
- Bi-inductive structural semantics
- Test generation from event system abstractions to cover their states and transitions
- Algebraic program analysis
- Towards Abstraction-Based Verification of Shape Calculus
- Ideal abstractions for well-structured transition systems
- Title not available (Why is that?)
- Inverse-limit and topological aspects of abstract interpretation
- Using abstract interpretation to add type checking for interfaces in Java bytecode verification
- Semantics of roundoff error propagation in finite precision calculations
- A zonotopic framework for functional abstractions
- A minimalistic look at widening operators
- Proving termination by policy iteration
- On multi-language abstraction. Towards a static analysis of multi-language programs
- An abstract interpretation framework for genotype elimination algorithms
- A class of polynomially solvable range constraints for interval analysis without widenings
- Precise interprocedural dependence analysis of parallel programs
- Stratified static analysis based on variable dependencies
- Title not available (Why is that?)
- 3-valued abstraction: More precision at less cost
- Enforcing termination of interprocedural analysis
- Acceleration of the abstract fixpoint computation in numerical program analysis
- Making abstract models complete
- Automated formal analysis and verification: an overview
- Optimal multibinding unification for sharing and linearity analysis
- Applications of polyhedral computations to the analysis and verification of hardware and software systems
- Widening and narrowing operators for abstract interpretation
- Towards the hierarchical verification of reactive systems
- On using data abstractions for model checking refinements
- Abstract interpretation of mobile systems
- A scalable segmented decision tree abstract domain
- A general framework for types in graph rewriting
- Title not available (Why is that?)
- Practical policy iterations. A practical use of policy iterations for static analysis: the quadratic case
- Computing by observing: simple systems and simple observers
- On the consistency, expressiveness, and precision of partial modeling formalisms
- Abstracting Nash equilibria of supermodular games
- Twinning automata and regular expressions for string static analysis
- Program verification: state of the art, problems, and results. I
- String analysis as an abstract interpretation
- Abstract cofibered domains: application to the alias analysis of untyped programs
- A framework for component categories
- Set-sharing is redundant for pair-sharing
- The abstract domain of parallelotopes
- Model Checking Recursive Programs with Exact Predicate Abstraction
- Approximate fixed points in abstract interpretation
- Cibai: An Abstract Interpretation-Based Static Analyzer for Modular Analysis and Verification of Java Classes
- Static analysis by abstract interpretation: a mathematical programming approach
- The octagon abstract domain
- Static analysis of biological regulatory networks dynamics using abstract interpretation
- Safe \& robust reachability analysis of hybrid systems
- OLDTNF-based evaluation method for handling recursive queries in deductive databases
- Abstract fixpoint computations with numerical acceleration methods
- Logical characterizations of behavioral relations on transition systems of probability distributions
- Incremental Abstract Interpretation
- A global constraint for over-approximation of real-time streams
- Maximal incompleteness as obfuscation potency
- Bi-inductive structural semantics (extended abstract)
- Certified Static Analysis by Abstract Interpretation
- TASS: the toolkit for accurate scientific software
- On collecting semantics for program analysis
- Association of under-approximation techniques for generating tests from models
- Finite-tree analysis for constraint logic-based languages
- A sparse evaluation technique for detailed semantic analyses
- On the edge of decidability in complexity analysis of loop programs
- Abstract Interpretation from a Topological Perspective
- Robustness in metric spaces over continuous quantales and the Hausdorff-Smyth monad
- Proving the Correctness of the Implementation of a Control-Command Algorithm
- Decoupling the ascending and descending phases in abstract interpretation
- Control-flow analysis of function calls and returns by abstract interpretation
- A program auto-parallelizer based on the component technology of optimizing compiler construction
- Extracting program logics from abstract interpretations defined by logical relations
- Instruction-level security analysis for information flow in stack-based assembly languages
- Analysis of the equality relations for the program terms
- Sweeping in Abstract Interpretation
- Proving the correctness of compiler optimisations based on a global analysis: a study of strictness analysis†
- Towards global neural network abstractions with locally-exact reconstruction
- Abstract interpretation of CTL properties
- Geometric Quantifier Elimination Heuristics for Automatically Generating Octagonal and Max-plus Invariants
- A Case Study in Abstract Interpretation Based Program Transformation
- Towards a type-based abstract semantics for Python
- Abstract interpretation of indexed grammars
- Dissecting widening: separating termination from information
- Gate splitting in LOTOS specifications using abstract interpretation
- Three improvements to the top-down solver
This page was built for publication: Abstract Interpretation Frameworks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5285987)
