TOP
0
0
即日起~6/30,暑期閱讀書展,好書7折起

縮小範圍


商品類型

原文書 (5)
商品狀況

可訂購商品 (5)
庫存狀況

無庫存 (5)
商品定價

$800以上 (5)
出版日期

2016年以前 (5)
裝訂方式

平裝 (3)
精裝 (2)
作者

Willem-Paul de Roever (4)
Frank S. De Boer (EDT)/ Marcello M. Bonsangue (EDT)/ Susanne Graf (EDT)/ Willem-Paul De Roever (EDT) (1)
出版社/品牌

Cambridge Univ Pr (4)
Springer-Verlag New York Inc (1)

三民網路書店 / 搜尋結果

5筆商品,1/1頁
Concurrency Verification:Introduction to Compositional and Non-compositional Methods
作者:Willem-Paul de Roever  出版社:Cambridge Univ Pr  出版日:2010/09/09 裝訂:平裝
This is a systematic and comprehensive introduction both to compositional proof methods for the state-based verification of concurrent programs, such as the assumption-commitment and rely-guarantee paradigms, and to noncompositional methods, whose presentation culminates in an exposition of the communication-closed-layers (CCL) paradigm for verifying network protocols. Compositional concurrency verification methods reduce the verification of a concurrent program to the independent verification of its parts. If those parts are tightly coupled, one additionally needs verification methods based on the causal order between events. These are presented using CCL. The semantic approach followed here allows a systematic presentation of all these concepts in a unified framework which highlights essential concepts. This 2001 book is self-contained, guiding the reader from advanced undergraduate level. Every method is illustrated by examples, and a picture gallery of some of the subject's key fig
若需訂購本書,請電洽客服
02-25006600[分機130、131]。
Concurrency Verification:Introduction to Compositional and Non-compositional Methods
作者:Willem-Paul de Roever  出版社:Cambridge Univ Pr  出版日:2001/11/29 裝訂:精裝
This is a systematic and comprehensive introduction both to compositional proof methods for the state-based verification of concurrent programs, such as the assumption-commitment and rely-guarantee paradigms, and to noncompositional methods, whose presentation culminates in an exposition of the communication-closed-layers (CCL) paradigm for verifying network protocols. Compositional concurrency verification methods reduce the verification of a concurrent program to the independent verification of its parts. If those parts are tightly coupled, one additionally needs verification methods based on the causal order between events. These are presented using CCL. The semantic approach followed here allows a systematic presentation of all these concepts in a unified framework which highlights essential concepts. This 2001 book is self-contained, guiding the reader from advanced undergraduate level. Every method is illustrated by examples, and a picture gallery of some of the subject's key fig
若需訂購本書,請電洽客服
02-25006600[分機130、131]。
Data Refinement:Model-Oriented Proof Methods and their Comparison
90折
作者:Willem-Paul de Roever  出版社:Cambridge Univ Pr  出版日:2008/12/18 裝訂:平裝
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 simula
定價:3314 元, 優惠價:9 2983
無庫存,下單後進貨(到貨天數約45-60天)
Data Refinement:Model-Oriented Proof Methods and their Comparison
作者:Willem-Paul de Roever  出版社:Cambridge Univ Pr  出版日:1998/12/03 裝訂:精裝
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 simula
若需訂購本書,請電洽客服
02-25006600[分機130、131]。
Formal Methods for Components and Objects—6th International Symposium, FMCO 2007, Amsterdam, the Netherlands, October 24-27, 2007, Revised Papers
Formal methods have been applied successfully to the verification of medium-sized programs in protocol and hardware design. However, their application to the development of large systems requires more
若需訂購本書,請電洽客服
02-25006600[分機130、131]。

暢銷榜

客服中心

收藏

會員專區