Abstract
In this short synthesis, we have shown that the theory of software construction exists and begins to be applied.
This theory has its own techniques which are quite different from those of the programming theory; in fact, we have not spoken of recursivity or algorithmics; on the other hand, we spoke of proofs.
The design of a software system might be nothing else but the proof of its construction.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Abrial J.R. 1988 Formal Introduction to Set Notations.
Abrial J.R. 1988 Abstract Machines: Basic Concepts
Abrial J.R. 1988 Abstract Machines: Programming Concepts
Abrial J.R. 1988 Abstract Machines: Refinement
Boom H.J. 1982 A weaker precondition for loops. ACM TOPLAS 4
Dijkstra E.W. 1976 A discipline of programming. (Prentice-Hall)
Dijkstra E.W. 1982 The equivalence of bounded nondeterminacy and continuity. In Selected writings on computing: a personal perspective (Springer-Verlag)
Dijkstra E.W. 1986 A simple fixpoint argument without the restriction to continuity. University of Austin, Texas
Gries D. 1985 A new notion of encapsulation. SIGPLAN Notices July 1985
He J. et al. 1986 Data refinement refined. PRG Oxford University
Hehner E.C.R. 1984 Predicative programming part 1. Comm. ACM 27
Hoare C.A.R. 1985 Programs are predicates. In Mathematical Logic and Programming Languages (Prentice-Hall)
Jones C.B. 1986 Systematic software development using VDM. (Prentice-Hall)
Kowalski R. 1985 The relation between logic programming and logic specification. In Mathematical Logic and Programming Languages (Prentice-Hall)
Morgan C. 1986 The specification statement. PRG Oxford University
Morris J.M. 1986 A theoretical basis for stepwise refinement and the programming calculus. University College, Dublin
Nelson G. 1987 A generalization of Dijkstra's calculus. DEC Systems Research Center Palo Alto, California
Robinson K. 1986 From specifications to programs. PRG Oxford University
Turner D.A. 1985 Functional programs as executable specifications. In Mathematical Logic and Programming Languages (Prentice-Hall)
Wirth N. 1971 Program development by stepwise refinement. Comm. ACM 14
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Abrial, J.R. (1989). A formal approach to large SOFTWARE CONSTRUCTION. In: van de Snepscheut, J.L.A. (eds) Mathematics of Program Construction. MPC 1989. Lecture Notes in Computer Science, vol 375. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51305-1_1
Download citation
DOI: https://doi.org/10.1007/3-540-51305-1_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51305-6
Online ISBN: 978-3-540-46191-3
eBook Packages: Springer Book Archive