Deductive Software Verification – The KeY Book

Volume 10001 of the series Lecture Notes in Computer Science pp 107-147


Proof Search with Taclets

  • Philipp RümmerAffiliated withUppsala University
  • , Mattias UlbrichAffiliated withKarlsruhe Institute of Technology Email author 

* Final gross prices may vary according to local VAT.

Get Access


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.