Pages that link to "Item:Q938300"
From MaRDI portal
The following pages link to Inference rules for proving the equivalence of recursive procedures (Q938300):
Displaying 13 items.
- Program equivalence by circular reasoning (Q493521) (← links)
- A language-independent proof system for full program equivalence (Q510898) (← links)
- Proving mutual termination (Q746783) (← links)
- Automating regression verification of pointer programs by predicate abstraction (Q1650864) (← links)
- Bridging arrays and ADTs in recursive proofs (Q2233489) (← links)
- Abstract semantic diffing of evolving concurrent programs (Q2322311) (← links)
- Regression Verification for Multi-threaded Programs (Q2891406) (← links)
- Modular Verification of Procedure Equivalence in the Presence of Memory Allocation (Q2988675) (← links)
- Inference Rules for Proving the Equivalence of Recursive Procedures (Q3587255) (← links)
- Predicate Pairing for program verification (Q4644353) (← links)
- Verifying Procedural Programs via Constrained Rewriting Induction (Q5278212) (← links)
- Regression verification for multi-threaded programs (with extensions to locks and dynamic thread creation) (Q5962972) (← links)
- Analysis and Transformation of Constrained Horn Clauses for Program Verification (Q6063893) (← links)
