A modular static analysis approach to affine loop invariants detection
From MaRDI portal
Recommendations
Cites work
- A calculus of durations
- A modular static analysis approach to affine loop invariants detection
- Calculating exact transitive closure for a normalized affine integer tuple relation
- Finite Differencing of Computable Expressions
- Guided Static Analysis
- scientific article; zbMATH DE number 830853 (Why is no real title available?)
- Program verification as probabilistic inference
- Proving safety properties of infinite state systems by compilation into Presburger arithmetic
Cited in
(12)- Convergence: integrating termination and abort-freedom
- Using basis dependence distance vectors in the modified Floyd-Warshall algorithm
- Computing invariants with transformers: experimental scalability and accuracy
- A modular static analysis approach to affine loop invariants detection
- Using basis dependence distance vectors to calculate the transitive closure of dependence relations by means of the Floyd-Warshall algorithm
- Loop Summarization Using Abstract Transformers
- Applying abstract acceleration to (co-)reachability analysis of reactive programs
- A New Invariant Rule for the Analysis of Loops with Non-standard Control Flows
- Convex invariant refinement by control node splitting: a heuristic approach
- Automatic modular abstractions for linear constraints
- Invariant relations for affine loops
- Algebraic program analysis
This page was built for publication: A modular static analysis approach to affine loop invariants detection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2814096)