Abstract
In this paper generic software development steps of different complexity are represented and verified using the (higher-order, strongly typed) specification and verification system PVS. The transformations considered in this paper include “large” powerful steps encoding general algorithmic paradigms as well as “smaller” transformations for the operationalization of a descriptive specification. The application of these transformation patterns is illustrated by means of simple examples. Furthermore, we show how to guide proofs of correctness assertions about development steps. Finally, this work serves as a case-study and test for the usefulness of the PVS system.
Part of the research reported herein has been funded by the German Federal Ministry of Research and Technology (BMFT) under contract no. 01 IS 203 K5 (KORSO).
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
A. Dold. Formalisierung schematischer Algorithmen. Technical Report UIB-94-10, Fakultät für Informatik, Universität Ulm, January 1994.
The CIP Language Group. The Munich Project CIP, Volume I: The Wide Spectrum Language CIP-L. LNCS 183. Springer-Verlag, 1985.
The CIP System Group. The Munich Project CIP — Volume II: The Program Transformation System CIP-S. LNCS 292. Springer-Verlag, 1987.
G. Huet and B. Lang. Proving and Applying Program Transformations Expressed with Second-Order-Patterns. Acta Informatica, 11:31–55, 1978.
C. Kreitz. Metasynthesis — Deriving Programs that Develop Programs. Technical Report AIDA-93-03, Fachgebiet Intellektik, Technische Hochschule Darmstadt, 1993.
Z. Luo and R. Pollack. LEGO Proof Development System: User's Manual. University of Edinburgh, May 1992.
S. Owre, J. M. Rushby, and N. Shankar. PVS: A Prototype Verification System. In Deepak Kapur, editor, 11th International Conference on Automated Deduction (CADE), volume 607 of Lecture Notes in Artificial Intelligence, pages 748–752, Saratoga, NY, 1992. Springer-Verlag.
S. Owre, N. Shankar, and J.M. Rushby. The PVS Proof Checker: A Reference Manual. Computer Science Laboratory, SRI International, Menlo Park, CA, February 1993.
S. Owre, N. Shankar, and J.M. Rushby. User Guide for the PVS Specification and Verification System. Computer Science Laboratory, SRI International, Menlo Park, CA, February 1993.
H.A. Partsch. Specification and Transformation of Programs. Springer-Verlag, 1990.
H. Rueβ. Metaprogrammierung in einer typtheoretischen Umgebung. PhD thesis, Universität Ulm, Abt. KI, to appear in 1995.
Douglas R. Smith. Applications of a Strategy for Designing Divide-and-Conquer-Algorithms. Science of Computer Programming, (8):213–229, 1987.
Douglas R. Smith. Structure and Design of Global Search Algorithms. Technical Report KES.U.87.12, Kestrel Institute, Palo Alto, CA, 1987.
Douglas R. Smith and Michael R. Lowry. Algorithm Theories and Design Tactics. Science of Computer Programming, (14):305–321, 1990.
F.W. von Henke, A. Dold, H. Rueß, D. Schwier, and M. Strecker. Construction and Deduction Methods for the Formal Development of Software. In M. Broy and S. Jähnichen, editors, KORSO, Correct Software by Formal Methods. Springer-Verlag, Lecture Notes in Computer Science, to appear in 1995, also available as Technical Report UIB-94-09, Fakultät für Informatik, Universität Ulm.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dold, A. (1995). Representing, verifying and applying software development steps using the PVS system. In: Alagar, V.S., Nivat, M. (eds) Algebraic Methodology and Software Technology. AMAST 1995. Lecture Notes in Computer Science, vol 936. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60043-4_69
Download citation
DOI: https://doi.org/10.1007/3-540-60043-4_69
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60043-5
Online ISBN: 978-3-540-49410-2
eBook Packages: Springer Book Archive