Specification and Compositional Verification of Real-Time Systems [electronic resource] / by Jozef Hooman.
Material type: TextSeries: Lecture Notes in Computer Science ; 558Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 1991Description: X, 242 p. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783540466024Subject(s): Computer science | Software engineering | Logic design | Computer Science | Logics and Meanings of Programs | Programming Languages, Compilers, Interpreters | Software EngineeringAdditional physical formats: Printed edition:: No titleDDC classification: 005.1015113 LOC classification: QA76.9.L63QA76.5913QA76.63Online resources: Click here to access onlineCurrent library | Home library | Call number | Materials specified | URL | Status | Date due | Barcode |
---|---|---|---|---|---|---|---|
IMSc Library | IMSc Library | Link to resource | Available | EBK5834 |
Compositionality -- Compositionality and real-time -- Adding program variables -- Shared processors -- Concluding remarks.
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.
There are no comments on this title.