Formal Aspects of Polyvariant Specialization
We present the first formal correctness proof of an offline polyvariant specialization algorithm for first-order recursive equations. As a corollary, we show that the specialization algorithm generates a program implementing the search phase of the Knuth-Morris- Pratt algorithm from an inefficient b...
Gespeichert in:
| Veröffentlicht in: | BRICS Report Series 2005-11, Vol.12 (34) |
|---|---|
| 1. Verfasser: | |
| Format: | Artikel |
| Sprache: | eng |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | 34 |
| container_start_page | |
| container_title | BRICS Report Series |
| container_volume | 12 |
| creator | Rohde, Henning Korsholm |
| description | We present the first formal correctness proof of an offline polyvariant specialization algorithm for first-order recursive equations. As a corollary, we show that the specialization algorithm generates a program implementing the search phase of the Knuth-Morris- Pratt algorithm from an inefficient but binding-time-improved string matcher. |
| doi_str_mv | 10.7146/brics.v12i34.21901 |
| format | Article |
| fullrecord | <record><control><sourceid>statsbiblioteket_cross</sourceid><recordid>TN_cdi_crossref_primary_10_7146_brics_v12i34_21901</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>21901</sourcerecordid><originalsourceid>FETCH-LOGICAL-c1431-cd5d74ce3d1d7b9f7dbc70d662352e1dde9e22ef9fe4e4747096f87c3e6a7c303</originalsourceid><addsrcrecordid>eNotj81KAzEUhYMoWGpfwNU8gDPmbyaTlZRiVSgoqOuQSW7g2mlTklCoT29tuzkHDnwHPkLuGW0Uk93jkNDlZs84Ctlwpim7IhPWUVa3om2vyYRqqmvaq_6WzHLGgXIu-15pMSEPy5g2dqzmeQeu5CqG6iOOh71NaLel-jyuaEf8tQXj9o7cBDtmmF16Sr6Xz1-L13r1_vK2mK9qx6RgtfOtV9KB8MyrQQflB6eo7zouWg7Me9DAOQQdQIJUUlHdhV45AZ09JhVTws-_LsWcEwSzS7ix6WAYNf_K5qRszsrmpHyEns5QLrbkAYcRY4E1FBN_sokWT13Q57xOGIrxa2NTQTfC5eEPKd9kOg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Formal Aspects of Polyvariant Specialization</title><source>tidsskrift.dk</source><creator>Rohde, Henning Korsholm</creator><creatorcontrib>Rohde, Henning Korsholm</creatorcontrib><description>We present the first formal correctness proof of an offline polyvariant specialization algorithm for first-order recursive equations. As a corollary, we show that the specialization algorithm generates a program implementing the search phase of the Knuth-Morris- Pratt algorithm from an inefficient but binding-time-improved string matcher.</description><identifier>ISSN: 0909-0878</identifier><identifier>EISSN: 1601-5355</identifier><identifier>DOI: 10.7146/brics.v12i34.21901</identifier><language>eng</language><publisher>Aarhus University</publisher><ispartof>BRICS Report Series, 2005-11, Vol.12 (34)</ispartof><rights>Copyright (c) 2015 BRICS Report Series</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27915,27916</link.rule.ids></links><search><creatorcontrib>Rohde, Henning Korsholm</creatorcontrib><title>Formal Aspects of Polyvariant Specialization</title><title>BRICS Report Series</title><addtitle>BRICS</addtitle><description>We present the first formal correctness proof of an offline polyvariant specialization algorithm for first-order recursive equations. As a corollary, we show that the specialization algorithm generates a program implementing the search phase of the Knuth-Morris- Pratt algorithm from an inefficient but binding-time-improved string matcher.</description><issn>0909-0878</issn><issn>1601-5355</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2005</creationdate><recordtype>article</recordtype><sourceid>5R1</sourceid><recordid>eNotj81KAzEUhYMoWGpfwNU8gDPmbyaTlZRiVSgoqOuQSW7g2mlTklCoT29tuzkHDnwHPkLuGW0Uk93jkNDlZs84Ctlwpim7IhPWUVa3om2vyYRqqmvaq_6WzHLGgXIu-15pMSEPy5g2dqzmeQeu5CqG6iOOh71NaLel-jyuaEf8tQXj9o7cBDtmmF16Sr6Xz1-L13r1_vK2mK9qx6RgtfOtV9KB8MyrQQflB6eo7zouWg7Me9DAOQQdQIJUUlHdhV45AZ09JhVTws-_LsWcEwSzS7ix6WAYNf_K5qRszsrmpHyEns5QLrbkAYcRY4E1FBN_sokWT13Q57xOGIrxa2NTQTfC5eEPKd9kOg</recordid><startdate>20051111</startdate><enddate>20051111</enddate><creator>Rohde, Henning Korsholm</creator><general>Aarhus University</general><scope>5R1</scope><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>20051111</creationdate><title>Formal Aspects of Polyvariant Specialization</title><author>Rohde, Henning Korsholm</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c1431-cd5d74ce3d1d7b9f7dbc70d662352e1dde9e22ef9fe4e4747096f87c3e6a7c303</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2005</creationdate><toplevel>online_resources</toplevel><creatorcontrib>Rohde, Henning Korsholm</creatorcontrib><collection>tidsskrift.dk</collection><collection>CrossRef</collection><jtitle>BRICS Report Series</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Rohde, Henning Korsholm</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Formal Aspects of Polyvariant Specialization</atitle><jtitle>BRICS Report Series</jtitle><stitle>BRICS</stitle><date>2005-11-11</date><risdate>2005</risdate><volume>12</volume><issue>34</issue><issn>0909-0878</issn><eissn>1601-5355</eissn><abstract>We present the first formal correctness proof of an offline polyvariant specialization algorithm for first-order recursive equations. As a corollary, we show that the specialization algorithm generates a program implementing the search phase of the Knuth-Morris- Pratt algorithm from an inefficient but binding-time-improved string matcher.</abstract><pub>Aarhus University</pub><doi>10.7146/brics.v12i34.21901</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0909-0878 |
| ispartof | BRICS Report Series, 2005-11, Vol.12 (34) |
| issn | 0909-0878 1601-5355 |
| language | eng |
| recordid | cdi_crossref_primary_10_7146_brics_v12i34_21901 |
| source | tidsskrift.dk |
| title | Formal Aspects of Polyvariant Specialization |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-14T18%3A27%3A33IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-statsbiblioteket_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Formal%20Aspects%20of%20Polyvariant%20Specialization&rft.jtitle=BRICS%20Report%20Series&rft.au=Rohde,%20Henning%20Korsholm&rft.date=2005-11-11&rft.volume=12&rft.issue=34&rft.issn=0909-0878&rft.eissn=1601-5355&rft_id=info:doi/10.7146/brics.v12i34.21901&rft_dat=%3Cstatsbiblioteket_cross%3E21901%3C/statsbiblioteket_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |