Formal verification of data type refinement: theory and practice
Gespeichert in:
| Beteilige Person: | |
|---|---|
| Format: | Buch |
| Sprache: | Englisch |
| Veröffentlicht: |
Cambridge
1989
|
| Schriftenreihe: | Computer Laboratory <Cambridge>: Technical report
180 |
| Schlagwörter: | |
| Abstract: | Abstract: "This paper develops two theories of data abstraction and refinement: one for applicative types, as they are found in functional programming languages, and one for state-based types found in imperative languages. The former are modelled by algebraic structures, the latter by automata. The automaton-theoretic model covers not just types but distributed systems in general. Within each theory two examples of data refinement are presented and formally verified with the theorem prover Isabelle. The examples are an abstract specification and two implementations of a memory system, and a mutual exclusion algorithm." |
| Umfang: | 31 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010410978 | ||
| 003 | DE-604 | ||
| 005 | 19960925 | ||
| 007 | t| | ||
| 008 | 951006s1989 xx |||| 00||| engod | ||
| 035 | |a (OCoLC)20797731 | ||
| 035 | |a (DE-599)BVBBV010410978 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 084 | |a DAT 325f |2 stub | ||
| 100 | 1 | |a Nipkow, Tobias |d 1958- |e Verfasser |0 (DE-588)17275660X |4 aut | |
| 245 | 1 | 0 | |a Formal verification of data type refinement |b theory and practice |
| 264 | 1 | |a Cambridge |c 1989 | |
| 300 | |a 31 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 180 | |
| 520 | 3 | |a Abstract: "This paper develops two theories of data abstraction and refinement: one for applicative types, as they are found in functional programming languages, and one for state-based types found in imperative languages. The former are modelled by algebraic structures, the latter by automata. The automaton-theoretic model covers not just types but distributed systems in general. Within each theory two examples of data refinement are presented and formally verified with the theorem prover Isabelle. The examples are an abstract specification and two implementations of a memory system, and a mutual exclusion algorithm." | |
| 650 | 4 | |a Abstract data types (Computer science) | |
| 830 | 0 | |a Computer Laboratory <Cambridge>: Technical report |v 180 |w (DE-604)BV004055605 |9 180 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-006932966 | |
Datensatz im Suchindex
| _version_ | 1818952641631223808 |
|---|---|
| any_adam_object | |
| author | Nipkow, Tobias 1958- |
| author_GND | (DE-588)17275660X |
| author_facet | Nipkow, Tobias 1958- |
| author_role | aut |
| author_sort | Nipkow, Tobias 1958- |
| author_variant | t n tn |
| building | Verbundindex |
| bvnumber | BV010410978 |
| classification_tum | DAT 325f |
| ctrlnum | (OCoLC)20797731 (DE-599)BVBBV010410978 |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01542nam a2200289 cb4500</leader><controlfield tag="001">BV010410978</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19960925 </controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">951006s1989 xx |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)20797731</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010410978</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 325f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Nipkow, Tobias</subfield><subfield code="d">1958-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)17275660X</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Formal verification of data type refinement</subfield><subfield code="b">theory and practice</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="c">1989</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">31 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">180</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "This paper develops two theories of data abstraction and refinement: one for applicative types, as they are found in functional programming languages, and one for state-based types found in imperative languages. The former are modelled by algebraic structures, the latter by automata. The automaton-theoretic model covers not just types but distributed systems in general. Within each theory two examples of data refinement are presented and formally verified with the theorem prover Isabelle. The examples are an abstract specification and two implementations of a memory system, and a mutual exclusion algorithm."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Abstract data types (Computer science)</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Computer Laboratory <Cambridge>: Technical report</subfield><subfield code="v">180</subfield><subfield code="w">(DE-604)BV004055605</subfield><subfield code="9">180</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006932966</subfield></datafield></record></collection> |
| id | DE-604.BV010410978 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-20T09:53:37Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006932966 |
| oclc_num | 20797731 |
| open_access_boolean | |
| physical | 31 S. |
| publishDate | 1989 |
| publishDateSearch | 1989 |
| publishDateSort | 1989 |
| record_format | marc |
| series | Computer Laboratory <Cambridge>: Technical report |
| series2 | Computer Laboratory <Cambridge>: Technical report |
| spelling | Nipkow, Tobias 1958- Verfasser (DE-588)17275660X aut Formal verification of data type refinement theory and practice Cambridge 1989 31 S. txt rdacontent n rdamedia nc rdacarrier Computer Laboratory <Cambridge>: Technical report 180 Abstract: "This paper develops two theories of data abstraction and refinement: one for applicative types, as they are found in functional programming languages, and one for state-based types found in imperative languages. The former are modelled by algebraic structures, the latter by automata. The automaton-theoretic model covers not just types but distributed systems in general. Within each theory two examples of data refinement are presented and formally verified with the theorem prover Isabelle. The examples are an abstract specification and two implementations of a memory system, and a mutual exclusion algorithm." Abstract data types (Computer science) Computer Laboratory <Cambridge>: Technical report 180 (DE-604)BV004055605 180 |
| spellingShingle | Nipkow, Tobias 1958- Formal verification of data type refinement theory and practice Computer Laboratory <Cambridge>: Technical report Abstract data types (Computer science) |
| title | Formal verification of data type refinement theory and practice |
| title_auth | Formal verification of data type refinement theory and practice |
| title_exact_search | Formal verification of data type refinement theory and practice |
| title_full | Formal verification of data type refinement theory and practice |
| title_fullStr | Formal verification of data type refinement theory and practice |
| title_full_unstemmed | Formal verification of data type refinement theory and practice |
| title_short | Formal verification of data type refinement |
| title_sort | formal verification of data type refinement theory and practice |
| title_sub | theory and practice |
| topic | Abstract data types (Computer science) |
| topic_facet | Abstract data types (Computer science) |
| volume_link | (DE-604)BV004055605 |
| work_keys_str_mv | AT nipkowtobias formalverificationofdatatyperefinementtheoryandpractice |