Proof Search with Taclets

  • Philipp Rümmer
  • Mattias UlbrichEmail author
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10001)


This chapter covers the formalism of taclets by which inference rules can be formulated for the JavaDL sequent calculus employed in KeY. After an introductory tutorial, the syntax and semantics of the taclet language are described. Finally, techniques are presented to mechanically prove taclet soundness by deriving formulas from taclets whose validity entails the soundness.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing AG 2016

Authors and Affiliations

  1. 1.Uppsala UniversityUppsalaSweden
  2. 2.Karlsruhe Institute of TechnologyKarlsruheGermany

Personalised recommendations