Proof Systems for Structured Specifications and Their Refinements
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].
Unable to display preview. Download preview PDF.