Cited in
(23)- Combinatorial abstraction refinement for feasibility analysis of static priorities
- Optimization and analysis of decision trees and rules: dynamic programming approach
- Sound non-statistical clustering of static analysis alarms
- Abstract Interpretation as Automated Deduction
- Refining abstract interpretations
- SubPolyhedra: A (More) Scalable Approach to Infer Linear Inequalities
- Horn clause verification with convex polyhedral abstraction and tree automata-based refinement
- Improving the results of program analysis by abstract interpretation beyond the decreasing sequence
- Refinement of Trace Abstraction
- Apron
- ARMC
- TRACER
- Interproc
- InvGen
- IKOS
- Why does Astrée scale up?
- DyTa
- Bugbench
- Ultimate Taipan
- Non-monotonic refinement of control abstraction for concurrent programs
- Abstract interpretation as automated deduction
- An iterative approach to precondition inference using constrained Horn clauses
- Automatically Refining Abstract Interpretations
This page was built for software: Dagger
