The following pages link to The octagon abstract domain (Q853733):
Displaying 50 items.
- Octagon (Q25616) (← links)
- A generic framework for heap and value analyses of object-oriented programming languages (Q278744) (← links)
- A pre-order relation for exact schedulability test of sporadic tasks on multiprocessor global fixed-priority scheduling (Q283177) (← links)
- Inverse-limit and topological aspects of abstract interpretation (Q418811) (← links)
- Acceleration of the abstract fixpoint computation in numerical program analysis (Q435974) (← links)
- Discovering invariants via simple component analysis (Q435979) (← links)
- Reachability analysis for timed automata using max-plus algebra (Q444476) (← links)
- An extension of lazy abstraction with interpolation for programs with arrays (Q479820) (← links)
- On regions and zones for event-clock automata (Q487253) (← links)
- From invariant checking to invariant inference using randomized search (Q518404) (← links)
- A combinatorial certifying algorithm for linear feasibility in UTVPI constraints (Q527418) (← links)
- Modular inference of subprogram contracts for safety checking (Q604392) (← links)
- Constraint solving for interpolation (Q604394) (← links)
- The two variable per inequality abstract domain (Q656848) (← links)
- Automatic synthesis of \(k\)-inductive piecewise quadratic invariants for switched affine control programs (Q681342) (← links)
- Effective abstractions for verification under relaxed memory models (Q681346) (← links)
- Inference of ranking functions for proving temporal properties by abstract interpretation (Q681349) (← links)
- An array content static analysis based on non-contiguous partitions (Q681352) (← links)
- Scalable polyhedral verification of recurrent neural networks (Q832168) (← links)
- Weakly-relational shapes for numeric abstractions: Improved algorithms and proofs of correctness (Q845242) (← links)
- Why does Astrée scale up? (Q845249) (← links)
- The octagon abstract domain (Q853733) (← links)
- Pentagons: a weakly relational abstract domain for the efficient validation of array accesses (Q988565) (← links)
- Integration of verification methods for program systems (Q1040327) (← links)
- Sparsity preserving algorithms for octagons (Q1650959) (← links)
- Descending chains and narrowing on template abstract domains (Q1671249) (← links)
- A certifying algorithm for lattice point feasibility in a system of UTVPI constraints (Q1702822) (← links)
- Incremental closure for systems of two variables per inequality (Q1733055) (← links)
- The abstract domain of trapezoid step functions (Q1749121) (← links)
- Learning analysis strategies for Octagon and context sensitivity from labeled data generated by static analyses (Q1791273) (← links)
- Inferring functional properties of matrix manipulating programs by abstract interpretation (Q1791274) (← links)
- On integer closure in a system of unit two variable per inequality constraints (Q2023870) (← links)
- A decision tree lifted domain for analyzing program families with numerical features (Q2044175) (← links)
- On the parametrized complexity of Read-once refutations in UTVPI+ constraint systems (Q2049975) (← links)
- Completeness of string analysis for dynamic languages (Q2051812) (← links)
- Experimental evaluation of numerical domains for inferring ranges (Q2130561) (← links)
- Static analysis of ReLU neural networks with tropical polyhedra (Q2145325) (← links)
- Relational string abstract domains (Q2152641) (← links)
- A flow-insensitive-complete program representation (Q2152650) (← links)
- Verifying constant-time implementations by abstract interpretation (Q2167720) (← links)
- Analyzing fractional Horn constraint systems (Q2205946) (← links)
- Data flow analysis of asynchronous systems using infinite abstract domains (Q2233447) (← links)
- Abstract neural networks (Q2233525) (← links)
- Counterexample- and simulation-guided floating-point loop invariant synthesis (Q2233532) (← links)
- Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints (Q2235285) (← links)
- Numerical invariants through convex relaxation and max-strategy iteration (Q2248100) (← links)
- Widening and narrowing operators for abstract interpretation (Q2275526) (← links)
- Quantitative static analysis of communication protocols using abstract Markov chains (Q2322314) (← links)
- A new abstraction framework for affine transformers (Q2322316) (← links)
- Incrementally closing octagons (Q2335904) (← links)
