Aspic
From MaRDI portal
Software:17101
swMATH4954MaRDI QIDQ17101FDOQ17101
Author name not available (Why is that?)
Cited In (23)
- Termination Analysis of C Programs Using Compiler Intermediate Languages
- Some reflections on two current trends in formal argumentation
- Algebraic program analysis
- Quantitative separation logic and programs with lists
- Computing invariants with transformers: experimental scalability and accuracy
- Improving the results of program analysis by abstract interpretation beyond the decreasing sequence
- Proving termination by policy iteration
- Lower runtime bounds for integer programs
- Enforcing termination of interprocedural analysis
- Acceleration of the abstract fixpoint computation in numerical program analysis
- Applying abstract acceleration to (co-)reachability analysis of reactive programs
- Unbounded-time safety verification of guarded LTI models with inputs by abstract acceleration
- 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
- Widening with Thresholds for Programs with Complex Control Graphs
- Convex invariant refinement by control node splitting: a heuristic approach
- Descending chains and narrowing on template abstract domains
- Invariant generation through strategy iteration in succinctly represented control flow graphs
- Abstract fixpoint computations with numerical acceleration methods
- Extending abstract acceleration methods to data-flow programs with numerical inputs
- Improving strategies via SMT solving
- Automatic modular abstractions for template numerical constraints
- Transfer function synthesis without quantifier elimination
This page was built for software: Aspic
