|
|
|
|
| LEADER |
02997nmm a2200301 u 4500 |
| 001 |
EB000652784 |
| 003 |
EBX01000000000000000505866 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
140122 ||| eng |
| 020 |
|
|
|a 9783540353126
|
| 100 |
1 |
|
|a Bauer, F.L.
|
| 245 |
0 |
0 |
|a Program Construction
|h Elektronische Ressource
|b International Summer School
|c by F.L. Bauer, E.W. Dijkstra, S.L. Gerhart, D. Gries, M. Griffiths, J. V. Guttag, J. J. Horning, S. S. Owicki, C. Pair, H. Partsch, P. Pepper, M. Wirsing, H. Wössner ; edited by F.L. Bauer, M. Broy
|
| 250 |
|
|
|a 1st ed. 1979
|
| 260 |
|
|
|a Berlin, Heidelberg
|b Springer Berlin Heidelberg
|c 1979, 1979
|
| 300 |
|
|
|a X, 654 p
|b online resource
|
| 505 |
0 |
|
|a A more formal treatment of a less simple example -- Stationary behaviour of some ternary networks -- Finding the correctness proof of a concurrent program -- On the interplay between mathematics and programming -- A theorem about odd powers of odd integers -- In honour of Fibonacci -- On the foolishness of "natural language programming" -- Program inversion -- The Schorr-Waite graph marking algorithm -- Eliminating the chaff -- Proofs, programs and their development — The axiomatic approach -- Current ideas in programming methodology -- Basic axiomatic definitions -- The multiple assignment statement -- Is sometimes ever better than always? -- A case study in language design: Euclid -- Proof rules for the programming language Euclid -- Verification of Euclid programs -- Specifications and proofs for abstract data types in concurrent programs -- Specification and verification of a network mail system -- From specification to implementation — The formal approach -- Program development by stepwise transformations — The project CIP -- Systematics of transformation rules -- Special transformation techniques -- A study on transformational semantics -- Detailization and lazy evaluation, infinite objects and pointer representation -- Examples for change of types and object structures -- Development of the Schorr-Waite algorithm -- A derivation-oriented proof of the Schorr-Waite marking algorithm -- Languages as tools — Interactive program construction -- Programing languages for reliable computing systems -- Programming methodology and language implications -- Towards a wide spectrum language to support program specification and program development -- Semantics of nondeterministic and noncontinuous constructs -- Notes on type abstraction -- Some theoretical aspects of program construction
|
| 653 |
|
|
|a Programming Techniques
|
| 653 |
|
|
|a Computer programming
|
| 700 |
1 |
|
|a Dijkstra, E.W.
|e [author]
|
| 700 |
1 |
|
|a Gerhart, S.L.
|e [author]
|
| 700 |
1 |
|
|a Gries, D.
|e [author]
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b SBA
|a Springer Book Archives -2004
|
| 490 |
0 |
|
|a Lecture Notes in Computer Science
|
| 028 |
5 |
0 |
|a 10.1007/BFb0014649
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/BFb0014649?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 005.11
|