Abstract
Mathematical induction is required for reasoning about objects or events containing repetition, e.g. computer programs with recursion or iteration, electronic circuits with feedback loops or parameterized components, and properties that hold for all time forward. It is thus a vital ingredient of formal methods techniques for synthesizing, verifying and transforming software and hardware. The automation of proof by induction strengthens the capabilities of mechanical assistants, it reduces the need for designers to be skilled in mathematical proof techniques, and it improves productivity by automating tedious and error-prone aspects of formal system development. This workshop is organized around four sessions.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schürmann, C. (2000). Workshop: Automation of Proof by Mathematical Induction. In: McAllester, D. (eds) Automated Deduction - CADE-17. CADE 2000. Lecture Notes in Computer Science(), vol 1831. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10721959_46
Download citation
DOI: https://doi.org/10.1007/10721959_46
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67664-5
Online ISBN: 978-3-540-45101-3
eBook Packages: Springer Book Archive