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