The following pages link to Octagon (Q25616):
Displaying 20 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)
- Fully Bounded Polyhedral Analysis of Integers with Wrapping (Q5170176) (← links)
- Logic Programming (Q5191488) (← links)
- Extracting Program Logics From Abstract Interpretations Defined by Logical Relations (Q5262946) (← links)
