Pages that link to "Item:Q2164260"
From MaRDI portal
The following pages link to Automating induction for solving Horn clauses (Q2164260):
Displaying 15 items.
- Constraint-based relational verification (Q832229) (← links)
- Removing algebraic data types from constrained Horn clauses using difference predicates (Q2096439) (← links)
- Symbolic automatic relations and their applications to SMT and CHC solving (Q2145347) (← links)
- Loop verification with invariants and contracts (Q2152642) (← links)
- Asynchronous unfold/fold transformation for fixpoint logic (Q2163155) (← links)
- On transforming cut- and quantifier-free cyclic proofs into rewriting-induction proofs (Q2163179) (← links)
- Bridging arrays and ADTs in recursive proofs (Q2233489) (← links)
- Unbounded procedure summaries from bounded environments (Q2234080) (← links)
- (Q5016382) (← links)
- (Q5016384) (← links)
- (Q5020652) (← links)
- Relational cost analysis in a functional-imperative setting (Q5020903) (← links)
- Verifying Catamorphism-Based Contracts using Constrained Horn Clauses (Q5038461) (← links)
- Fold/Unfold Transformations for Fixpoint Logic (Q5164174) (← links)
- Analysis and Transformation of Constrained Horn Clauses for Program Verification (Q6063893) (← links)
