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].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 IFIP International Federation for Information Processing
About this chapter
Cite this chapter
Bidoit, M., Cengarle, M.V., Hennicker, R. (1999). Proof Systems for Structured Specifications and Their Refinements. In: Astesiano, E., Kreowski, HJ., Krieg-Brückner, B. (eds) Algebraic Foundations of Systems Specification. IFIP State-of-the-Art Reports. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-59851-7_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-59851-7_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-64151-0
Online ISBN: 978-3-642-59851-7
eBook Packages: Springer Book Archive