Pages that link to "Item:Q4559806"
From MaRDI portal
The following pages link to Solving Horn Clauses on Inductive Data Types Without Induction (Q4559806):
Displaying 11 items.
- 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)
- Asynchronous unfold/fold transformation for fixpoint logic (Q2163155) (← links)
- Bridging arrays and ADTs in recursive proofs (Q2233489) (← links)
- Solving Horn Clauses on Inductive Data Types Without Induction – ERRATUM (Q4957191) (← links)
- (Q5016384) (← links)
- (Q5020652) (← links)
- Verifying Catamorphism-Based Contracts using Constrained Horn Clauses (Q5038461) (← links)
- Fold/Unfold Transformations for Fixpoint Logic (Q5164174) (← links)
- ICE-based refinement type discovery for higher-order functional programs (Q5919002) (← links)
- Analysis and Transformation of Constrained Horn Clauses for Program Verification (Q6063893) (← links)
