Specification and Compositional Verification of Real-Time Systems (Record no. 35128)

000 -LEADER
fixed length control field 03246nam a22005415i 4500
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
ISBN 9783540466024
-- 978-3-540-46602-4
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 005.1015113
100 1# - MAIN ENTRY--AUTHOR NAME
Personal name Hooman, Jozef.
245 10 - TITLE STATEMENT
Title Specification and Compositional Verification of Real-Time Systems
Statement of responsibility, etc by Jozef Hooman.
260 #1 - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Place of publication Berlin, Heidelberg :
Name of publisher Springer Berlin Heidelberg,
Year of publication 1991.
300 ## - PHYSICAL DESCRIPTION
Number of Pages X, 242 p.
Other physical details online resource.
490 1# - SERIES STATEMENT
Series statement Lecture Notes in Computer Science,
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note Compositionality -- Compositionality and real-time -- Adding program variables -- Shared processors -- Concluding remarks.
520 ## - SUMMARY, ETC.
Summary, etc 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.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computer science.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Software engineering.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Logic design.
650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computer Science.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Logics and Meanings of Programs.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Programming Languages, Compilers, Interpreters.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Software Engineering.
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier http://dx.doi.org/10.1007/3-540-54947-1
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type E-BOOKS
264 #1 -
-- Berlin, Heidelberg :
-- Springer Berlin Heidelberg,
-- 1991.
336 ## -
-- text
-- txt
-- rdacontent
337 ## -
-- computer
-- c
-- rdamedia
338 ## -
-- online resource
-- cr
-- rdacarrier
347 ## -
-- text file
-- PDF
-- rda
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
-- 0302-9743 ;
Holdings
Withdrawn status Lost status Damaged status Not for loan Current library Accession Number Uniform Resource Identifier Koha item type
        IMSc Library EBK5834 http://dx.doi.org/10.1007/3-540-54947-1 E-BOOKS
The Institute of Mathematical Sciences, Chennai, India

Powered by Koha