Octagon
From MaRDI portal
Cited in
(69)- Full simulation coverage for SystemC transaction-level models of systems-on-a-chip
- Apron
- VINAS-P
- Aspic
- PPL
- JACK
- Interproc
- Pinapa
- Exact join detection for convex polyhedra and other numerical abstractions
- A sparse evaluation technique for detailed semantic analyses
- CSSV
- ASTREE
- Donut domains: efficient non-convex domains for abstract interpretation
- A constraint solver based on abstract domains
- Relational thread-modular static value analysis by abstract interpretation
- Safety problems are NP-complete for flat integer programs with octagonal loops
- Static analysis of run-time errors in embedded critical parallel C programs
- Static contract checking with abstract interpretation
- Two variables per linear inequality as an abstract domain
- Modelling declassification policies using abstract domain completeness
- Invariant generation through strategy iteration in succinctly represented control flow graphs
- Policy iteration within logico-numerical abstract domains
- BOXES
- Value-range analysis of C programs. Towards proving the absence of buffer overflow vulnerabilities
- Splitting the Control Flow with Boolean Flags
- An Abstract Interpretation Based Combinator for Modelling While Loops in Constraint Programming
- PipLib
- Automatic modular abstractions for template numerical constraints
- Precise Relational Invariants Through Strategy Iteration
- Logical Interpretation: Static Program Analysis Using Theorem Proving
- Program Analysis Using Symbolic Ranges
- Opaque Predicates Detection by Abstract Interpretation
- An abstract domain to discover interval linear equalities
- A few graph-based relational numerical abstract domains
- Abstract interpretation-based certification of assembly code
- Reachability analysis for timed automata using max-plus algebra
- 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
- Integrating Policy Iterations in Abstract Interpreters
- Fully Bounded Polyhedral Analysis of Integers with Wrapping
- Logic Programming
- Automatic modular abstractions for linear constraints
- Extracting program logics from abstract interpretations defined by logical relations
- scientific article; zbMATH DE number 5175527 (Why is no real title available?)
- On solving Boolean combinations of UTVPI constraints.
- scientific article; zbMATH DE number 5194318 (Why is no real title available?)
- Abstracting call-stacks for interprocedural verification of imperative programs
- Abstract domains for property checking driven analysis of temporal properties
- Trace partitioning in abstract interpretation based static analyzers
- Theories, solvers and static analysis by abstract interpretation
- Abstract acceleration of general linear loops
- An abstract domain to infer ordinal-valued ranking functions
- 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
- A scalable nonuniform pointer analysis for embedded programs
- A relational approach to interprocedural shape analysis
- Programming Languages and Systems
- Scalable analysis of linear systems using mathematical programming
- A policy iteration algorithm for computing fixed points in static analysis of programs
- Static Analysis by Policy Iteration on Relational Domains
- Static Analysis
- Verification, Model Checking, and Abstract Interpretation
- Modular inference of subprogram contracts for safety checking
- Weakly-relational shapes for numeric abstractions: Improved algorithms and proofs of correctness
- Proof-carrying code from certified abstract interpretation and fixpoint compression
This page was built for software: Octagon