|
Showing 1 - 3 of
3 matches in All Departments
The research described in this monograph concerns the formal
specification and compositional verification of real-time systems.
A real-time programminglanguage is considered in which concurrent
processes communicate by synchronous message passing along
unidirectional channels. To specifiy functional and timing
properties of programs, two formalisms are investigated: one using
a real-time version of temporal logic, called Metric Temporal
Logic, and another which is basedon extended Hoare triples. Metric
Temporal Logic provides a concise notationto express timing
properties and to axiomatize the programming language, whereas
Hoare-style formulae are especially convenient for the verification
of sequential constructs. For both approaches a compositional proof
system has been formulated to verify that a program satisfies a
specification. To deduce timing properties of programs, first
maximal parallelism is assumed, modeling the situation in which
each process has itsown processor. Next, this model is generalized
to multiprogramming where several processes may share a processor
and scheduling is based on priorities. The proof systems are shown
to be sound and relatively complete with respect to a denotational
semantics of the programming language. The theory is illustrated by
an example of a watchdog timer.
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
figures complements the text.
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. The book is self-contained, guiding the reader from advanced undergraduate level to the state-of-the-art. Every method is illustrated by examples, and a picture gallery of some of the subject's key figures complements the text.
|
You may like...
Loot
Nadine Gordimer
Paperback
(2)
R398
R330
Discovery Miles 3 300
Loot
Nadine Gordimer
Paperback
(2)
R398
R330
Discovery Miles 3 300
|