Name
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. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1007/978-3-642-39611-3_9 | Haifa Verification Conference |
Keywords | Field | DocType |
mutual termination,suggested rule,proof rule,whole program,verification problem,mapped function,individual function,arbitrary input,weaker premise | Subroutine,Computer science,Theoretical computer science,Premise,Normalization property,Recursive functions | Conference |
Citations | PageRank | References |
1 | 0.37 | 9 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dima Elenbogen | 1 | 3 | 0.73 |
| Shmuel Katz | 2 | 1357 | 292.62 |
| Ofer Strichman | 3 | 1071 | 63.61 |