The following pages link to Octagon (Q25616):
Displaying 50 items.
- Reachability analysis for timed automata using max-plus algebra (Q444476) (← links)
- Modular inference of subprogram contracts for safety checking (Q604392) (← links)
- Weakly-relational shapes for numeric abstractions: Improved algorithms and proofs of correctness (Q845242) (← links)
- Proof-carrying code from certified abstract interpretation and fixpoint compression (Q860842) (← links)
- Full simulation coverage for SystemC transaction-level models of systems-on-a-chip (Q1041294) (← links)
- Exact join detection for convex polyhedra and other numerical abstractions (Q2269830) (← links)
- A sparse evaluation technique for detailed semantic analyses (Q2339156) (← links)
- Donut Domains: Efficient Non-convex Domains for Abstract Interpretation (Q2891416) (← links)
- A Constraint Solver Based on Abstract Domains (Q2926656) (← links)
- Relational Thread-Modular Static Value Analysis by Abstract Interpretation (Q2938060) (← links)
- Safety Problems Are NP-complete for Flat Integer Programs with Octagonal Loops (Q2938069) (← links)
- Static Analysis of Run-Time Errors in Embedded Critical Parallel C Programs (Q3000591) (← links)
- Static Contract Checking with Abstract Interpretation (Q3067530) (← links)
- Two Variables per Linear Inequality as an Abstract Domain (Q3079912) (← links)
- Modelling declassification policies using abstract domain completeness (Q3103614) (← links)
- Invariant Generation through Strategy Iteration in Succinctly Represented Control Flow Graphs (Q3166219) (← links)
- Policy Iteration within Logico-Numerical Abstract Domains (Q3172921) (← links)
- (Q3499221) (← links)
- Splitting the Control Flow with Boolean Flags (Q3522080) (← links)
- An Abstract Interpretation Based Combinator for Modelling While Loops in Constraint Programming (Q3523062) (← links)
- Automatic Modular Abstractions for Template Numerical Constraints (Q3575308) (← links)
- Precise Relational Invariants Through Strategy Iteration (Q3608402) (← links)
- Logical Interpretation: Static Program Analysis Using Theorem Proving (Q3608771) (← links)
- Program Analysis Using Symbolic Ranges (Q3612010) (← links)
- Opaque Predicates Detection by Abstract Interpretation (Q3623927) (← links)
- An Abstract Domain to Discover Interval Linear Equalities (Q3656879) (← links)
- (Q4411954) (← links)
- (Q4414379) (← links)
- Solving Difference Constraints over Modular Arithmetic (Q4928440) (← links)
- Automatic Abstraction for Intervals Using Boolean Formulae (Q4930724) (← links)
- Interval Slopes as a Numerical Abstract Domain for Floating-Point Variables (Q4930725) (← links)
- Automatic Verification of Determinism for Structured Parallel Programs (Q4930747) (← links)
- Integrating Policy Iterations in Abstract Interpreters (Q5166691) (← links)
- Fully Bounded Polyhedral Analysis of Integers with Wrapping (Q5170176) (← links)
- Logic Programming (Q5191488) (← links)
- Automatic modular abstractions for linear constraints (Q5261513) (← links)
- Extracting Program Logics From Abstract Interpretations Defined by Logical Relations (Q5262946) (← links)
- (Q5295510) (← links)
- (Q5309034) (← links)
- (Q5310200) (← links)
- Algebraic Methodology and Software Technology (Q5312985) (← links)
- Algebraic Methodology and Software Technology (Q5312992) (← links)
- Programming Languages and Systems (Q5316570) (← links)
- Theories, solvers and static analysis by abstract interpretation (Q5395699) (← links)
- Abstract acceleration of general linear loops (Q5408447) (← links)
- An Abstract Domain to Infer Ordinal-Valued Ranking Functions (Q5410712) (← links)
- An Abstract Domain Extending Difference-Bound Matrices with Disequality Constraints (Q5452614) (← links)
- The Constraint Database Approach to Software Verification (Q5452618) (← links)
- Non-disjunctive Numerical Domain for Array Predicate Abstraction (Q5458394) (← links)
- Static Analysis Via Abstract Interpretation of the Happens-Before Memory Model (Q5458814) (← links)
