The goal of this book is to provide a comprehensive and systematic introduction to the important and highly applicable method of data refinement and the simulation methods used for proving its correctness. The authors concentrate in the first part on the general principles needed to prove data refinement correct. They begin with an explanation of the fundamental notions, showing that data refinement proofs reduce to proving simulation. The topics of Hoare Logic and the Refinement Calculus are introduced and a general theory of simulations is developed and related to them. Accessibility and comprehension are emphasized in order to guide newcomers to the area. The book's second part contains a detailed survey of important methods in this field, such as VDM, and the methods due to Abadi & Lamport, Hehner, Lynch and Reynolds, Back's refinement calculus and Z. All these methods are carefully analysed, and shown to be either imcomplete, with counterexamples to their application, or to be always applicable whenever data refinement holds. This is shown by proving, for the first time, that all these methods can be described and analyzed in terms of two simple notions: forward and backward simulation. The book is self-contained, going from advanced undergraduate level and taking the reader to the state of the art in methods for proving simulation.
"synopsis" may belong to another edition of this title.
This is a comprehensive and systematic account of the important and highly applicable method of data refinement, which is one of the most powerful formal methods for system development. The authors concentrate on principles and begin with an explanation of the fundamental notions behind data refinement and simulation. Accessibility and comprehension are emphasised in order to guide newcomers to the area. The remaining chapters are comparitive in nature, looking at a variety of formal methods and how they may be best applied.The book is self-contained, going from advanced undergraduate level but taking the reader to the state-of-the-art in methods for proving simulation.
"The presentation of the theory is backed up by some substantial examples...and this together with the extensive historical notes makes the book an extremely useful reference manual and graduate text."
"About this title" may belong to another edition of this title.
Seller: BennettBooksLtd, Los Angeles, CA, U.S.A.
hardcover. Condition: New. In shrink wrap. Looks like an interesting title! Seller Inventory # Q-0521641705
Seller: Better World Books: West, Reno, NV, U.S.A.
Condition: Very Good. Pages intact with possible writing/highlighting. Binding strong with minor wear. Dust jackets/supplements may not be included. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good. Seller Inventory # 68240794-75
Seller: California Books, Miami, FL, U.S.A.
Condition: New. Seller Inventory # I-9780521641708
Seller: Books Puddle, Woodside, NY, U.S.A.
Condition: New. Print on Demand pp. 436. Seller Inventory # 26261218
Seller: Majestic Books, Hounslow, United Kingdom
Condition: New. Print on Demand pp. 436 18 Illus. Seller Inventory # 7619517
Quantity: 4 available
Seller: Biblios, Frankfurt am main, HESSE, Germany
Condition: New. PRINT ON DEMAND pp. 436. Seller Inventory # 18261224
Quantity: 4 available
Seller: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Ireland
Condition: New. Graduate text in formal methods in computer science. Series: Cambridge Tracts in Theoretical Computer Science. Num Pages: 436 pages, 18 b/w illus. 93 exercises. BIC Classification: UN; UYA. Category: (P) Professional & Vocational. Dimension: 247 x 174 x 29. Weight in Grams: 845. . 1998. hardcover. . . . . Seller Inventory # V9780521641708
Quantity: Over 20 available
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Condition: New. In English. Seller Inventory # ria9780521641708_new
Quantity: Over 20 available
Seller: CitiRetail, Stevenage, United Kingdom
Hardcover. Condition: new. Hardcover. The goal of this book is to provide a comprehensive and systematic introduction to the important and highly applicable method of data refinement and the simulation methods used for proving its correctness. The authors concentrate in the first part on the general principles needed to prove data refinement correct. They begin with an explanation of the fundamental notions, showing that data refinement proofs reduce to proving simulation. The book's second part contains a detailed survey of important methods in this field, which are carefully analysed, and shown to be either incomplete, with counterexamples to their application, or to be always applicable whenever data refinement holds. This is shown by proving, for the first time, that all these methods can be described and analysed in terms of two simple notions: forward and backward simulation. The book is self-contained, going from advanced undergraduate level and taking the reader to the state of the art in methods for proving simulation. Graduate text in formal methods in computer science. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability. Seller Inventory # 9780521641708
Quantity: 1 available
Seller: moluna, Greven, Germany
Gebunden. Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Graduate text in formal methods in computer science.InhaltsverzeichnisPart I. Theory: 1. Introduction to data refinement 2. Simulation as a proof method for data refinement 3. Relations and recursion 4. Properties of simulation 5. Seller Inventory # 446943441
Quantity: Over 20 available