Analyzing logic programs using “ prop”-ositional logic programs and a magic wand
This paper illustrates the role of a class of “prop”-ositional logic programs in the analysis of complex properties of logic programs. Analyses are performed by abstracting Prolog programs to corresponding “prop”-ositional logic programs which approximate the original programs and have finite meanin...
Gespeichert in:
| Veröffentlicht in: | The journal of logic programming 1995-12, Vol.25 (3), p.249-274 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 274 |
|---|---|
| container_issue | 3 |
| container_start_page | 249 |
| container_title | The journal of logic programming |
| container_volume | 25 |
| creator | Codish, Michael Demoen, Bart |
| description | This paper illustrates the role of a class of “prop”-ositional logic programs in the analysis of complex properties of logic programs. Analyses are performed by abstracting Prolog programs to corresponding “prop”-ositional logic programs which approximate the original programs and have finite meanings. We focus on a groundness analysis which is equivalent to that obtained by abstract interpretation using the domain
Prop. The main contribution is in the ease in which a highly efficient implementation of the analysis is obtained. The implementation is bottom-up and provides approximations of a program's
success patterns. Goal-dependent information such as
call patterns is obtained using a magic-set transformation. A novel compositional approach is applied so that call patterns for arbitrary goals are derived in a precise and efficient way. |
| doi_str_mv | 10.1016/0743-1066(95)00064-X |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_27461997</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>074310669500064X</els_id><sourcerecordid>27461997</sourcerecordid><originalsourceid>FETCH-LOGICAL-c438t-a33fc565ac45e3fc4ee37c2ae7698ba126e93b5a68dac51b1937bd35b24e1f883</originalsourceid><addsrcrecordid>eNp9kMtKAzEUhoMoWKtv4GIWIroYTSaXmWyEUrxBwU2F7sKZTKZE5lKTqVJXfRB9uT6JGStduHB1zvn5zu1H6JTgK4KJuMYpozHBQlxIfokxFiye7aEByVIa8zST-2iwQw7RkfcvASKE8AGajhqoVh-2mUdVO7c6Wrh27qD20dL34mb92UuLzforbr3tbBv4vyg0RQRRDb34HopjdFBC5c3Jbxyi57vb6fghnjzdP45Hk1gzmnUxUFpqLjhoxk1ImTE01QmYVMgsB5III2nOQWQFaE5yImmaF5TnCTOkzDI6ROfbueGS16Xxnaqt16aqoDHt0qskZYJImQaQbUHtWu-dKdXC2RrcShGsegtV74_q_VGSqx8L1Sy0nf3OB6-hKh002vpdbyI5o5gG7GaLmfDrmzVOeW1No01hndGdKlr7_55v53qHjg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>27461997</pqid></control><display><type>article</type><title>Analyzing logic programs using “ prop”-ositional logic programs and a magic wand</title><source>Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals</source><source>Alma/SFX Local Collection</source><creator>Codish, Michael ; Demoen, Bart</creator><creatorcontrib>Codish, Michael ; Demoen, Bart</creatorcontrib><description>This paper illustrates the role of a class of “prop”-ositional logic programs in the analysis of complex properties of logic programs. Analyses are performed by abstracting Prolog programs to corresponding “prop”-ositional logic programs which approximate the original programs and have finite meanings. We focus on a groundness analysis which is equivalent to that obtained by abstract interpretation using the domain
Prop. The main contribution is in the ease in which a highly efficient implementation of the analysis is obtained. The implementation is bottom-up and provides approximations of a program's
success patterns. Goal-dependent information such as
call patterns is obtained using a magic-set transformation. A novel compositional approach is applied so that call patterns for arbitrary goals are derived in a precise and efficient way.</description><identifier>ISSN: 0743-1066</identifier><identifier>EISSN: 1873-5789</identifier><identifier>DOI: 10.1016/0743-1066(95)00064-X</identifier><identifier>CODEN: JLPRE2</identifier><language>eng</language><publisher>New-York, NY: Elsevier Inc</publisher><subject>Applied sciences ; Artificial intelligence ; Computer science; control theory; systems ; Exact sciences and technology ; Learning and adaptive systems ; Programming theory ; Software ; Software engineering ; Theoretical computing</subject><ispartof>The journal of logic programming, 1995-12, Vol.25 (3), p.249-274</ispartof><rights>1995</rights><rights>1996 INIST-CNRS</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c438t-a33fc565ac45e3fc4ee37c2ae7698ba126e93b5a68dac51b1937bd35b24e1f883</citedby><cites>FETCH-LOGICAL-c438t-a33fc565ac45e3fc4ee37c2ae7698ba126e93b5a68dac51b1937bd35b24e1f883</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27922,27923</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=2954303$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Codish, Michael</creatorcontrib><creatorcontrib>Demoen, Bart</creatorcontrib><title>Analyzing logic programs using “ prop”-ositional logic programs and a magic wand</title><title>The journal of logic programming</title><description>This paper illustrates the role of a class of “prop”-ositional logic programs in the analysis of complex properties of logic programs. Analyses are performed by abstracting Prolog programs to corresponding “prop”-ositional logic programs which approximate the original programs and have finite meanings. We focus on a groundness analysis which is equivalent to that obtained by abstract interpretation using the domain
Prop. The main contribution is in the ease in which a highly efficient implementation of the analysis is obtained. The implementation is bottom-up and provides approximations of a program's
success patterns. Goal-dependent information such as
call patterns is obtained using a magic-set transformation. A novel compositional approach is applied so that call patterns for arbitrary goals are derived in a precise and efficient way.</description><subject>Applied sciences</subject><subject>Artificial intelligence</subject><subject>Computer science; control theory; systems</subject><subject>Exact sciences and technology</subject><subject>Learning and adaptive systems</subject><subject>Programming theory</subject><subject>Software</subject><subject>Software engineering</subject><subject>Theoretical computing</subject><issn>0743-1066</issn><issn>1873-5789</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1995</creationdate><recordtype>article</recordtype><recordid>eNp9kMtKAzEUhoMoWKtv4GIWIroYTSaXmWyEUrxBwU2F7sKZTKZE5lKTqVJXfRB9uT6JGStduHB1zvn5zu1H6JTgK4KJuMYpozHBQlxIfokxFiye7aEByVIa8zST-2iwQw7RkfcvASKE8AGajhqoVh-2mUdVO7c6Wrh27qD20dL34mb92UuLzforbr3tbBv4vyg0RQRRDb34HopjdFBC5c3Jbxyi57vb6fghnjzdP45Hk1gzmnUxUFpqLjhoxk1ImTE01QmYVMgsB5III2nOQWQFaE5yImmaF5TnCTOkzDI6ROfbueGS16Xxnaqt16aqoDHt0qskZYJImQaQbUHtWu-dKdXC2RrcShGsegtV74_q_VGSqx8L1Sy0nf3OB6-hKh002vpdbyI5o5gG7GaLmfDrmzVOeW1No01hndGdKlr7_55v53qHjg</recordid><startdate>19951201</startdate><enddate>19951201</enddate><creator>Codish, Michael</creator><creator>Demoen, Bart</creator><general>Elsevier Inc</general><general>Elsevier</general><scope>6I.</scope><scope>AAFTH</scope><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>19951201</creationdate><title>Analyzing logic programs using “ prop”-ositional logic programs and a magic wand</title><author>Codish, Michael ; Demoen, Bart</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c438t-a33fc565ac45e3fc4ee37c2ae7698ba126e93b5a68dac51b1937bd35b24e1f883</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1995</creationdate><topic>Applied sciences</topic><topic>Artificial intelligence</topic><topic>Computer science; control theory; systems</topic><topic>Exact sciences and technology</topic><topic>Learning and adaptive systems</topic><topic>Programming theory</topic><topic>Software</topic><topic>Software engineering</topic><topic>Theoretical computing</topic><toplevel>online_resources</toplevel><creatorcontrib>Codish, Michael</creatorcontrib><creatorcontrib>Demoen, Bart</creatorcontrib><collection>ScienceDirect Open Access Titles</collection><collection>Elsevier:ScienceDirect:Open Access</collection><collection>Pascal-Francis</collection><collection>CrossRef</collection><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><jtitle>The journal of logic programming</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Codish, Michael</au><au>Demoen, Bart</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Analyzing logic programs using “ prop”-ositional logic programs and a magic wand</atitle><jtitle>The journal of logic programming</jtitle><date>1995-12-01</date><risdate>1995</risdate><volume>25</volume><issue>3</issue><spage>249</spage><epage>274</epage><pages>249-274</pages><issn>0743-1066</issn><eissn>1873-5789</eissn><coden>JLPRE2</coden><abstract>This paper illustrates the role of a class of “prop”-ositional logic programs in the analysis of complex properties of logic programs. Analyses are performed by abstracting Prolog programs to corresponding “prop”-ositional logic programs which approximate the original programs and have finite meanings. We focus on a groundness analysis which is equivalent to that obtained by abstract interpretation using the domain
Prop. The main contribution is in the ease in which a highly efficient implementation of the analysis is obtained. The implementation is bottom-up and provides approximations of a program's
success patterns. Goal-dependent information such as
call patterns is obtained using a magic-set transformation. A novel compositional approach is applied so that call patterns for arbitrary goals are derived in a precise and efficient way.</abstract><cop>New-York, NY</cop><pub>Elsevier Inc</pub><doi>10.1016/0743-1066(95)00064-X</doi><tpages>26</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0743-1066 |
| ispartof | The journal of logic programming, 1995-12, Vol.25 (3), p.249-274 |
| issn | 0743-1066 1873-5789 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_27461997 |
| source | Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals; Alma/SFX Local Collection |
| subjects | Applied sciences Artificial intelligence Computer science control theory systems Exact sciences and technology Learning and adaptive systems Programming theory Software Software engineering Theoretical computing |
| title | Analyzing logic programs using “ prop”-ositional logic programs and a magic wand |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-10T02%3A13%3A19IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Analyzing%20logic%20programs%20using%20%E2%80%9C%20prop%E2%80%9D-ositional%20logic%20programs%20and%20a%20magic%20wand&rft.jtitle=The%20journal%20of%20logic%20programming&rft.au=Codish,%20Michael&rft.date=1995-12-01&rft.volume=25&rft.issue=3&rft.spage=249&rft.epage=274&rft.pages=249-274&rft.issn=0743-1066&rft.eissn=1873-5789&rft.coden=JLPRE2&rft_id=info:doi/10.1016/0743-1066(95)00064-X&rft_dat=%3Cproquest_cross%3E27461997%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=27461997&rft_id=info:pmid/&rft_els_id=074310669500064X&rfr_iscdi=true |