0
Your cart

Your cart is empty

Books > Computing & IT > Computer programming > Software engineering

Buy Now

On a Method of Multiprogramming (Hardcover, 1999 ed.) Loot Price: R4,452
Discovery Miles 44 520
On a Method of Multiprogramming (Hardcover, 1999 ed.): W.H.J. Feijen

On a Method of Multiprogramming (Hardcover, 1999 ed.)

W.H.J. Feijen; Foreword by D. Gries; A.J.M. van Gasteren

Series: Monographs in Computer Science

 (sign in to rate)
Loot Price R4,452 Discovery Miles 44 520 | Repayment Terms: R417 pm x 12*

Bookmark and Share

Expected to ship within 12 - 17 working days

Here, the authors propose a method for the formal development of parallel programs - or multiprograms as they prefer to call them. They accomplish this with a minimum of formal gear, i.e. with the predicate calculus and the well- established theory of Owicki and Gries. They show that the Owicki/Gries theory can be effectively put to work for the formal development of multiprograms, regardless of whether these algorithms are distributed or not.

General

Imprint: Springer-Verlag New York
Country of origin: United States
Series: Monographs in Computer Science
Release date: June 1999
First published: 1999
Authors: W.H.J. Feijen
Foreword by: D. Gries
Authors: A.J.M. van Gasteren
Dimensions: 235 x 155 x 28mm (L x W x T)
Format: Hardcover
Pages: 370
Edition: 1999 ed.
ISBN-13: 978-0-387-98870-2
Categories: Books > Computing & IT > General theory of computing > Data structures
Books > Computing & IT > Computer programming > Algorithms & procedures
Books > Computing & IT > Computer programming > Software engineering
Books > Computing & IT > Computer hardware & operating systems > Operating systems & graphical user interfaces (GUIs) > General
LSN: 0-387-98870-X
Barcode: 9780387988702

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Partners