The following pages link to The octagon abstract domain (Q853733):
Displaying 50 items.
- Incrementally closing octagons (Q2335904) (← links)
- A sparse evaluation technique for detailed semantic analyses (Q2339156) (← links)
- The octagon abstract domain for continuous constraints (Q2342596) (← links)
- Feasibility checking in Horn constraint systems through a reduction based approach (Q2344728) (← links)
- Automatically proving termination and memory safety for programs with pointer arithmetic (Q2362494) (← links)
- A polynomial time algorithm for read-once certification of linear infeasibility in UTVPI constraints (Q2415363) (← links)
- A combinatorial algorithm for Horn programs (Q2445839) (← links)
- Integer feasibility and refutations in UTVPI constraints using bit-scaling (Q2684489) (← links)
- Simple and Efficient Algorithms for Octagons (Q2789052) (← links)
- An Abstract Domain of Uninterpreted Functions (Q2796038) (← links)
- An Optimal Algorithm for Computing the Integer Closure of UTVPI Constraints (Q2803820) (← links)
- Abstract interpretation from a denotational-semantics perspective (Q2805148) (← links)
- Range and set abstraction using SAT (Q2814098) (← links)
- Relational abstract domain of weighted hexagons (Q2814105) (← links)
- Quadtrees as an abstract domain (Q2814109) (← links)
- A note on the inversion join for polyhedral analysis (Q2814111) (← links)
- Speeding up the Constraint-Based Method in Difference Logic (Q2818021) (← links)
- A Bit-Scaling Algorithm for Integer Feasibility in UTVPI Constraints (Q2819515) (← links)
- Abstract Domains for Automated Reasoning about List-Manipulating Programs with Infinite Data (Q2891398) (← links)
- Interprocedural Reachability for Flat Integer Programs (Q2947875) (← links)
- Static Analysis of Communicating Processes Using Symbolic Transducers (Q2961555) (← links)
- Stabilizing Floating-Point Programs Using Provenance Analysis (Q2961567) (← links)
- Block-Wise Abstract Interpretation by Combining Abstract Domains with SMT (Q2961574) (← links)
- Finding Relevant Templates via the Principal Component Analysis (Q2961584) (← links)
- Sound Bit-Precise Numerical Domains (Q2961585) (← links)
- Linear Absolute Value Relation Analysis (Q3000578) (← links)
- Improving Strategies via SMT Solving (Q3000582) (← links)
- Static Analysis of Run-Time Errors in Embedded Critical Parallel C Programs (Q3000591) (← links)
- An Iterative Method for Generating Loop Invariants (Q3004678) (← links)
- Static Contract Checking with Abstract Interpretation (Q3067530) (← links)
- Access Analysis-Based Tight Localization of Abstract Memories (Q3075495) (← links)
- Modelling declassification policies using abstract domain completeness (Q3103614) (← links)
- Symbolic Model Checking in Non-Boolean Domains (Q3176389) (← links)
- Interval Polyhedra: An Abstract Domain to Infer Interval Linear Relationships (Q3392932) (← links)
- Abstract Interpretation with Applications to Timing Validation (Q3512479) (← links)
- Splitting the Control Flow with Boolean Flags (Q3522080) (← links)
- A Scalable Segmented Decision Tree Abstract Domain (Q3587252) (← links)
- Iterating Octagons (Q3617767) (← links)
- Logahedra: A New Weakly Relational Domain (Q3648708) (← links)
- An iterative approach to precondition inference using constrained Horn clauses (Q4559813) (← links)
- Horn clauses as an intermediate representation for program analysis and transformation (Q4592995) (← links)
- Predicate Pairing for program verification (Q4644353) (← links)
- Constructive Galois Connections (Q4972068) (← links)
- Computing Program Reliability Using Forward-Backward Precondition Analysis and Model Counting (Q5039530) (← links)
- Compact Difference Bound Matrices (Q5056006) (← links)
- Three improvements to the top-down solver (Q5084314) (← links)
- Modular Constraint Solver Cooperation via Abstract Interpretation (Q5140021) (← links)
- The Abstract Domain of Parallelotopes (Q5170166) (← links)
- Access-Based Localization for Octagons (Q5170168) (← links)
- TreeKs: A Functor to Make Numerical Abstract Domains Scalable (Q5170170) (← links)
