000 03969nam a22005895i 4500
001 978-3-540-35312-6
003 DE-He213
005 20160624101931.0
007 cr nn 008mamaa
008 121227s1979 gw | s |||| 0|eng d
020 _a9783540353126
_9978-3-540-35312-6
024 7 _a10.1007/BFb0014649
_2doi
050 4 _aQA75.5-76.95
072 7 _aUY
_2bicssc
072 7 _aCOM014000
_2bisacsh
082 0 4 _a004
_223
245 1 0 _aProgram Construction
_h[electronic resource] :
_bInternational Summer School /
_cedited by Friedrich L. Bauer, Manfred Broy, 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.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1979.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1979.
300 _aX, 654 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v69
505 0 _aA 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.
650 0 _aComputer science.
650 1 4 _aComputer Science.
650 2 4 _aComputer Science, general.
700 1 _aBauer, Friedrich L.
_eeditor.
700 1 _aBroy, Manfred.
_eeditor.
700 1 _aDijkstra, E. W.
_eeditor.
700 1 _aGerhart, S. L.
_eeditor.
700 1 _aGries, D.
_eeditor.
700 1 _aGriffiths, M.
_eeditor.
700 1 _aGuttag, J. V.
_eeditor.
700 1 _aHorning, J. J.
_eeditor.
700 1 _aOwicki, S. S.
_eeditor.
700 1 _aPair, C.
_eeditor.
700 1 _aPartsch, H.
_eeditor.
700 1 _aPepper, P.
_eeditor.
700 1 _aWirsing, M.
_eeditor.
700 1 _aWössner, H.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540092513
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v69
856 4 0 _uhttp://dx.doi.org/10.1007/BFb0014649
942 _2EBK4152
_cEBK
999 _c33446
_d33446