Journal Article
@Article
Artikel in Fachzeitschrift


Show entries of:

this year (2019) | last year (2018) | two years ago (2017) | Notes URL

Action:

login to update

Options:








Author, Editor(s)

Author(s):

Ben-Amram, Amir M.
Lee, Chin Soon

dblp
dblp

Not MPG Author(s):

Ben-Amram, Amir M.

BibTeX cite key*:

BenAmramLee2007

Title

Title*:

Program termination analysis in polynomial time

Journal

Journal Title*:

ACM Transactions on Programming Languages and Systems

Journal's URL:


Download URL
for the article:


Language:

English

Publisher

Publisher's
Name:

ACM

Publisher's URL:


Publisher's
Address:

New York, NY, USA

ISSN:

0164-0925

Vol, No, pp, Date

Volume*:

29

Number:

1

Publishing Date:

January 2007

Pages*:

5:1-37

Number of
VG Pages:


Page Start:

1

Page End:

37

Sequence Number:

5

DOI:

10.1145/1180475.1180480

Note, Abstract, ©

Note:


(LaTeX) Abstract:

In an earlier work with Neil D.~Jones, we proposed the ``size-change principle'' for program termination: An infinite computation is \emph{impossible}, if it would imply that some data decrease in size infinitely. Such a property can be deduced from program analysis information in the form of \emph{size-change graphs}. A set of size-change graphs with the desired property is said to satisfy \emph{size-change termination} (SCT). There are many examples of practical programs whose termination can be verified by creating size-change graphs and testing them for SCT.
While SCT is decidable, it has high worst-case complexity (complete for \sctext{pspace}). In this paper, we formulate an efficient approach to verify practical instances of SCT. Our procedure has worst-case complexity cubic in the input size.
Its effectiveness is demonstrated empirically using a test-suite of over 90 programs.

URL for the Abstract:


Categories,
Keywords:


HyperLinks / References / URLs:


Copyright Message:


Personal Comments:


Download
Access Level:

Internal

Correlation

MPG Unit:

Max-Planck-Institut für Informatik



MPG Subunit:

Programming Logics Group

Audience:

Expert

Appearance:

MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat, VG Wort


BibTeX Entry:

@ARTICLE{BenAmramLee2007,
AUTHOR = {Ben-Amram, Amir M. and Lee, Chin Soon},
TITLE = {Program termination analysis in polynomial time},
JOURNAL = {ACM Transactions on Programming Languages and Systems},
PUBLISHER = {ACM},
YEAR = {2007},
NUMBER = {1},
VOLUME = {29},
PAGES = {5:1--37},
ADDRESS = {New York, NY, USA},
MONTH = {January},
ISBN = {0164-0925},
DOI = {10.1145/1180475.1180480},
}


Entry last modified by Anja Becker, 02/28/2008
Show details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

Editor(s)
Anja Becker
Created
02/07/2008 12:41:57 PM
Revision
0.



Editor
Anja Becker



Edit Date
07.02.2008 13:01:13