Recommendations
Cites work
- scientific article; zbMATH DE number 1701751 (Why is no real title available?)
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 3610766 (Why is no real title available?)
- scientific article; zbMATH DE number 1948387 (Why is no real title available?)
- scientific article; zbMATH DE number 1953274 (Why is no real title available?)
- scientific article; zbMATH DE number 1738295 (Why is no real title available?)
- scientific article; zbMATH DE number 1832225 (Why is no real title available?)
- scientific article; zbMATH DE number 1390341 (Why is no real title available?)
- scientific article; zbMATH DE number 1400094 (Why is no real title available?)
- scientific article; zbMATH DE number 1424030 (Why is no real title available?)
- scientific article; zbMATH DE number 3281219 (Why is no real title available?)
- A hierarchy of constraint systems for data-flow analysis of constraint logic-based languages
- Abstract Interpretation Frameworks
- Abstract interpretation and application to logic programs
- Abstract interpretation of mobile systems
- Affine relationships among variables of a program
- On a routing problem
- Programming Languages and Systems
- Programming Languages and Systems
- Programming Languages and Systems
- Static Analysis
- Static Analysis
- Static Analysis
- Static analysis of arithmetical congruences
- The octagon abstract domain
- Two variables per linear inequality as an abstract domain
- Verification by abstract interpretation
- Verification, Model Checking, and Abstract Interpretation
Cited in
(only showing first 100 items - show all)- An Improved Tight Closure Algorithm for Integer Octagonal Constraints
- Access-based localization for octagons
- Scalable polyhedral verification of recurrent neural networks
- Static Analysis Via Abstract Interpretation of the Happens-Before Memory Model
- Constructive Galois connections
- Incremental closure for systems of two variables per inequality
- Iterating Octagons
- Donut domains: efficient non-convex domains for abstract interpretation
- Incrementally closing octagons
- What you lose is what you leak: information leakage in declassification policies
- The octagon abstract domain for continuous constraints
- Generic abstraction of dictionaries and arrays
- Inverse-limit and topological aspects of abstract interpretation
- A sparse evaluation technique for detailed semantic analyses
- A generic framework for heap and value analyses of object-oriented programming languages
- A pre-order relation for exact schedulability test of sporadic tasks on multiprocessor global fixed-priority scheduling
- scientific article; zbMATH DE number 1738295 (Why is no real title available?)
- Predicate pairing for program verification
- Completeness of string analysis for dynamic languages
- Linear absolute value relation analysis
- A zonotopic framework for functional abstractions
- Pentagons: a weakly relational abstract domain for the efficient validation of array accesses
- Quantitative static analysis of communication protocols using abstract Markov chains
- Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints
- Numerical invariants through convex relaxation and max-strategy iteration
- Static analysis of communicating processes using symbolic transducers
- Block-wise abstract interpretation by combining abstract domains with SMT
- Lifting numeric relational domains to algebraic data types
- Proving termination by policy iteration
- Narrowing operators on template abstract domains
- Interval Polyhedra: An Abstract Domain to Infer Interval Linear Relationships
- From invariant checking to invariant inference using randomized search
- Neighborhood persistency of the linear optimization relaxation of integer linear optimization
- The abstract domain of trapezoid step functions
- Weakly-relational shapes for numeric abstractions: Improved algorithms and proofs of correctness
- An iterative method for generating loop invariants
- Acceleration of the abstract fixpoint computation in numerical program analysis
- Discovering invariants via simple component analysis
- Closing the performance gap between doubles and rationals for octagons
- Finding relevant templates via the principal component analysis
- An extension of lazy abstraction with interpolation for programs with arrays
- An iterative approach to precondition inference using constrained Horn clauses
- An abstract domain of uninterpreted functions
- Speeding up the constraint-based method in difference logic
- On integer closure in a system of unit two variable per inequality constraints
- Modelling declassification policies using abstract domain completeness
- Reachability analysis for timed automata using max-plus algebra
- Verification, Model Checking, and Abstract Interpretation
- Stabilizing Floating-Point Programs Using Provenance Analysis
- A faster algorithm for determining the linear feasibility of systems of BTVPI constraints
- Widening and narrowing operators for abstract interpretation
- Parameterized and exact-exponential algorithms for the read-once integer refutation problem in UTVPI constraints
- Counterexample- and simulation-guided floating-point loop invariant synthesis
- Splitting the Control Flow with Boolean Flags
- Decoupling the ascending and descending phases in abstract interpretation
- Constraint solving for interpolation
- Modular inference of subprogram contracts for safety checking
- A combinatorial algorithm for Horn programs
- Static analysis of ReLU neural networks with tropical polyhedra
- A polynomial time algorithm for read-once certification of linear infeasibility in UTVPI constraints
- A note on the inversion join for polyhedral analysis
- Sparsity preserving algorithms for octagons
- A scalable segmented decision tree abstract domain
- Static analysis of binary code with memory indirections using polyhedra
- Static Analysis
- Transformation-Enabled Precondition Inference
- Abstract interpretation from a denotational-semantics perspective
- Range and set abstraction using SAT
- Logics for extensional, locally complete analysis via domain refinements
- Octagon
- Constrained read-once refutations in UTVPI constraint systems: a parallel perspective
- Compact Difference Bound Matrices
- A flow-insensitive-complete program representation
- Relational string abstract domains
- Static analysis of run-time errors in embedded critical parallel C programs
- An abstract domain to discover interval linear equalities
- Simple and efficient algorithms for octagons
- A decision tree lifted domain for analyzing program families with numerical features
- Abstract neural networks
- Experimental evaluation of numerical domains for inferring ranges
- \textsf{TreeKs}: a functor to make numerical abstract domains scalable
- Static contract checking with abstract interpretation
- Modular constraint solver cooperation via abstract interpretation
- Abstract domains for automated reasoning about list-manipulating programs with infinite data
- An Optimal Algorithm for Computing the Integer Closure of UTVPI Constraints
- Inference in probabilistic logic programs using lifted explanations
- A Bit-Scaling Algorithm for Integer Feasibility in UTVPI Constraints
- Extracting program logics from abstract interpretations defined by logical relations
- An Abstract Domain Extending Difference-Bound Matrices with Disequality Constraints
- On the parametrized complexity of read-once refutations in UTVPI+ constraint systems
- Feasibility checking in Horn constraint systems through a reduction based approach
- Invertible linear transforms of numerical abstract domains
- Quadtrees as an abstract domain
- Automation of quantitative information-flow analysis
- Inferring functional properties of matrix manipulating programs by abstract interpretation
- Learning analysis strategies for Octagon and context sensitivity from labeled data generated by static analyses
- Descending chains and narrowing on template abstract domains
- Invariant inference with provable complexity from the monotone theory
- Verifying constant-time implementations by abstract interpretation
- Building certified static analysers by modular construction of well-founded lattices
This page was built for publication: The octagon abstract domain
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q853733)
