The formal verification of hard real-time systems:
Abstract: "This dissertation investigates the use of formal verification to demonstrate the correctness of hard real-time systems, that is, computer systems in which programs are required to respond to events from their environments within real-time deadlines. A mathematical formalism, higher o...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Cambridge
Univ. of Cambridge Computer Laboratory
1992
|
| Schriftenreihe: | Computer Laboratory <Cambridge>: Technical report
255 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "This dissertation investigates the use of formal verification to demonstrate the correctness of hard real-time systems, that is, computer systems in which programs are required to respond to events from their environments within real-time deadlines. A mathematical formalism, higher order logic, is used to prove that programs react in a correct and timely manner to identified real-time events of their environments. Higher order logic is used both to describe the behaviour of programs written in a simple, imperative program language with asynchronous communication primitives and to specify the environments with which programs interact It is assumed that the implementation of the program language allows the exact time taken to execute commands to be calculated. It is then proved that a specification of programs and environments satisfies requirements which are also stated in higher order logic. The HOL system, a theorem prover for higher order logic, has been used to type check specifications and mechanize verification proofs. The main contributions of this dissertation to formal verification are techniques for writing generic specifications and verification methods for hard real-time programs. A generic specification is one which describes the behaviour of a class of hard real-time systems and which can be reused as the basis of different system implementations Our generic specifications are modular and hierarchical, enabling the separation of behaviour common to all implementations and behaviour which varies between different implementations. A compositional semantics for the real-time program language is proposed and two strategies for verifying hard real-time programs are examined. The verification of the class of sliding window protocols provides a nontrivial worked example to illustrate this method. Sliding window protocols transfer data from one processor to another in an environment which provides only an unreliable communication channel between the processors |
| Beschreibung: | Zugl.: Cambridge, Univ., Diss., 1992 |
| Beschreibung: | 151 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV008399844 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 931201s1992 m||| 00||| eng d | ||
| 035 | |a (OCoLC)27159475 | ||
| 035 | |a (DE-599)BVBBV008399844 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 084 | |a DAT 260d |2 stub | ||
| 084 | |a DAT 325d |2 stub | ||
| 100 | 1 | |a Cardell-Oliver, Rachel M. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a The formal verification of hard real-time systems |c by Rachel Mary Cardell-Oliver |
| 264 | 1 | |a Cambridge |b Univ. of Cambridge Computer Laboratory |c 1992 | |
| 300 | |a 151 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Computer Laboratory <Cambridge>: Technical report |v 255 | |
| 500 | |a Zugl.: Cambridge, Univ., Diss., 1992 | ||
| 520 | 3 | |a Abstract: "This dissertation investigates the use of formal verification to demonstrate the correctness of hard real-time systems, that is, computer systems in which programs are required to respond to events from their environments within real-time deadlines. A mathematical formalism, higher order logic, is used to prove that programs react in a correct and timely manner to identified real-time events of their environments. Higher order logic is used both to describe the behaviour of programs written in a simple, imperative program language with asynchronous communication primitives and to specify the environments with which programs interact | |
| 520 | 3 | |a It is assumed that the implementation of the program language allows the exact time taken to execute commands to be calculated. It is then proved that a specification of programs and environments satisfies requirements which are also stated in higher order logic. The HOL system, a theorem prover for higher order logic, has been used to type check specifications and mechanize verification proofs. The main contributions of this dissertation to formal verification are techniques for writing generic specifications and verification methods for hard real-time programs. A generic specification is one which describes the behaviour of a class of hard real-time systems and which can be reused as the basis of different system implementations | |
| 520 | 3 | |a Our generic specifications are modular and hierarchical, enabling the separation of behaviour common to all implementations and behaviour which varies between different implementations. A compositional semantics for the real-time program language is proposed and two strategies for verifying hard real-time programs are examined. The verification of the class of sliding window protocols provides a nontrivial worked example to illustrate this method. Sliding window protocols transfer data from one processor to another in an environment which provides only an unreliable communication channel between the processors | |
| 650 | 7 | |a Computer software |2 sigle | |
| 650 | 4 | |a Real-time data processing | |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 830 | 0 | |a Computer Laboratory <Cambridge>: Technical report |v 255 |w (DE-604)BV004055605 |9 255 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005533968 | ||
Datensatz im Suchindex
| _version_ | 1804122767993339904 |
|---|---|
| any_adam_object | |
| author | Cardell-Oliver, Rachel M. |
| author_facet | Cardell-Oliver, Rachel M. |
| author_role | aut |
| author_sort | Cardell-Oliver, Rachel M. |
| author_variant | r m c o rmc rmco |
| building | Verbundindex |
| bvnumber | BV008399844 |
| classification_tum | DAT 260d DAT 325d |
| ctrlnum | (OCoLC)27159475 (DE-599)BVBBV008399844 |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03180nam a2200361 cb4500</leader><controlfield tag="001">BV008399844</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">931201s1992 m||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)27159475</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008399844</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 260d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 325d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Cardell-Oliver, Rachel M.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The formal verification of hard real-time systems</subfield><subfield code="c">by Rachel Mary Cardell-Oliver</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Univ. of Cambridge Computer Laboratory</subfield><subfield code="c">1992</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">151 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Computer Laboratory <Cambridge>: Technical report</subfield><subfield code="v">255</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Zugl.: Cambridge, Univ., Diss., 1992</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "This dissertation investigates the use of formal verification to demonstrate the correctness of hard real-time systems, that is, computer systems in which programs are required to respond to events from their environments within real-time deadlines. A mathematical formalism, higher order logic, is used to prove that programs react in a correct and timely manner to identified real-time events of their environments. Higher order logic is used both to describe the behaviour of programs written in a simple, imperative program language with asynchronous communication primitives and to specify the environments with which programs interact</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">It is assumed that the implementation of the program language allows the exact time taken to execute commands to be calculated. It is then proved that a specification of programs and environments satisfies requirements which are also stated in higher order logic. The HOL system, a theorem prover for higher order logic, has been used to type check specifications and mechanize verification proofs. The main contributions of this dissertation to formal verification are techniques for writing generic specifications and verification methods for hard real-time programs. A generic specification is one which describes the behaviour of a class of hard real-time systems and which can be reused as the basis of different system implementations</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Our generic specifications are modular and hierarchical, enabling the separation of behaviour common to all implementations and behaviour which varies between different implementations. A compositional semantics for the real-time program language is proposed and two strategies for verifying hard real-time programs are examined. The verification of the class of sliding window protocols provides a nontrivial worked example to illustrate this method. Sliding window protocols transfer data from one processor to another in an environment which provides only an unreliable communication channel between the processors</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer software</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Real-time data processing</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Computer Laboratory <Cambridge>: Technical report</subfield><subfield code="v">255</subfield><subfield code="w">(DE-604)BV004055605</subfield><subfield code="9">255</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005533968</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV008399844 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:19:07Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005533968 |
| oclc_num | 27159475 |
| open_access_boolean | |
| physical | 151 S. |
| publishDate | 1992 |
| publishDateSearch | 1992 |
| publishDateSort | 1992 |
| publisher | Univ. of Cambridge Computer Laboratory |
| record_format | marc |
| series | Computer Laboratory <Cambridge>: Technical report |
| series2 | Computer Laboratory <Cambridge>: Technical report |
| spelling | Cardell-Oliver, Rachel M. Verfasser aut The formal verification of hard real-time systems by Rachel Mary Cardell-Oliver Cambridge Univ. of Cambridge Computer Laboratory 1992 151 S. txt rdacontent n rdamedia nc rdacarrier Computer Laboratory <Cambridge>: Technical report 255 Zugl.: Cambridge, Univ., Diss., 1992 Abstract: "This dissertation investigates the use of formal verification to demonstrate the correctness of hard real-time systems, that is, computer systems in which programs are required to respond to events from their environments within real-time deadlines. A mathematical formalism, higher order logic, is used to prove that programs react in a correct and timely manner to identified real-time events of their environments. Higher order logic is used both to describe the behaviour of programs written in a simple, imperative program language with asynchronous communication primitives and to specify the environments with which programs interact It is assumed that the implementation of the program language allows the exact time taken to execute commands to be calculated. It is then proved that a specification of programs and environments satisfies requirements which are also stated in higher order logic. The HOL system, a theorem prover for higher order logic, has been used to type check specifications and mechanize verification proofs. The main contributions of this dissertation to formal verification are techniques for writing generic specifications and verification methods for hard real-time programs. A generic specification is one which describes the behaviour of a class of hard real-time systems and which can be reused as the basis of different system implementations Our generic specifications are modular and hierarchical, enabling the separation of behaviour common to all implementations and behaviour which varies between different implementations. A compositional semantics for the real-time program language is proposed and two strategies for verifying hard real-time programs are examined. The verification of the class of sliding window protocols provides a nontrivial worked example to illustrate this method. Sliding window protocols transfer data from one processor to another in an environment which provides only an unreliable communication channel between the processors Computer software sigle Real-time data processing (DE-588)4113937-9 Hochschulschrift gnd-content Computer Laboratory <Cambridge>: Technical report 255 (DE-604)BV004055605 255 |
| spellingShingle | Cardell-Oliver, Rachel M. The formal verification of hard real-time systems Computer Laboratory <Cambridge>: Technical report Computer software sigle Real-time data processing |
| subject_GND | (DE-588)4113937-9 |
| title | The formal verification of hard real-time systems |
| title_auth | The formal verification of hard real-time systems |
| title_exact_search | The formal verification of hard real-time systems |
| title_full | The formal verification of hard real-time systems by Rachel Mary Cardell-Oliver |
| title_fullStr | The formal verification of hard real-time systems by Rachel Mary Cardell-Oliver |
| title_full_unstemmed | The formal verification of hard real-time systems by Rachel Mary Cardell-Oliver |
| title_short | The formal verification of hard real-time systems |
| title_sort | the formal verification of hard real time systems |
| topic | Computer software sigle Real-time data processing |
| topic_facet | Computer software Real-time data processing Hochschulschrift |
| volume_link | (DE-604)BV004055605 |
| work_keys_str_mv | AT cardelloliverrachelm theformalverificationofhardrealtimesystems |