Specification and Compositional Verification of Real-Time Systems

Jozef Hooman

ISBN 10: 3540549471 / ISBN 13: 9783540549475

Verlag: Springer Berlin Heidelberg, 1991

Beschreibung

Druck auf Anfrage Neuware - Printed after ordering - The research described in this monograph concerns the formalspecification and compositional verification of real-timesystems. A real-time programminglanguage is considered inwhich concurrent processes communicate by synchronousmessage passing along unidirectional channels. To specifiyfunctional and timing properties of programs, two formalismsare investigated: one using a real-time version of temporallogic, called Metric Temporal Logic, and another which isbasedon extended Hoare triples. Metric Temporal Logicprovides a concise notationto express timing properties andto axiomatize the programming language, whereas Hoare-styleformulae are especially convenient for the verification ofsequential constructs. For both approaches a compositionalproof system has been formulated to verify that a programsatisfies a specification. To deduce timing properties ofprograms, first maximal parallelism is assumed, modeling thesituation in which each process has itsown processor. Next,this model is generalized to multiprogramming where severalprocesses may share a processor and scheduling is based onpriorities. The proof systems are shown to be sound andrelatively complete with respect to a denotational semanticsof the programming language. The theory is illustrated by anexample of a watchdog timer.

Bestandsnummer des Verkäufers 9783540549475

Bibliografische Details

• Titel: Specification and Compositional Verification of Real-Time Systems
• Verlag: Springer Berlin Heidelberg
• Veröffentlichungsdatum: 1991
• Sprache: Englisch
• ISBN-10: 3540549471
• ISBN-13: 9783540549475
• Bindung: Taschenbuch
• Zustand: Neu

Über diesen Titel

Inhaltsangabe

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.