The Dependency Pair Framework: Combining Techniques for Automated Termination Proofs
The dependency pair approach is one of the most powerful techniques for automated termination proofs of term rewrite systems. Up to now, it was regarded as one of several possible methods to prove termination. In this paper, we show that dependency pairs can instead be used as a general concept to i...
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 | 331 |
|---|---|
| container_issue | |
| container_start_page | 301 |
| container_title | |
| container_volume | |
| creator | Giesl, Jürgen Thiemann, René Schneider-Kamp, Peter |
| description | The dependency pair approach is one of the most powerful techniques for automated termination proofs of term rewrite systems. Up to now, it was regarded as one of several possible methods to prove termination. In this paper, we show that dependency pairs can instead be used as a general concept to integrate arbitrary techniques for termination analysis. In this way, the benefits of different techniques can be combined and their modularity and power are increased significantly. We[2] refer to this new concept as the “dependency pair framework” to distinguish it from the old “dependency pair approach”. Moreover, this framework facilitates the development of new methods for termination analysis. To demonstrate this, we present several new techniques within the dependency pair framework which simplify termination problems considerably. We implemented the dependency pair framework in our termination prover AProVE and evaluated it on large collections of examples. |
| doi_str_mv | 10.1007/978-3-540-32275-7_21 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>pascalfrancis_sprin</sourceid><recordid>TN_cdi_pascalfrancis_primary_16923058</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>16923058</sourcerecordid><originalsourceid>FETCH-LOGICAL-c345t-32761f7e5bdc1a5497bea7323487ea24f2a1161603c8c527f63bfc93560ec80d3</originalsourceid><addsrcrecordid>eNo9kM1OwzAQhM2fRFX6Bhxy4RiwvbGdcKsKBaRK9BDOluM4rWljFzsI9e1xW8ReRpoZrTQfQrcE3xOMxUMlyhxyVuAcKBUsF5KSMzRJNiTz6IlzNCKckBygqC7-M8oo8PISjTBgmleigGs0ifETpwNS8qocobpem-zJ7IxrjdP7bKlsyOZB9ebHh81jNvN9Y511q6w2eu3s17eJWedDNv0efK8G06Yg9NapwXqXLYP3XbxBV53aRjP50zH6mD_Xs9d88f7yNpsucg0FG9IewUknDGtaTRQrKtEYJYBCUQqjaNFRRdIsjkGXmlHRcWg6XQHj2OgStzBGd6e_OxW12nZBOW2j3AXbq7CXhFcUMCtTj556MUVuZYJsvN9ESbA8IJaJlwSZiMkjTnlADL9LAWkk</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>The Dependency Pair Framework: Combining Techniques for Automated Termination Proofs</title><source>Springer Books</source><creator>Giesl, Jürgen ; Thiemann, René ; Schneider-Kamp, Peter</creator><contributor>Baader, Franz ; Voronkov, Andrei</contributor><creatorcontrib>Giesl, Jürgen ; Thiemann, René ; Schneider-Kamp, Peter ; Baader, Franz ; Voronkov, Andrei</creatorcontrib><description>The dependency pair approach is one of the most powerful techniques for automated termination proofs of term rewrite systems. Up to now, it was regarded as one of several possible methods to prove termination. In this paper, we show that dependency pairs can instead be used as a general concept to integrate arbitrary techniques for termination analysis. In this way, the benefits of different techniques can be combined and their modularity and power are increased significantly. We[2] refer to this new concept as the “dependency pair framework” to distinguish it from the old “dependency pair approach”. Moreover, this framework facilitates the development of new methods for termination analysis. To demonstrate this, we present several new techniques within the dependency pair framework which simplify termination problems considerably. We implemented the dependency pair framework in our termination prover AProVE and evaluated it on large collections of examples.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 9783540252368</identifier><identifier>ISBN: 3540252363</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 9783540322757</identifier><identifier>EISBN: 3540322752</identifier><identifier>DOI: 10.1007/978-3-540-32275-7_21</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Applied sciences ; Artificial intelligence ; Computer science; control theory; systems ; Dependency Graph ; Exact sciences and technology ; Function Symbol ; Learning and adaptive systems ; Logical, boolean and switching functions ; Normal Form ; Termination Proof ; Theoretical computing ; Usable Rule</subject><ispartof>Lecture notes in computer science, 2005, p.301-331</ispartof><rights>Springer-Verlag Berlin Heidelberg 2005</rights><rights>2005 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c345t-32761f7e5bdc1a5497bea7323487ea24f2a1161603c8c527f63bfc93560ec80d3</citedby></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/978-3-540-32275-7_21$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/978-3-540-32275-7_21$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,775,776,780,785,786,789,4036,4037,27902,38232,41418,42487</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=16923058$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Baader, Franz</contributor><contributor>Voronkov, Andrei</contributor><creatorcontrib>Giesl, Jürgen</creatorcontrib><creatorcontrib>Thiemann, René</creatorcontrib><creatorcontrib>Schneider-Kamp, Peter</creatorcontrib><title>The Dependency Pair Framework: Combining Techniques for Automated Termination Proofs</title><title>Lecture notes in computer science</title><description>The dependency pair approach is one of the most powerful techniques for automated termination proofs of term rewrite systems. Up to now, it was regarded as one of several possible methods to prove termination. In this paper, we show that dependency pairs can instead be used as a general concept to integrate arbitrary techniques for termination analysis. In this way, the benefits of different techniques can be combined and their modularity and power are increased significantly. We[2] refer to this new concept as the “dependency pair framework” to distinguish it from the old “dependency pair approach”. Moreover, this framework facilitates the development of new methods for termination analysis. To demonstrate this, we present several new techniques within the dependency pair framework which simplify termination problems considerably. We implemented the dependency pair framework in our termination prover AProVE and evaluated it on large collections of examples.</description><subject>Applied sciences</subject><subject>Artificial intelligence</subject><subject>Computer science; control theory; systems</subject><subject>Dependency Graph</subject><subject>Exact sciences and technology</subject><subject>Function Symbol</subject><subject>Learning and adaptive systems</subject><subject>Logical, boolean and switching functions</subject><subject>Normal Form</subject><subject>Termination Proof</subject><subject>Theoretical computing</subject><subject>Usable Rule</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>9783540252368</isbn><isbn>3540252363</isbn><isbn>9783540322757</isbn><isbn>3540322752</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2005</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNo9kM1OwzAQhM2fRFX6Bhxy4RiwvbGdcKsKBaRK9BDOluM4rWljFzsI9e1xW8ReRpoZrTQfQrcE3xOMxUMlyhxyVuAcKBUsF5KSMzRJNiTz6IlzNCKckBygqC7-M8oo8PISjTBgmleigGs0ifETpwNS8qocobpem-zJ7IxrjdP7bKlsyOZB9ebHh81jNvN9Y511q6w2eu3s17eJWedDNv0efK8G06Yg9NapwXqXLYP3XbxBV53aRjP50zH6mD_Xs9d88f7yNpsucg0FG9IewUknDGtaTRQrKtEYJYBCUQqjaNFRRdIsjkGXmlHRcWg6XQHj2OgStzBGd6e_OxW12nZBOW2j3AXbq7CXhFcUMCtTj556MUVuZYJsvN9ESbA8IJaJlwSZiMkjTnlADL9LAWkk</recordid><startdate>2005</startdate><enddate>2005</enddate><creator>Giesl, Jürgen</creator><creator>Thiemann, René</creator><creator>Schneider-Kamp, Peter</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>2005</creationdate><title>The Dependency Pair Framework: Combining Techniques for Automated Termination Proofs</title><author>Giesl, Jürgen ; Thiemann, René ; Schneider-Kamp, Peter</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c345t-32761f7e5bdc1a5497bea7323487ea24f2a1161603c8c527f63bfc93560ec80d3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Applied sciences</topic><topic>Artificial intelligence</topic><topic>Computer science; control theory; systems</topic><topic>Dependency Graph</topic><topic>Exact sciences and technology</topic><topic>Function Symbol</topic><topic>Learning and adaptive systems</topic><topic>Logical, boolean and switching functions</topic><topic>Normal Form</topic><topic>Termination Proof</topic><topic>Theoretical computing</topic><topic>Usable Rule</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Giesl, Jürgen</creatorcontrib><creatorcontrib>Thiemann, René</creatorcontrib><creatorcontrib>Schneider-Kamp, Peter</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Giesl, Jürgen</au><au>Thiemann, René</au><au>Schneider-Kamp, Peter</au><au>Baader, Franz</au><au>Voronkov, Andrei</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>The Dependency Pair Framework: Combining Techniques for Automated Termination Proofs</atitle><btitle>Lecture notes in computer science</btitle><date>2005</date><risdate>2005</risdate><spage>301</spage><epage>331</epage><pages>301-331</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>9783540252368</isbn><isbn>3540252363</isbn><eisbn>9783540322757</eisbn><eisbn>3540322752</eisbn><abstract>The dependency pair approach is one of the most powerful techniques for automated termination proofs of term rewrite systems. Up to now, it was regarded as one of several possible methods to prove termination. In this paper, we show that dependency pairs can instead be used as a general concept to integrate arbitrary techniques for termination analysis. In this way, the benefits of different techniques can be combined and their modularity and power are increased significantly. We[2] refer to this new concept as the “dependency pair framework” to distinguish it from the old “dependency pair approach”. Moreover, this framework facilitates the development of new methods for termination analysis. To demonstrate this, we present several new techniques within the dependency pair framework which simplify termination problems considerably. We implemented the dependency pair framework in our termination prover AProVE and evaluated it on large collections of examples.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/978-3-540-32275-7_21</doi><tpages>31</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0302-9743 |
| ispartof | Lecture notes in computer science, 2005, p.301-331 |
| issn | 0302-9743 1611-3349 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_16923058 |
| source | Springer Books |
| subjects | Applied sciences Artificial intelligence Computer science control theory systems Dependency Graph Exact sciences and technology Function Symbol Learning and adaptive systems Logical, boolean and switching functions Normal Form Termination Proof Theoretical computing Usable Rule |
| title | The Dependency Pair Framework: Combining Techniques for Automated Termination Proofs |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-02T16%3A08%3A27IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_sprin&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=The%20Dependency%20Pair%20Framework:%20Combining%20Techniques%20for%20Automated%20Termination%20Proofs&rft.btitle=Lecture%20notes%20in%20computer%20science&rft.au=Giesl,%20J%C3%BCrgen&rft.date=2005&rft.spage=301&rft.epage=331&rft.pages=301-331&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=9783540252368&rft.isbn_list=3540252363&rft_id=info:doi/10.1007/978-3-540-32275-7_21&rft_dat=%3Cpascalfrancis_sprin%3E16923058%3C/pascalfrancis_sprin%3E%3Curl%3E%3C/url%3E&rft.eisbn=9783540322757&rft.eisbn_list=3540322752&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |