Abstract Interpretation Frameworks
From MaRDI portal
Publication:5285987
DOI10.1093/logcom/2.4.511zbMath0783.68073OpenAlexW2084875723MaRDI QIDQ5285987
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
discrete approximationGalois connectionsabstract interpretationconcretizationconcrete and abstract semanticsnarrowingssoundness relationwidenings
Related Items
Ideal Abstractions for Well-Structured Transition Systems, Algebraic program analysis, Precise interprocedural dependence analysis of parallel programs, Instruction-level security analysis for information flow in stack-based assembly languages, Static analysis of Biological Regulatory Networks dynamics using abstract interpretation, A minimalistic look at widening operators, Certified Static Analysis by Abstract Interpretation, Semantics of roundoff error propagation in finite precision calculations, The octagon abstract domain, A program auto-parallelizer based on the component technology of optimizing compiler construction, Towards the hierarchical verification of reactive systems, Three improvements to the top-down solver, On using data abstractions for model checking refinements, On collecting semantics for program analysis, Logical Characterizations of Behavioral Relations on Transition Systems of Probability Distributions, 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, Decoupling the ascending and descending phases in abstract interpretation, A global constraint for over-approximation of real-time streams, TASS: the toolkit for accurate scientific software, Acceleration of the abstract fixpoint computation in numerical program analysis, Proving the correctness of compiler optimisations based on a global analysis: a study of strictness analysis†, Test generation from event system abstractions to cover their states and transitions, Control-flow analysis of function calls and returns by abstract interpretation, Program verification: state of the art, problems, and results. I, Model Checking Recursive Programs with Exact Predicate Abstraction, On multi-language abstraction. Towards a static analysis of multi-language programs, Twinning automata and regular expressions for string static analysis, Towards Abstraction-Based Verification of Shape Calculus, Association of Under-Approximation Techniques for Generating Tests from Models, Maximal incompleteness as obfuscation potency, Class invariants as abstract interpretation of trace semantics, Geometric Quantifier Elimination Heuristics for Automatically Generating Octagonal and Max-plus Invariants, 3-valued abstraction: More precision at less cost, A Case Study in Abstract Interpretation Based Program Transformation, Optimal multibinding unification for sharing and linearity analysis, The Abstract Domain of Parallelotopes, Proving Termination by Policy Iteration, Stratified Static Analysis Based on Variable Dependencies, ON THE EDGE OF DECIDABILITY IN COMPLEXITY ANALYSIS OF LOOP PROGRAMS, Making abstract models complete, A Scalable Segmented Decision Tree Abstract Domain, Using abstract interpretation to add type checking for interfaces in Java bytecode verification, Abstract interpretation of mobile systems, Gate splitting in LOTOS specifications using abstract interpretation, Widening and narrowing operators for abstract interpretation, Enforcing termination of interprocedural analysis, Safe \& robust reachability analysis of hybrid systems, Abstracting Nash equilibria of supermodular games, A zonotopic framework for functional abstractions, Cibai: An Abstract Interpretation-Based Static Analyzer for Modular Analysis and Verification of Java Classes, String Analysis as an Abstract Interpretation, A Framework for Component Categories, Bi-inductive structural semantics, Abstract Fixpoint Computations with Numerical Acceleration Methods, Static Analysis by Abstract Interpretation: A Mathematical Programming Approach, Proving the Correctness of the Implementation of a Control-Command Algorithm, Abstract Interpretation from a Topological Perspective, On the interaction between sharing and linearity, Applications of polyhedral computations to the analysis and verification of hardware and software systems, OLDTNF-based evaluation method for handling recursive queries in deductive databases, A class of polynomially solvable range constraints for interval analysis without widenings, A sparse evaluation technique for detailed semantic analyses, Abstract interpretation of operational semantics for secure information flow., A general framework for types in graph rewriting, Extracting Program Logics From Abstract Interpretations Defined by Logical Relations, Automated formal analysis and verification: an overview, Bi-inductive Structural Semantics, Set-sharing is redundant for pair-sharing, Analysis of the equality relations for the program terms, Abstract cofibered domains: Application to the alias analysis of untyped programs, Finite-tree analysis for constraint logic-based languages
