On constructive specifications of abstract data types using temporal logic:
Abstract: "We introduce an approach for the specification of abstract data types based on temporal logic. To this end we propose a constructive specification method. We present axiom schemes to get generally monomorphic and complete models. Nonconstructive operations are defined as abbreviation...
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
München
1991
|
Schriftenreihe: | Technische Universität <München>: TUM-I
9146 |
Schlagworte: | |
Zusammenfassung: | Abstract: "We introduce an approach for the specification of abstract data types based on temporal logic. To this end we propose a constructive specification method. We present axiom schemes to get generally monomorphic and complete models. Nonconstructive operations are defined as abbreviations for algorithms using constructors. We show that our approach is as expressive as the classical method. Moreover we can specify semicomputable and co-semicomputable algebras monomorphically." |
Beschreibung: | 25 S. |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV005593593 | ||
003 | DE-604 | ||
005 | 20040413 | ||
007 | t | ||
008 | 921014s1991 |||| 00||| engod | ||
035 | |a (OCoLC)31897704 | ||
035 | |a (DE-599)BVBBV005593593 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
049 | |a DE-12 |a DE-91G | ||
088 | |a TUM I9146 | ||
100 | 1 | |a Leßke, Frank |e Verfasser |4 aut | |
245 | 1 | 0 | |a On constructive specifications of abstract data types using temporal logic |c Frank Leßke |
264 | 1 | |a München |c 1991 | |
300 | |a 25 S. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a Technische Universität <München>: TUM-I |v 9146 | |
490 | 1 | |a Sonderforschungsbereich Methoden und Werkzeuge für die Nutzung paralleler Rechnerarchitekturen: SFB-Bericht / A |v 1991,32 | |
520 | 3 | |a Abstract: "We introduce an approach for the specification of abstract data types based on temporal logic. To this end we propose a constructive specification method. We present axiom schemes to get generally monomorphic and complete models. Nonconstructive operations are defined as abbreviations for algorithms using constructors. We show that our approach is as expressive as the classical method. Moreover we can specify semicomputable and co-semicomputable algebras monomorphically." | |
650 | 4 | |a Abstract data types (Computer science) | |
810 | 2 | |a A |t Sonderforschungsbereich Methoden und Werkzeuge für die Nutzung paralleler Rechnerarchitekturen: SFB-Bericht |v 1991,32 |w (DE-604)BV004627888 |9 1991,32 | |
830 | 0 | |a Technische Universität <München>: TUM-I |v 9146 |w (DE-604)BV006185376 |9 9146 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-003503628 |
Datensatz im Suchindex
_version_ | 1804119806962565120 |
---|---|
any_adam_object | |
author | Leßke, Frank |
author_facet | Leßke, Frank |
author_role | aut |
author_sort | Leßke, Frank |
author_variant | f l fl |
building | Verbundindex |
bvnumber | BV005593593 |
ctrlnum | (OCoLC)31897704 (DE-599)BVBBV005593593 |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01715nam a2200325 cb4500</leader><controlfield tag="001">BV005593593</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20040413 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">921014s1991 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)31897704</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV005593593</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="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-91G</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">TUM I9146</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Leßke, Frank</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">On constructive specifications of abstract data types using temporal logic</subfield><subfield code="c">Frank Leßke</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">München</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">25 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">Technische Universität <München>: TUM-I</subfield><subfield code="v">9146</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Sonderforschungsbereich Methoden und Werkzeuge für die Nutzung paralleler Rechnerarchitekturen: SFB-Bericht / A</subfield><subfield code="v">1991,32</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We introduce an approach for the specification of abstract data types based on temporal logic. To this end we propose a constructive specification method. We present axiom schemes to get generally monomorphic and complete models. Nonconstructive operations are defined as abbreviations for algorithms using constructors. We show that our approach is as expressive as the classical method. Moreover we can specify semicomputable and co-semicomputable algebras monomorphically."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Abstract data types (Computer science)</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">A</subfield><subfield code="t">Sonderforschungsbereich Methoden und Werkzeuge für die Nutzung paralleler Rechnerarchitekturen: SFB-Bericht</subfield><subfield code="v">1991,32</subfield><subfield code="w">(DE-604)BV004627888</subfield><subfield code="9">1991,32</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Technische Universität <München>: TUM-I</subfield><subfield code="v">9146</subfield><subfield code="w">(DE-604)BV006185376</subfield><subfield code="9">9146</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-003503628</subfield></datafield></record></collection> |
id | DE-604.BV005593593 |
illustrated | Not Illustrated |
indexdate | 2024-07-09T16:32:03Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-003503628 |
oclc_num | 31897704 |
open_access_boolean | |
owner | DE-12 DE-91G DE-BY-TUM |
owner_facet | DE-12 DE-91G DE-BY-TUM |
physical | 25 S. |
publishDate | 1991 |
publishDateSearch | 1991 |
publishDateSort | 1991 |
record_format | marc |
series | Technische Universität <München>: TUM-I |
series2 | Technische Universität <München>: TUM-I Sonderforschungsbereich Methoden und Werkzeuge für die Nutzung paralleler Rechnerarchitekturen: SFB-Bericht / A |
spelling | Leßke, Frank Verfasser aut On constructive specifications of abstract data types using temporal logic Frank Leßke München 1991 25 S. txt rdacontent n rdamedia nc rdacarrier Technische Universität <München>: TUM-I 9146 Sonderforschungsbereich Methoden und Werkzeuge für die Nutzung paralleler Rechnerarchitekturen: SFB-Bericht / A 1991,32 Abstract: "We introduce an approach for the specification of abstract data types based on temporal logic. To this end we propose a constructive specification method. We present axiom schemes to get generally monomorphic and complete models. Nonconstructive operations are defined as abbreviations for algorithms using constructors. We show that our approach is as expressive as the classical method. Moreover we can specify semicomputable and co-semicomputable algebras monomorphically." Abstract data types (Computer science) A Sonderforschungsbereich Methoden und Werkzeuge für die Nutzung paralleler Rechnerarchitekturen: SFB-Bericht 1991,32 (DE-604)BV004627888 1991,32 Technische Universität <München>: TUM-I 9146 (DE-604)BV006185376 9146 |
spellingShingle | Leßke, Frank On constructive specifications of abstract data types using temporal logic Technische Universität <München>: TUM-I Abstract data types (Computer science) |
title | On constructive specifications of abstract data types using temporal logic |
title_auth | On constructive specifications of abstract data types using temporal logic |
title_exact_search | On constructive specifications of abstract data types using temporal logic |
title_full | On constructive specifications of abstract data types using temporal logic Frank Leßke |
title_fullStr | On constructive specifications of abstract data types using temporal logic Frank Leßke |
title_full_unstemmed | On constructive specifications of abstract data types using temporal logic Frank Leßke |
title_short | On constructive specifications of abstract data types using temporal logic |
title_sort | on constructive specifications of abstract data types using temporal logic |
topic | Abstract data types (Computer science) |
topic_facet | Abstract data types (Computer science) |
volume_link | (DE-604)BV004627888 (DE-604)BV006185376 |
work_keys_str_mv | AT leßkefrank onconstructivespecificationsofabstractdatatypesusingtemporallogic |