Octagon

swMATH13702MaRDI QIDQ25616

No author found.

Described by source

• The octagon abstract domain

Related Items (58)

Donut Domains: Efficient Non-convex Domains for Abstract Interpretation ⋮ Invariant Generation through Strategy Iteration in Succinctly Represented Control Flow Graphs ⋮ Policy Iteration within Logico-Numerical Abstract Domains ⋮ Weakly-relational shapes for numeric abstractions: Improved algorithms and proofs of correctness ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Proof-carrying code from certified abstract interpretation and fixpoint compression ⋮ A Constraint Solver Based on Abstract Domains ⋮ Computer Aided Verification ⋮ Verification, Model Checking, and Abstract Interpretation ⋮ Relational Thread-Modular Static Value Analysis by Abstract Interpretation ⋮ Safety Problems Are NP-complete for Flat Integer Programs with Octagonal Loops ⋮ Modular inference of subprogram contracts for safety checking ⋮ Splitting the Control Flow with Boolean Flags ⋮ An Abstract Interpretation Based Combinator for Modelling While Loops in Constraint Programming ⋮ Reachability analysis for timed automata using max-plus algebra ⋮ Static Analysis ⋮ Static Analysis ⋮ Logic Programming ⋮ Static Analysis of Run-Time Errors in Embedded Critical Parallel C Programs ⋮ Theories, solvers and static analysis by abstract interpretation ⋮ Unnamed Item ⋮ Abstract acceleration of general linear loops ⋮ An Abstract Domain to Infer Ordinal-Valued Ranking Functions ⋮ Programming Languages and Systems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Integrating Policy Iterations in Abstract Interpreters ⋮ Automatic Modular Abstractions for Template Numerical Constraints ⋮ Fully Bounded Polyhedral Analysis of Integers with Wrapping ⋮ Solving Difference Constraints over Modular Arithmetic ⋮ Automatic Abstraction for Intervals Using Boolean Formulae ⋮ Interval Slopes as a Numerical Abstract Domain for Floating-Point Variables ⋮ Automatic Verification of Determinism for Structured Parallel Programs ⋮ Exact join detection for convex polyhedra and other numerical abstractions ⋮ Static Analysis by Policy Iteration on Relational Domains ⋮ Precise Relational Invariants Through Strategy Iteration ⋮ Logical Interpretation: Static Program Analysis Using Theorem Proving ⋮ Program Analysis Using Symbolic Ranges ⋮ Static Contract Checking with Abstract Interpretation ⋮ An Abstract Domain Extending Difference-Bound Matrices with Disequality Constraints ⋮ The Constraint Database Approach to Software Verification ⋮ Non-disjunctive Numerical Domain for Array Predicate Abstraction ⋮ Static Analysis Via Abstract Interpretation of the Happens-Before Memory Model ⋮ Opaque Predicates Detection by Abstract Interpretation ⋮ Two Variables per Linear Inequality as an Abstract Domain ⋮ Static Analysis ⋮ Verification, Model Checking, and Abstract Interpretation ⋮ Modelling declassification policies using abstract domain completeness ⋮ An Abstract Domain to Discover Interval Linear Equalities ⋮ Full simulation coverage for SystemC transaction-level models of systems-on-a-chip ⋮ Programming Languages and Systems ⋮ Unnamed Item ⋮ Algebraic Methodology and Software Technology ⋮ Algebraic Methodology and Software Technology ⋮ A sparse evaluation technique for detailed semantic analyses ⋮ Automatic modular abstractions for linear constraints ⋮ Extracting Program Logics From Abstract Interpretations Defined by Logical Relations

This page was built for software: Octagon