Dagger
From MaRDI portal
Software:17100
swMATH4953MaRDI QIDQ17100FDOQ17100
Author name not available (Why is that?)
Cited In (14)
- Non-monotonic Refinement of Control Abstraction for Concurrent Programs
- Combinatorial abstraction refinement for feasibility analysis of static priorities
- Improving the results of program analysis by abstract interpretation beyond the decreasing sequence
- An iterative approach to precondition inference using constrained Horn clauses
- Sound Non-statistical Clustering of Static Analysis Alarms
- Optimization and analysis of decision trees and rules: dynamic programming approach
- Refinement of Trace Abstraction
- Abstract Interpretation as Automated Deduction
- Refining abstract interpretations
- SubPolyhedra: A (More) Scalable Approach to Infer Linear Inequalities
- Why does Astrée scale up?
- Abstract interpretation as automated deduction
- Automatically Refining Abstract Interpretations
- Horn clause verification with convex polyhedral abstraction and tree automata-based refinement
This page was built for software: Dagger
