Octagon

swMATH13702MaRDI QIDQ25616FDOQ25616

Author name not available (Why is that?)

Described by source

• The octagon abstract domain

Cited In (58)

• Title not available (Why is that?)
• Static Analysis
• Static Analysis Via Abstract Interpretation of the Happens-Before Memory Model
• Title not available (Why is that?)
• The Constraint Database Approach to Software Verification
• A Constraint Solver Based on Abstract Domains
• Static Analysis by Policy Iteration on Relational Domains
• A sparse evaluation technique for detailed semantic analyses
• Extracting Program Logics From Abstract Interpretations Defined by Logical Relations
• Title not available (Why is that?)
• Title not available (Why is that?)
• An Abstract Interpretation Based Combinator for Modelling While Loops in Constraint Programming
• Weakly-relational shapes for numeric abstractions: Improved algorithms and proofs of correctness
• Non-disjunctive Numerical Domain for Array Predicate Abstraction
• Proof-carrying code from certified abstract interpretation and fixpoint compression
• Modelling declassification policies using abstract domain completeness
• Verification, Model Checking, and Abstract Interpretation
• Verification, Model Checking, and Abstract Interpretation
• Value-range analysis of C programs. Towards proving the absence of buffer overflow vulnerabilities
• On solving Boolean combinations of UTVPI constraints.
• Reachability analysis for timed automata using max-plus algebra
• Donut Domains: Efficient Non-convex Domains for Abstract Interpretation
• Splitting the Control Flow with Boolean Flags
• Modular inference of subprogram contracts for safety checking
• Safety Problems Are NP-complete for Flat Integer Programs with Octagonal Loops
• Static analysis of run-time errors in embedded critical parallel C programs
• Logic Programming
• An abstract domain to discover interval linear equalities
• Static contract checking with abstract interpretation
• An Abstract Domain Extending Difference-Bound Matrices with Disequality Constraints
• Two variables per linear inequality as an abstract domain
• Exact join detection for convex polyhedra and other numerical abstractions
• Programming Languages and Systems
• Programming Languages and Systems
• Static Analysis
• Static Analysis
• An Abstract Domain to Infer Ordinal-Valued Ranking Functions
• Computer Aided Verification
• Policy Iteration within Logico-Numerical Abstract Domains
• Full simulation coverage for SystemC transaction-level models of systems-on-a-chip
• Algebraic Methodology and Software Technology
• Algebraic Methodology and Software Technology
• Relational Thread-Modular Static Value Analysis by Abstract Interpretation
• Automatic verification of determinism for structured parallel programs
• Automatic abstraction for intervals using Boolean formulae
• Logical Interpretation: Static Program Analysis Using Theorem Proving
• Opaque Predicates Detection by Abstract Interpretation
• Integrating Policy Iterations in Abstract Interpreters
• Fully Bounded Polyhedral Analysis of Integers with Wrapping
• Solving Difference Constraints over Modular Arithmetic
• Interval slopes as a numerical abstract domain for floating-point variables
• Automatic modular abstractions for template numerical constraints
• Program Analysis Using Symbolic Ranges
• Invariant Generation through Strategy Iteration in Succinctly Represented Control Flow Graphs
• Theories, solvers and static analysis by abstract interpretation
• Automatic modular abstractions for linear constraints
• Precise Relational Invariants Through Strategy Iteration
• Abstract acceleration of general linear loops

This page was built for software: Octagon