Automatic synthesis of implementations for abstract data types from algebraic specifications:
This thesis explores an automatic method of synthesizing implementations for data types for their algebraic specifications. The inputs to the synthesis procedure consist of a specification for the implemented type, a specification for each of the implementing types, and a formal description of the r...
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Cambridge, Mass.
Laboratory for Computer Science, Massachusetts Inst. of Technology
1982
|
Schlagworte: | |
Zusammenfassung: | This thesis explores an automatic method of synthesizing implementations for data types for their algebraic specifications. The inputs to the synthesis procedure consist of a specification for the implemented type, a specification for each of the implementing types, and a formal description of the representation scheme to be used by the implementation. The output of the procedure consists of an implementation for each of the operations of the implemented type in a simple applicative language. The inputs and the output of the synthesis procedure are precisely characterized. A formal basis for the method employed by the procedure is developed. The method is based on the principle of reversing the technique of proving the correctness of an implementation of a data type. The restrictions on the inputs, and the conditions under which the procedure synthesizes an implementation successfully are formally characterized. |
Beschreibung: | Vollst. zugl.: Diss. 1981 |
Beschreibung: | 161 S. |
Internformat
MARC
LEADER | 00000nam a2200000zc 4500 | ||
---|---|---|---|
001 | BV021876272 | ||
003 | DE-604 | ||
005 | 20040229000000.0 | ||
007 | t | ||
008 | 880303s1982 |||| 00||| eng d | ||
035 | |a (OCoLC)227552872 | ||
035 | |a (DE-599)BVBBV021876272 | ||
040 | |a DE-604 |b ger | ||
041 | 0 | |a eng | |
049 | |a DE-706 | ||
088 | |a MIT/LCS/TR-276 | ||
100 | 1 | |a Srivas, Mandayam K. |e Verfasser |4 aut | |
245 | 1 | 0 | |a Automatic synthesis of implementations for abstract data types from algebraic specifications |c by Mandayam Kannappan Srivas |
264 | 1 | |a Cambridge, Mass. |b Laboratory for Computer Science, Massachusetts Inst. of Technology |c 1982 | |
300 | |a 161 S. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
500 | |a Vollst. zugl.: Diss. 1981 | ||
520 | 3 | |a This thesis explores an automatic method of synthesizing implementations for data types for their algebraic specifications. The inputs to the synthesis procedure consist of a specification for the implemented type, a specification for each of the implementing types, and a formal description of the representation scheme to be used by the implementation. The output of the procedure consists of an implementation for each of the operations of the implemented type in a simple applicative language. The inputs and the output of the synthesis procedure are precisely characterized. A formal basis for the method employed by the procedure is developed. The method is based on the principle of reversing the technique of proving the correctness of an implementation of a data type. The restrictions on the inputs, and the conditions under which the procedure synthesizes an implementation successfully are formally characterized. | |
650 | 7 | |a Algebra |2 dtict | |
650 | 7 | |a Automatic |2 dtict | |
650 | 7 | |a Computer Programming and Software |2 scgdst | |
650 | 7 | |a Computer program reliability |2 dtict | |
650 | 7 | |a Computer programming |2 dtict | |
650 | 7 | |a Data acquisition |2 dtict | |
650 | 7 | |a Input |2 dtict | |
650 | 7 | |a Methodology |2 dtict | |
650 | 7 | |a Output |2 dtict | |
650 | 7 | |a Programming languages |2 dtict | |
650 | 7 | |a Semantics |2 dtict | |
650 | 7 | |a Specifications |2 dtict | |
650 | 7 | |a Synthesis |2 dtict | |
650 | 7 | |a Theses |2 dtict | |
650 | 0 | 7 | |a Algebraische Spezifikation |0 (DE-588)4207192-6 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Abstrakter Datentyp |0 (DE-588)4120827-4 |2 gnd |9 rswk-swf |
689 | 0 | 0 | |a Abstrakter Datentyp |0 (DE-588)4120827-4 |D s |
689 | 0 | |5 DE-604 | |
689 | 1 | 0 | |a Algebraische Spezifikation |0 (DE-588)4207192-6 |D s |
689 | 1 | |5 DE-604 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-015091894 |
Datensatz im Suchindex
_version_ | 1804135815726497792 |
---|---|
adam_txt | |
any_adam_object | |
any_adam_object_boolean | |
author | Srivas, Mandayam K. |
author_facet | Srivas, Mandayam K. |
author_role | aut |
author_sort | Srivas, Mandayam K. |
author_variant | m k s mk mks |
building | Verbundindex |
bvnumber | BV021876272 |
ctrlnum | (OCoLC)227552872 (DE-599)BVBBV021876272 |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02635nam a2200517zc 4500</leader><controlfield tag="001">BV021876272</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20040229000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">880303s1982 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)227552872</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV021876272</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-706</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">MIT/LCS/TR-276</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Srivas, Mandayam K.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Automatic synthesis of implementations for abstract data types from algebraic specifications</subfield><subfield code="c">by Mandayam Kannappan Srivas</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge, Mass.</subfield><subfield code="b">Laboratory for Computer Science, Massachusetts Inst. of Technology</subfield><subfield code="c">1982</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">161 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="500" ind1=" " ind2=" "><subfield code="a">Vollst. zugl.: Diss. 1981</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">This thesis explores an automatic method of synthesizing implementations for data types for their algebraic specifications. The inputs to the synthesis procedure consist of a specification for the implemented type, a specification for each of the implementing types, and a formal description of the representation scheme to be used by the implementation. The output of the procedure consists of an implementation for each of the operations of the implemented type in a simple applicative language. The inputs and the output of the synthesis procedure are precisely characterized. A formal basis for the method employed by the procedure is developed. The method is based on the principle of reversing the technique of proving the correctness of an implementation of a data type. The restrictions on the inputs, and the conditions under which the procedure synthesizes an implementation successfully are formally characterized.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algebra</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Automatic</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer Programming and Software</subfield><subfield code="2">scgdst</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer program reliability</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer programming</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Data acquisition</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Input</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Methodology</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Output</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Programming languages</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Semantics</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Specifications</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Synthesis</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Theses</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algebraische Spezifikation</subfield><subfield code="0">(DE-588)4207192-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Abstrakter Datentyp</subfield><subfield code="0">(DE-588)4120827-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Abstrakter Datentyp</subfield><subfield code="0">(DE-588)4120827-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Algebraische Spezifikation</subfield><subfield code="0">(DE-588)4207192-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-015091894</subfield></datafield></record></collection> |
id | DE-604.BV021876272 |
illustrated | Not Illustrated |
index_date | 2024-07-02T16:03:36Z |
indexdate | 2024-07-09T20:46:30Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015091894 |
oclc_num | 227552872 |
open_access_boolean | |
owner | DE-706 |
owner_facet | DE-706 |
physical | 161 S. |
publishDate | 1982 |
publishDateSearch | 1982 |
publishDateSort | 1982 |
publisher | Laboratory for Computer Science, Massachusetts Inst. of Technology |
record_format | marc |
spelling | Srivas, Mandayam K. Verfasser aut Automatic synthesis of implementations for abstract data types from algebraic specifications by Mandayam Kannappan Srivas Cambridge, Mass. Laboratory for Computer Science, Massachusetts Inst. of Technology 1982 161 S. txt rdacontent n rdamedia nc rdacarrier Vollst. zugl.: Diss. 1981 This thesis explores an automatic method of synthesizing implementations for data types for their algebraic specifications. The inputs to the synthesis procedure consist of a specification for the implemented type, a specification for each of the implementing types, and a formal description of the representation scheme to be used by the implementation. The output of the procedure consists of an implementation for each of the operations of the implemented type in a simple applicative language. The inputs and the output of the synthesis procedure are precisely characterized. A formal basis for the method employed by the procedure is developed. The method is based on the principle of reversing the technique of proving the correctness of an implementation of a data type. The restrictions on the inputs, and the conditions under which the procedure synthesizes an implementation successfully are formally characterized. Algebra dtict Automatic dtict Computer Programming and Software scgdst Computer program reliability dtict Computer programming dtict Data acquisition dtict Input dtict Methodology dtict Output dtict Programming languages dtict Semantics dtict Specifications dtict Synthesis dtict Theses dtict Algebraische Spezifikation (DE-588)4207192-6 gnd rswk-swf Abstrakter Datentyp (DE-588)4120827-4 gnd rswk-swf Abstrakter Datentyp (DE-588)4120827-4 s DE-604 Algebraische Spezifikation (DE-588)4207192-6 s |
spellingShingle | Srivas, Mandayam K. Automatic synthesis of implementations for abstract data types from algebraic specifications Algebra dtict Automatic dtict Computer Programming and Software scgdst Computer program reliability dtict Computer programming dtict Data acquisition dtict Input dtict Methodology dtict Output dtict Programming languages dtict Semantics dtict Specifications dtict Synthesis dtict Theses dtict Algebraische Spezifikation (DE-588)4207192-6 gnd Abstrakter Datentyp (DE-588)4120827-4 gnd |
subject_GND | (DE-588)4207192-6 (DE-588)4120827-4 |
title | Automatic synthesis of implementations for abstract data types from algebraic specifications |
title_auth | Automatic synthesis of implementations for abstract data types from algebraic specifications |
title_exact_search | Automatic synthesis of implementations for abstract data types from algebraic specifications |
title_exact_search_txtP | Automatic synthesis of implementations for abstract data types from algebraic specifications |
title_full | Automatic synthesis of implementations for abstract data types from algebraic specifications by Mandayam Kannappan Srivas |
title_fullStr | Automatic synthesis of implementations for abstract data types from algebraic specifications by Mandayam Kannappan Srivas |
title_full_unstemmed | Automatic synthesis of implementations for abstract data types from algebraic specifications by Mandayam Kannappan Srivas |
title_short | Automatic synthesis of implementations for abstract data types from algebraic specifications |
title_sort | automatic synthesis of implementations for abstract data types from algebraic specifications |
topic | Algebra dtict Automatic dtict Computer Programming and Software scgdst Computer program reliability dtict Computer programming dtict Data acquisition dtict Input dtict Methodology dtict Output dtict Programming languages dtict Semantics dtict Specifications dtict Synthesis dtict Theses dtict Algebraische Spezifikation (DE-588)4207192-6 gnd Abstrakter Datentyp (DE-588)4120827-4 gnd |
topic_facet | Algebra Automatic Computer Programming and Software Computer program reliability Computer programming Data acquisition Input Methodology Output Programming languages Semantics Specifications Synthesis Theses Algebraische Spezifikation Abstrakter Datentyp |
work_keys_str_mv | AT srivasmandayamk automaticsynthesisofimplementationsforabstractdatatypesfromalgebraicspecifications |