Loading...
Please wait, while we are loading the content...
Similar Documents
Automatic Termination Analysis for Partial Functions Using Polynomial Orderings ?
| Content Provider | Semantic Scholar |
|---|---|
| Author | Brauburger, J. Urgen |
| Copyright Year | 1997 |
| Abstract | We present a method for automatically determining the input data for which functional programs terminate. In particular, we consider functional programs which do not terminate for each input thus deening partial functions. To characterize the domains of such partial functions, termination predicates have been introduced recently. Termination predicates can be synthesized inductively if suitable well-founded orderings are given. Up to now, these well-founded orderings have to be xed in advance by a user. In this paper, we enable the automatic generation of well-founded polynomial orderings for termination predicate synthesis. We illustrate the problems that prevent the direct use of known techniques for that task, and we present solutions for overcoming these problems. The proposed method proved to be successful for numerous examples including functional as well as imperative programs. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://www.inferenzsysteme.informatik.tu-darmstadt.de/~reports/notes/ibn-96-40.ps.gz |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
