Automatic Generation of Generalization Lemmas for Proving Properties of Tail-Recursive Definitions
From MaRDI portal
Publication:3559764
DOI10.1007/10930755_9zbMath1279.03034OpenAlexW2119454075MaRDI QIDQ3559764
Deepak Kapur, Nikita A. Sakhanenko
Publication date: 7 May 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/10930755_9
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
Verifying Procedural Programs via Constrained Rewriting Induction ⋮ Equivalence checking of two functional programs using inductive theorem provers
This page was built for publication: Automatic Generation of Generalization Lemmas for Proving Properties of Tail-Recursive Definitions
