Pages that link to "Item:Q681335"
From MaRDI portal
The following pages link to Horn clause verification with convex polyhedral abstraction and tree automata-based refinement (Q681335):
Displaying 7 items.
- An iterative approach to precondition inference using constrained Horn clauses (Q4559813) (← links)
- Predicate Pairing for program verification (Q4644353) (← links)
- Tree dimension in verification of constrained Horn clauses (Q4644355) (← links)
- (Q5015369) (← links)
- (Q5114418) (← links)
- Transformation-Enabled Precondition Inference (Q6063861) (← links)
- Analysis and Transformation of Constrained Horn Clauses for Program Verification (Q6063893) (← links)