Pages that link to "Item:Q3613375"
From MaRDI portal
The following pages link to Static Analysis of Numerical Algorithms (Q3613375):
Displaying 13 items.
- Acceleration of the abstract fixpoint computation in numerical program analysis (Q435974) (← links)
- Polynomial function intervals for floating-point software verification (Q457251) (← links)
- Enhancing the implementation of mathematical formulas for fixed-point and floating-point arithmetics (Q845241) (← links)
- Efficient SAT-based bounded model checking for software verification (Q947794) (← links)
- Sparsity preserving algorithms for octagons (Q1650959) (← links)
- Formal verification of numerical programs: from C annotated programs to mechanical proofs (Q1949765) (← links)
- Formal analysis of the compact position reporting algorithm (Q1996426) (← links)
- A formally verified floating-point implementation of the compact position reporting algorithm (Q2024357) (← links)
- Donut Domains: Efficient Non-convex Domains for Abstract Interpretation (Q2891416) (← links)
- Static Analysis of Finite Precision Computations (Q3075485) (← links)
- Bracketing backward reach sets of a dynamical system (Q3386553) (← links)
- Proving the Correctness of the Implementation of a Control-Command Algorithm (Q3392923) (← links)
- A zonotopic framework for functional abstractions (Q5962973) (← links)
