Recursive program optimization through inductive synthesis proof transformation:
Abstract: "The research described in this paper involved developing transformation techniques which increase the efficiency of the original program, the source, by transforming its synthesis proof into one, the target, which yields a computationally more efficient algorithm. We describe a worki...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Edinburgh
1992
|
| Schriftenreihe: | University <Edinburgh> / Department of Artificial Intelligence: DAI research paper
604 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "The research described in this paper involved developing transformation techniques which increase the efficiency of the original program, the source, by transforming its synthesis proof into one, the target, which yields a computationally more efficient algorithm. We describe a working proof transformation system which, by exploiting the duality between mathematical induction and recursion, employs the novel strategy of optimizing recursive programs by transforming inductive proofs. We compare and contrast this approach with the more traditional approaches to program transformation, and highlight the benefits of proof transformation with regards to search, correctness, automatability and generality." |
| Beschreibung: | 34 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010460829 | ||
| 003 | DE-604 | ||
| 005 | 19961217 | ||
| 007 | t | ||
| 008 | 951102s1992 |||| 00||| engod | ||
| 035 | |a (OCoLC)31987556 | ||
| 035 | |a (DE-599)BVBBV010460829 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 084 | |a DAT 542f |2 stub | ||
| 084 | |a DAT 706f |2 stub | ||
| 084 | |a DAT 343f |2 stub | ||
| 100 | 1 | |a Madden, Peter |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Recursive program optimization through inductive synthesis proof transformation |
| 264 | 1 | |a Edinburgh |c 1992 | |
| 300 | |a 34 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a University <Edinburgh> / Department of Artificial Intelligence: DAI research paper |v 604 | |
| 520 | 3 | |a Abstract: "The research described in this paper involved developing transformation techniques which increase the efficiency of the original program, the source, by transforming its synthesis proof into one, the target, which yields a computationally more efficient algorithm. We describe a working proof transformation system which, by exploiting the duality between mathematical induction and recursion, employs the novel strategy of optimizing recursive programs by transforming inductive proofs. We compare and contrast this approach with the more traditional approaches to program transformation, and highlight the benefits of proof transformation with regards to search, correctness, automatability and generality." | |
| 650 | 7 | |a Bionics and artificial intelligence |2 sigle | |
| 650 | 7 | |a Computer software |2 sigle | |
| 650 | 7 | |a Mathematics |2 sigle | |
| 650 | 4 | |a Mathematik | |
| 650 | 4 | |a Automatic programming (Computer science) | |
| 810 | 2 | |a Department of Artificial Intelligence: DAI research paper |t University <Edinburgh> |v 604 |w (DE-604)BV010450646 |9 604 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006969606 | ||
Datensatz im Suchindex
| _version_ | 1804124892124151808 |
|---|---|
| any_adam_object | |
| author | Madden, Peter |
| author_facet | Madden, Peter |
| author_role | aut |
| author_sort | Madden, Peter |
| author_variant | p m pm |
| building | Verbundindex |
| bvnumber | BV010460829 |
| classification_tum | DAT 542f DAT 706f DAT 343f |
| ctrlnum | (OCoLC)31987556 (DE-599)BVBBV010460829 |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01937nam a2200373 cb4500</leader><controlfield tag="001">BV010460829</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19961217 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">951102s1992 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)31987556</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010460829</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-91G</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 542f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 706f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 343f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Madden, Peter</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Recursive program optimization through inductive synthesis proof transformation</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Edinburgh</subfield><subfield code="c">1992</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">34 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">University <Edinburgh> / Department of Artificial Intelligence: DAI research paper</subfield><subfield code="v">604</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "The research described in this paper involved developing transformation techniques which increase the efficiency of the original program, the source, by transforming its synthesis proof into one, the target, which yields a computationally more efficient algorithm. We describe a working proof transformation system which, by exploiting the duality between mathematical induction and recursion, employs the novel strategy of optimizing recursive programs by transforming inductive proofs. We compare and contrast this approach with the more traditional approaches to program transformation, and highlight the benefits of proof transformation with regards to search, correctness, automatability and generality."</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Bionics and artificial intelligence</subfield><subfield code="2">sigle</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="7"><subfield code="a">Mathematics</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Automatic programming (Computer science)</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Artificial Intelligence: DAI research paper</subfield><subfield code="t">University <Edinburgh></subfield><subfield code="v">604</subfield><subfield code="w">(DE-604)BV010450646</subfield><subfield code="9">604</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006969606</subfield></datafield></record></collection> |
| id | DE-604.BV010460829 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:52:53Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006969606 |
| oclc_num | 31987556 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 34 S. |
| publishDate | 1992 |
| publishDateSearch | 1992 |
| publishDateSort | 1992 |
| record_format | marc |
| series2 | University <Edinburgh> / Department of Artificial Intelligence: DAI research paper |
| spelling | Madden, Peter Verfasser aut Recursive program optimization through inductive synthesis proof transformation Edinburgh 1992 34 S. txt rdacontent n rdamedia nc rdacarrier University <Edinburgh> / Department of Artificial Intelligence: DAI research paper 604 Abstract: "The research described in this paper involved developing transformation techniques which increase the efficiency of the original program, the source, by transforming its synthesis proof into one, the target, which yields a computationally more efficient algorithm. We describe a working proof transformation system which, by exploiting the duality between mathematical induction and recursion, employs the novel strategy of optimizing recursive programs by transforming inductive proofs. We compare and contrast this approach with the more traditional approaches to program transformation, and highlight the benefits of proof transformation with regards to search, correctness, automatability and generality." Bionics and artificial intelligence sigle Computer software sigle Mathematics sigle Mathematik Automatic programming (Computer science) Department of Artificial Intelligence: DAI research paper University <Edinburgh> 604 (DE-604)BV010450646 604 |
| spellingShingle | Madden, Peter Recursive program optimization through inductive synthesis proof transformation Bionics and artificial intelligence sigle Computer software sigle Mathematics sigle Mathematik Automatic programming (Computer science) |
| title | Recursive program optimization through inductive synthesis proof transformation |
| title_auth | Recursive program optimization through inductive synthesis proof transformation |
| title_exact_search | Recursive program optimization through inductive synthesis proof transformation |
| title_full | Recursive program optimization through inductive synthesis proof transformation |
| title_fullStr | Recursive program optimization through inductive synthesis proof transformation |
| title_full_unstemmed | Recursive program optimization through inductive synthesis proof transformation |
| title_short | Recursive program optimization through inductive synthesis proof transformation |
| title_sort | recursive program optimization through inductive synthesis proof transformation |
| topic | Bionics and artificial intelligence sigle Computer software sigle Mathematics sigle Mathematik Automatic programming (Computer science) |
| topic_facet | Bionics and artificial intelligence Computer software Mathematics Mathematik Automatic programming (Computer science) |
| volume_link | (DE-604)BV010450646 |
| work_keys_str_mv | AT maddenpeter recursiveprogramoptimizationthroughinductivesynthesisprooftransformation |