Compiling dataflow analysis of logic programs
Abstract interpretation is a technique extensively used for global dataflow analyses of logic programs. Existing implementations of abstract interpretation are slow due to interpretive or transforming overhead and the inefficiency in manipulation of global information. Since abstract interpretation...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 115 |
|---|---|
| container_issue | |
| container_start_page | 106 |
| container_title | |
| container_volume | |
| creator | Tan, Jichang Lin, I-Peng |
| description | Abstract interpretation is a technique extensively used for global dataflow analyses of logic programs. Existing implementations of abstract interpretation are slow due to interpretive or transforming overhead and the inefficiency in manipulation of global information. Since abstract interpretation mimics standard interpretation, it is a promising alternative to compile abstract interpretation into the framework of the WAM (Warren Abstract Machine) for better performance. In this paper, we show how this approach can be effectively implemented in a low-cost manner. To evaluate the possible benefits of this approach, a prototype dataflow analyzer has been implemented for inference of mode, type and variable aliasing information of logic programs. For a subset of benchmark programs in [15], it significantly improves the performance by a factor of over 150 on the average. |
| doi_str_mv | 10.1145/143095.143123 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>proquest_acm_b</sourceid><recordid>TN_cdi_proquest_miscellaneous_31085574</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>31085574</sourcerecordid><originalsourceid>FETCH-LOGICAL-a1383-2546129aeb6e51f34b87a31a4a69e52ebec5bf8c876f9b4298d32b150a1b8d1c3</originalsourceid><addsrcrecordid>eNqFkEtLxDAUhQMqOIxduu_KlR1z82iSpRRfMOBG1-GmTUo1nYzNDOK_t1LBpWdzNh_nwEfIJdANgJA3IDg1cjMXMH5CCqM01UYZEErqU7KivGYVcEHPSZHzG52jlJmZFamaNO6HOOz6ssMDhpg-S9xh_MpDLlMoY-qHttxPqZ9wzBfkLGDMvvjtNXm9v3tpHqvt88NTc7utELjmFZOiBmbQu9pLCFw4rZADCqyNl8w730oXdKtVHYwTzOiOMweSIjjdQcvX5GrZnY8_jj4f7Djk1seIO5-O2XKgWkolZvB6AbEdrUvpPVug9keKXaTYRYp10-DD3-4_OP8GxmReew</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype><pqid>31085574</pqid></control><display><type>conference_proceeding</type><title>Compiling dataflow analysis of logic programs</title><source>ACM Digital Library Complete</source><creator>Tan, Jichang ; Lin, I-Peng</creator><contributor>Wexelblat, Richard L.</contributor><creatorcontrib>Tan, Jichang ; Lin, I-Peng ; Wexelblat, Richard L.</creatorcontrib><description>Abstract interpretation is a technique extensively used for global dataflow analyses of logic programs. Existing implementations of abstract interpretation are slow due to interpretive or transforming overhead and the inefficiency in manipulation of global information. Since abstract interpretation mimics standard interpretation, it is a promising alternative to compile abstract interpretation into the framework of the WAM (Warren Abstract Machine) for better performance. In this paper, we show how this approach can be effectively implemented in a low-cost manner. To evaluate the possible benefits of this approach, a prototype dataflow analyzer has been implemented for inference of mode, type and variable aliasing information of logic programs. For a subset of benchmark programs in [15], it significantly improves the performance by a factor of over 150 on the average.</description><identifier>ISSN: 0362-1340</identifier><identifier>ISBN: 9780897914758</identifier><identifier>ISBN: 0897914759</identifier><identifier>DOI: 10.1145/143095.143123</identifier><language>eng</language><publisher>New York, NY, USA: ACM</publisher><subject>Software and its engineering -- Software notations and tools -- Compilers ; Software and its engineering -- Software notations and tools -- General programming languages -- Language types ; Theory of computation -- Logic -- Constraint and logic programming</subject><ispartof>Proceedings of the ACM SIGPLAN 1992 conference on Programming language design and implementation, 1992, p.106-115</ispartof><rights>1992 ACM</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>309,310,780,784,789,790,23930,23931,25140,27925</link.rule.ids></links><search><contributor>Wexelblat, Richard L.</contributor><creatorcontrib>Tan, Jichang</creatorcontrib><creatorcontrib>Lin, I-Peng</creatorcontrib><title>Compiling dataflow analysis of logic programs</title><title>Proceedings of the ACM SIGPLAN 1992 conference on Programming language design and implementation</title><description>Abstract interpretation is a technique extensively used for global dataflow analyses of logic programs. Existing implementations of abstract interpretation are slow due to interpretive or transforming overhead and the inefficiency in manipulation of global information. Since abstract interpretation mimics standard interpretation, it is a promising alternative to compile abstract interpretation into the framework of the WAM (Warren Abstract Machine) for better performance. In this paper, we show how this approach can be effectively implemented in a low-cost manner. To evaluate the possible benefits of this approach, a prototype dataflow analyzer has been implemented for inference of mode, type and variable aliasing information of logic programs. For a subset of benchmark programs in [15], it significantly improves the performance by a factor of over 150 on the average.</description><subject>Software and its engineering -- Software notations and tools -- Compilers</subject><subject>Software and its engineering -- Software notations and tools -- General programming languages -- Language types</subject><subject>Theory of computation -- Logic -- Constraint and logic programming</subject><issn>0362-1340</issn><isbn>9780897914758</isbn><isbn>0897914759</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>1992</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNqFkEtLxDAUhQMqOIxduu_KlR1z82iSpRRfMOBG1-GmTUo1nYzNDOK_t1LBpWdzNh_nwEfIJdANgJA3IDg1cjMXMH5CCqM01UYZEErqU7KivGYVcEHPSZHzG52jlJmZFamaNO6HOOz6ssMDhpg-S9xh_MpDLlMoY-qHttxPqZ9wzBfkLGDMvvjtNXm9v3tpHqvt88NTc7utELjmFZOiBmbQu9pLCFw4rZADCqyNl8w730oXdKtVHYwTzOiOMweSIjjdQcvX5GrZnY8_jj4f7Djk1seIO5-O2XKgWkolZvB6AbEdrUvpPVug9keKXaTYRYp10-DD3-4_OP8GxmReew</recordid><startdate>19920701</startdate><enddate>19920701</enddate><creator>Tan, Jichang</creator><creator>Lin, I-Peng</creator><general>ACM</general><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>19920701</creationdate><title>Compiling dataflow analysis of logic programs</title><author>Tan, Jichang ; Lin, I-Peng</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a1383-2546129aeb6e51f34b87a31a4a69e52ebec5bf8c876f9b4298d32b150a1b8d1c3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>1992</creationdate><topic>Software and its engineering -- Software notations and tools -- Compilers</topic><topic>Software and its engineering -- Software notations and tools -- General programming languages -- Language types</topic><topic>Theory of computation -- Logic -- Constraint and logic programming</topic><toplevel>online_resources</toplevel><creatorcontrib>Tan, Jichang</creatorcontrib><creatorcontrib>Lin, I-Peng</creatorcontrib><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Tan, Jichang</au><au>Lin, I-Peng</au><au>Wexelblat, Richard L.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Compiling dataflow analysis of logic programs</atitle><btitle>Proceedings of the ACM SIGPLAN 1992 conference on Programming language design and implementation</btitle><date>1992-07-01</date><risdate>1992</risdate><spage>106</spage><epage>115</epage><pages>106-115</pages><issn>0362-1340</issn><isbn>9780897914758</isbn><isbn>0897914759</isbn><abstract>Abstract interpretation is a technique extensively used for global dataflow analyses of logic programs. Existing implementations of abstract interpretation are slow due to interpretive or transforming overhead and the inefficiency in manipulation of global information. Since abstract interpretation mimics standard interpretation, it is a promising alternative to compile abstract interpretation into the framework of the WAM (Warren Abstract Machine) for better performance. In this paper, we show how this approach can be effectively implemented in a low-cost manner. To evaluate the possible benefits of this approach, a prototype dataflow analyzer has been implemented for inference of mode, type and variable aliasing information of logic programs. For a subset of benchmark programs in [15], it significantly improves the performance by a factor of over 150 on the average.</abstract><cop>New York, NY, USA</cop><pub>ACM</pub><doi>10.1145/143095.143123</doi><tpages>10</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0362-1340 |
| ispartof | Proceedings of the ACM SIGPLAN 1992 conference on Programming language design and implementation, 1992, p.106-115 |
| issn | 0362-1340 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_31085574 |
| source | ACM Digital Library Complete |
| subjects | Software and its engineering -- Software notations and tools -- Compilers Software and its engineering -- Software notations and tools -- General programming languages -- Language types Theory of computation -- Logic -- Constraint and logic programming |
| title | Compiling dataflow analysis of logic programs |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-03T13%3A31%3A25IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_acm_b&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Compiling%20dataflow%20analysis%20of%20logic%20programs&rft.btitle=Proceedings%20of%20the%20ACM%20SIGPLAN%201992%20conference%20on%20Programming%20language%20design%20and%20implementation&rft.au=Tan,%20Jichang&rft.date=1992-07-01&rft.spage=106&rft.epage=115&rft.pages=106-115&rft.issn=0362-1340&rft.isbn=9780897914758&rft.isbn_list=0897914759&rft_id=info:doi/10.1145/143095.143123&rft_dat=%3Cproquest_acm_b%3E31085574%3C/proquest_acm_b%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=31085574&rft_id=info:pmid/&rfr_iscdi=true |