specification compositional verification real time de hooman (11 résultats)

Paperback. Etat : Very Good. Etat de la jaquette : No Dust Jacket. Lecture Notes in Computer Science 558; Ex-Library. Previous owner's sticker on the front cover. Ink stamp on half-title page. Library catalogue sticker inside front cover. Faintly bumped spine head and rubbed corners. Foot of page block slightly grubby and marked due to age. Sound, clean book with tight binding. ADG. Ex-Library.

Soft Cover. Etat : New. 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.

Etat : New. In.

Taschenbuch. Etat : Neu. 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.

PF. Etat : New.

Paperback. Etat : Very Good. 0387549471 Ex-library paperback in very nice condition with the usual markings and attachments.

Etat : New.

Paperback. Etat : Like New. Like New. book.

Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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.

Taschenbuch. Etat : Neu. This item is printed on demand - Print on Demand Titel. Neuware -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. Nextthis 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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 252 pp. Englisch.

Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 252 pp. Englisch.