Proof Systems for Structured Specifications and Their Refinements

  • Michel Bidoit
  • María Victoria Cengarle
  • Rolf Hennicker
Part of the IFIP State-of-the-Art Reports book series (IFIP)

Abstract

Reasoning about specifications is one of the fundamental activities in the process of formal program development. This ranges from proving the consequences of a specification, during the prototyping or testing phase for a requirements specification, to proving the correctness of refinements (or implementations) of specifications. The main proof techniques for algebraic specifications have their origin in equational Horn logic and term rewriting. These proof methods have been well studied in the case of nonstructured specifications (see Chapters 9 and 10). For large systems of specifications built using the structuring operators of specification languages, relatively few proof techniques have been developed yet; for such proof systems, see [SB83, HST94, Wir93, Far92, Cen94, HWB97].

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© IFIP International Federation for Information Processing 1999

Authors and Affiliations

  • Michel Bidoit
    • 1
  • María Victoria Cengarle
    • 2
  • Rolf Hennicker
    • 3
  1. 1.LSV,CNRS and ENS de CachanCachan CedexFrance
  2. 2.Institut fÜr InformatikLudwig-Maximilians-Universität MÜnchenMÜnchenGermany
  3. 3.Institut fÜr InformatikLudwig-Maximilians-Universität MÜnchenMÜnchenGermany

Personalised recommendations