Automating Induction with an SMT Solver

Abstract

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… (More)
DOI: 10.1007/978-3-642-27940-9_21

Topics

3 Figures and Tables

Statistics

010202012201320142015201620172018
Citations per Year

64 Citations

Semantic Scholar estimates that this publication has 64 citations based on the available data.

See our FAQ for additional information.

Slides referencing similar topics