Proving mutual termination of programs

Dima Elenbogen; Shmuel Katz; Ofer Strichman

doi:10.1007/978-3-642-39611-3_9

Proving mutual termination of programs

Dima Elenbogen, Shmuel Katz, Ofer Strichman

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

2 Scopus citations

Abstract

Two programs are said to be mutually terminating if they terminate on exactly the same inputs. We suggest a proof rule that uses a mapping between the functions of the two programs for proving mutual termination of functions f, f′. The rule's premise requires proving that given the same arbitrary input in, f(in) and f'(in) call mapped functions with the same arguments. A variant of this rule with a weaker premise allows to prove termination of one of the programs if the other is known to terminate for all inputs. We present an algorithm for decomposing the verification problem of whole programs to that of proving mutual termination of individual functions, based on our suggested rules.

Original language	English
Title of host publication	Hardware and Software
Subtitle of host publication	Verification and Testing - 8th International Haifa Verification Conference, HVC 2012, Revised Selected Papers
Pages	24-39
Number of pages	16
DOIs	https://doi.org/10.1007/978-3-642-39611-3_9
State	Published - 2013
Event	8th International on Hardware and Software: Verification and Testing, HVC 2012 - Haifa, Israel Duration: 6 Nov 2012 → 8 Nov 2012

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	7857 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	8th International on Hardware and Software: Verification and Testing, HVC 2012
Country/Territory	Israel
City	Haifa
Period	6/11/12 → 8/11/12

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-642-39611-3_9

Cite this

Elenbogen, D., Katz, S., & Strichman, O. (2013). Proving mutual termination of programs. In Hardware and Software: Verification and Testing - 8th International Haifa Verification Conference, HVC 2012, Revised Selected Papers (pp. 24-39). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7857 LNCS). https://doi.org/10.1007/978-3-642-39611-3_9

Elenbogen, Dima ; Katz, Shmuel ; Strichman, Ofer. / Proving mutual termination of programs. Hardware and Software: Verification and Testing - 8th International Haifa Verification Conference, HVC 2012, Revised Selected Papers. 2013. pp. 24-39 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{4abeb23af206457c89607619d3f5694e,

title = "Proving mutual termination of programs",

abstract = "Two programs are said to be mutually terminating if they terminate on exactly the same inputs. We suggest a proof rule that uses a mapping between the functions of the two programs for proving mutual termination of functions f, f′. The rule's premise requires proving that given the same arbitrary input in, f(in) and f'(in) call mapped functions with the same arguments. A variant of this rule with a weaker premise allows to prove termination of one of the programs if the other is known to terminate for all inputs. We present an algorithm for decomposing the verification problem of whole programs to that of proving mutual termination of individual functions, based on our suggested rules.",

author = "Dima Elenbogen and Shmuel Katz and Ofer Strichman",

year = "2013",

doi = "10.1007/978-3-642-39611-3_9",

language = "אנגלית",

isbn = "9783642396106",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "24--39",

booktitle = "Hardware and Software",

note = "8th International on Hardware and Software: Verification and Testing, HVC 2012 ; Conference date: 06-11-2012 Through 08-11-2012",

}

Elenbogen, D, Katz, S & Strichman, O 2013, Proving mutual termination of programs. in Hardware and Software: Verification and Testing - 8th International Haifa Verification Conference, HVC 2012, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7857 LNCS, pp. 24-39, 8th International on Hardware and Software: Verification and Testing, HVC 2012, Haifa, Israel, 6/11/12. https://doi.org/10.1007/978-3-642-39611-3_9

Proving mutual termination of programs. / Elenbogen, Dima; Katz, Shmuel ; Strichman, Ofer.
Hardware and Software: Verification and Testing - 8th International Haifa Verification Conference, HVC 2012, Revised Selected Papers. 2013. p. 24-39 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7857 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Proving mutual termination of programs

AU - Elenbogen, Dima

AU - Katz, Shmuel

AU - Strichman, Ofer

PY - 2013

Y1 - 2013

N2 - Two programs are said to be mutually terminating if they terminate on exactly the same inputs. We suggest a proof rule that uses a mapping between the functions of the two programs for proving mutual termination of functions f, f′. The rule's premise requires proving that given the same arbitrary input in, f(in) and f'(in) call mapped functions with the same arguments. A variant of this rule with a weaker premise allows to prove termination of one of the programs if the other is known to terminate for all inputs. We present an algorithm for decomposing the verification problem of whole programs to that of proving mutual termination of individual functions, based on our suggested rules.

AB - Two programs are said to be mutually terminating if they terminate on exactly the same inputs. We suggest a proof rule that uses a mapping between the functions of the two programs for proving mutual termination of functions f, f′. The rule's premise requires proving that given the same arbitrary input in, f(in) and f'(in) call mapped functions with the same arguments. A variant of this rule with a weaker premise allows to prove termination of one of the programs if the other is known to terminate for all inputs. We present an algorithm for decomposing the verification problem of whole programs to that of proving mutual termination of individual functions, based on our suggested rules.

UR - http://www.scopus.com/inward/record.url?scp=84880741907&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-39611-3_9

DO - 10.1007/978-3-642-39611-3_9

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84880741907

SN - 9783642396106

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 24

EP - 39

BT - Hardware and Software

T2 - 8th International on Hardware and Software: Verification and Testing, HVC 2012

Y2 - 6 November 2012 through 8 November 2012

ER -

Elenbogen D, Katz S , Strichman O. Proving mutual termination of programs. In Hardware and Software: Verification and Testing - 8th International Haifa Verification Conference, HVC 2012, Revised Selected Papers. 2013. p. 24-39. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-39611-3_9

Proving mutual termination of programs

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this