A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
Mechanical proof assistants have always had support for inductive proofs. Sometimes an alternative to proof assistants, satisfiability modulo theories (SMT) solvers bring the hope of a higher degree of automation. However, SMT solvers do not natively support induction, so inductive proofs require some encoding into the SMT solver's input. This paper shows a surprisingly simple tactic-a rewriting strategy and a heuristic for when to apply it-that has shown to be useful in verifying simpledoi:10.1007/978-3-642-27940-9_21 fatcat:jghhbkqa7reknhxopc37vr5a7i