Specification and Compositional Verification of Real-Time Systems

Hooman, J.

ISBN 10: 0387549471 / ISBN 13: 9780387549477

Published by Springer-Verlag, Berlin, 1991

About this Item

New condition with a remainder mark on the bottom edge. 235pp. Volume 558 in Springer's 'Lecture Notes in Computer Science' series. "The aim of this book is to develop a formal framework for the specification and compositional verification of real-time embedded systems. Thus, in addition to the usual functional behavior, also timing properties of programs are considered. Programs are written in a real-time distributed programming language with synchronous message passing along unidirectional channels between concurrent processes. The language includes real-time constructs to allow the programming of time-outs. To compare different approaches, two formalisms are investigated: Metric Temporal Logic, and Hoare triples (precondition, program, postcondition). The MTL approach provides a concise notation to express timing properties and to axiomatize the programming language, whereas Hoare-style formulae are especially convenient for the verification of sequential constructs. For both frameworks a compositional proof system is formulated to verify programs, making it possible to split up correctness proofs and to verify design steps during the process of program design.

Seller Inventory # S5-000206

Bibliographic Details

• Title: Specification and Compositional Verification of Real-Time Systems
• Publisher: Springer-Verlag, Berlin
• Publication Date: 1991
• Language: English
• ISBN 10: 0387549471
• ISBN 13: 9780387549477
• Binding: Soft Cover
• Condition: New
• Seller catalogs:
  • EDALL

About this title

Synopsis

The research described in this monograph concerns the formal specification and compositional verification of real-time systems. A real-time programming language 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 based on extended Hoare triples. Metric Temporal Logic provides a concise notation to 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 its own 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.