Structured Specifications and Interactive Proofs with KIV

The aim of this chapter is to describe the integrated specification- and theorem proving environment of KIV. KIV is an advanced tool for developing high assurance systems. It supports: hierarchical formal specification of software and system designs specification of safety/security models proving properties of specifications modular implementation of specification components modular verification of implementations incremental verification and error correction reuse of specifications, proofs, and verified components

[1]  Michael J. C. Gordon,et al.  Edinburgh LCF: A mechanised logic of computation , 1979 .

[2]  M. Gordon.  HOL: A Proof Generating System for Higher-Order Logic , 1988 .

[3]  Robert Goldblatt,et al.  Axiomatising the Logic of Computer Programming , 1982, Lecture Notes in Computer Science.

[4]  Michael Fröhlich,et al.  Demonstration of the Interactive Graph-Visualization System da Vinci , 1994, GD.

[5]  Maritta Heisel,et al.  A Dynamic Logic for Program Verification , 1989, Logic at Botik.

[6]  Rance Cleaveland,et al.  Implementing mathematics with the Nuprl proof development system , 1986 .

[7]  Natarajan Shankar,et al.  PVS: A Prototype Verification System , 1992, CADE.

[8]  Peter E. Lauer,et al.  Functional Programming, Concurrency, Simulation and Automated Reasoning , 1993, Lecture Notes in Computer Science.

[9]  Mark Saaltink.  The Z/EVES System , 1997, ZUM.

[10]  Lawrence Charles Paulson,et al.  Isabelle: A Generic Theorem Prover , 1994 .

[11]  J. Strother Moore,et al.  An Industrial Strength Theorem Prover for a Logic Based on Common Lisp , 1997, IEEE Trans. Software Eng..

[12]  Peter Graf,et al.  Term Indexing , 1996, Lecture Notes in Computer Science.

[13]  P. S. Thiagarajan.  Foundation of Software Technology and Theoretical Computer Science , 1994, Lecture Notes in Computer Science.

[14]  Marie-Claude Gaudel,et al.  Structuring and Modularizing Algebraic Specifications: The PLUSS Specification Language, Evolutions and Perspectives , 1992, STACS.

[15]  Toby Walsh,et al.  Automated Deduction—CADE-11 , 1992, Lecture Notes in Computer Science.

[16]  Wolfgang Reif,et al.  Interactive correctness proofs for software modules using KIV , 1995, COMPASS '95 Proceedings of the Tenth Annual Conference on Computer Assurance Systems Integrity, Software Safety and Process Security'.

[17]  Maritta Heisel,et al.  Tactical Theorem Proving in Program Verification , 1990, CADE.

[18]  Frank van Harmelen,et al.  Extensions to the Rippling-Out Tactic for Guiding Inductive Proofs , 1990, CADE.

[19]  Robert S. Boyer,et al.  Computational Logic , 1990, ESPRIT Basic Research Series.

[20]  Kurt Stenzel,et al.  Reuse of Proofs in Software Verification , 1993, FSTTCS.

[21]  Peter D. Mosses.  CoFI: The Common Framework Initiative for Algebraic Specification , 1996, Bull. EATCS.

[22]  Wolfgang Reif,et al.  The KIV-Approach to Software Verification , 1995, KORSO Book.

[23]  Yves Bertot,et al.  CtCoq: A System Presentation , 1996, AMAST.

[24]  Manfred Broy,et al.  KORSO: Methods, Languages, and Tools for the Construction of Correct Software , 1995, Lecture Notes in Computer Science.

[25]  Stéphane Kaplan,et al.  A Compiler for Conditional Term Rewriting Systems , 1987, RTA.

[26]  Anil Nerode,et al.  Logical Foundations of Computer Science, International Symposium, LFCS 2009, Deerfield Beach, FL, USA, January 3-6, 2009. Proceedings , 1994, LFCS.

[27]  William M. Farmer,et al.  IMPS: An Updated System Description , 1996, CADE.

[28]  Wolfgang Reif.  Correctness of Generic Modules , 1992, LFCS.