swMATH13702MaRDI QIDQ25616FDOQ25616
Author name not available (Why is that?)
Official website: https://www-apr.lip6.fr/~mine/oct/
Cited In (67)
- Logic Programming
- 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
- Donut domains: efficient non-convex domains for abstract interpretation
- Static Analysis by Policy Iteration on Relational Domains
- A sparse evaluation technique for detailed semantic analyses
- Safety problems are NP-complete for flat integer programs with octagonal loops
- 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
- Solving difference constraints over modular arithmetic
- 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
- Policy iteration within logico-numerical abstract domains
- On solving Boolean combinations of UTVPI constraints.
- Reachability analysis for timed automata using max-plus algebra
- Splitting the Control Flow with Boolean Flags
- Modular inference of subprogram contracts for safety checking
- Static analysis of run-time errors in embedded critical parallel C programs
- An abstract domain to discover interval linear equalities
- Relational thread-modular static value analysis by abstract interpretation
- Extracting program logics from abstract interpretations defined by logical relations
- Static contract checking with abstract interpretation
- An Abstract Domain Extending Difference-Bound Matrices with Disequality Constraints
- Aspic
- PPL
- JACK
- Interproc
- Pinapa
- ASTREE
- CSSV
- Two variables per linear inequality as an abstract domain
- BOXES
- PipLib
- Exact join detection for convex polyhedra and other numerical abstractions
- Invariant generation through strategy iteration in succinctly represented control flow graphs
- Programming Languages and Systems
- Programming Languages and Systems
- Static Analysis
- Static Analysis
- Computer Aided Verification
- Full simulation coverage for SystemC transaction-level models of systems-on-a-chip
- Algebraic Methodology and Software Technology
- Algebraic Methodology and Software Technology
- 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
- Interval slopes as a numerical abstract domain for floating-point variables
- A constraint solver based on abstract domains
- Automatic modular abstractions for template numerical constraints
- Program Analysis Using Symbolic Ranges
- Theories, solvers and static analysis by abstract interpretation
- Automatic modular abstractions for linear constraints
- An abstract domain to infer ordinal-valued ranking functions
- Precise Relational Invariants Through Strategy Iteration
- Abstract acceleration of general linear loops
This page was built for software: Octagon
