Program Construction [electronic resource] : International Summer School / edited 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.

Contributor(s): Bauer, Friedrich L [editor.] | Broy, Manfred [editor.] | Dijkstra, E. W [editor.] | Gerhart, S. L [editor.] | Gries, D [editor.] | Griffiths, M [editor.] | Guttag, J. V [editor.] | Horning, J. J [editor.] | Owicki, S. S [editor.] | Pair, C [editor.] | Partsch, H [editor.] | Pepper, P [editor.] | Wirsing, M [editor.] | Wössner, H [editor.] | SpringerLink (Online service)Material type: TextTextSeries: Lecture Notes in Computer Science ; 69Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 1979Description: X, 654 p. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783540353126Subject(s): Computer science | Computer Science | Computer Science, generalAdditional physical formats: Printed edition:: No titleDDC classification: 004 LOC classification: QA75.5-76.95Online resources: Click here to access online
Contents:
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.
In: Springer eBooks
Item type: E-BOOKS
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Current library Home library Call number Materials specified URL Status Date due Barcode
IMSc Library
IMSc Library
Link to resource Available EBK4152

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.

There are no comments on this title.

to post a comment.
The Institute of Mathematical Sciences, Chennai, India

Powered by Koha