Cited in
(40)- Multi-dimensional rankings, program termination, and complexity bounds of flowchart programs
- Practical policy iterations. A practical use of policy iterations for static analysis: the quadratic case
- Algebraic program analysis
- Acceleration of the abstract fixpoint computation in numerical program analysis
- Applying abstract acceleration to (co-)reachability analysis of reactive programs
- Computing invariants with transformers: experimental scalability and accuracy
- Automatic modular abstractions for template numerical constraints
- Termination Analysis of C Programs Using Compiler Intermediate Languages
- Some reflections on two current trends in formal argumentation
- Unbounded-time safety verification of guarded LTI models with inputs by abstract acceleration
- Improving the results of program analysis by abstract interpretation beyond the decreasing sequence
- Widening with Thresholds for Programs with Complex Control Graphs
- PAG
- Valigator
- TREX
- Dagger
- SPEED
- ABC
- LOOPUS
- aiT
- PAGAI
- ASTREE
- Octagon
- DynaMate
- IKOS
- ALICe
- FAST
- HySon
- STRONG
- HyLAA
- Convex invariant refinement by control node splitting: a heuristic approach
- Improving strategies via SMT solving
- Quantitative separation logic and programs with lists
- Lower runtime bounds for integer programs
- Abstract fixpoint computations with numerical acceleration methods
- Extending abstract acceleration methods to data-flow programs with numerical inputs
- Transfer function synthesis without quantifier elimination
- Descending chains and narrowing on template abstract domains
- Invariant generation through strategy iteration in succinctly represented control flow graphs
- Proving termination by policy iteration
This page was built for software: Aspic
