The KeY System 1.0 (Deduction Component)

Bernhard Beckert, Martin Giese, P. H. Schmitt, Vladimir Klebanov, P. Rümmer, R. Hähnle

Research output: Chapter in Book/Report/Conference proceedingConference proceedingspeer-review

Abstract

The KeY system is a development of the ongoing KeY project, whose aim is to integrate formal specification and deductive verification into the industrial software engineering processes. The deductive component of the KeY system is a novel interactive/automated prover for first-order Dynamic Logic for Java. The KeY prover features a user-friendly graphical interface, a backtracking-free free-variable sequent calculus, a simple and powerful theory formalization language called “taclets,” solution procedures for linear and non-linear integer arithmetic, external theorem prover integration, and facilities for proof reuse, among other aspects. The system is publicly available.
Original languageEnglish
Title of host publicationProceedings of CADE-21, Bremen
Editors Frank Pfenning
Place of PublicationHeidelberg
PublisherSpringer
Pages379-384
Number of pages6
Volume4603
ISBN (Print)978-3-540-73594-6
Publication statusPublished - 2007

Publication series

NameLecture Notes in Computer Science (LNCS)

Fields of science

  • 101 Mathematics
  • 101001 Algebra
  • 101005 Computer algebra
  • 101009 Geometry
  • 101012 Combinatorics
  • 101013 Mathematical logic
  • 101020 Technical mathematics

Cite this