MPI-INF Logo
Publications

Server    halma.mpi-inf.mpg.de

Proceedings Article, Paper


@InProceedings
Beitrag in Tagungsband, Workshop
Author, Editor
Author(s):
Cook, Byron
Podelski, Andreas
Rybalchenko, Andrey		dblp
dblp
dblp
Not MPG Author(s):
Cook, Byron
Editor(s):
BibTeX cite key*:
PodelskiRybalchenkoCook2006
Title, Booktitle
Title*:
Termination Proofs for Systems Code
Booktitle*:
PLDI 2006 : Proceedings of the ACM SIGPLAN 2006 Conference on Programming Language Design and Implementation
Event, URLs
Conference URL::
Downloading URL:
http://portal.acm.org/ft_gateway.cfm?id=1134029&type=pdf&coll=GUIDE&dl=GUIDE&CFID=13599655&CFTOKEN=54669777
Event Address*:
Ottawa, Ontario, Canada
Language:
English
Event Date*
(no longer used):
Organization:
Event Start Date:
10 June 2006
Event End Date:
16 June 2006
Publisher
Name*:
ACM
URL:
http://www.acm.org/
Address*:
New York, USA
Type:
Vol, No, Year, pp.
Series:
ACM SIGPLAN Notices
Volume:
41
Number:
6
Month:
Pages:
415-426
Year*:
2006
VG Wort Pages:
ISBN/ISSN:
1-59593-320-4
Sequence Number:
DOI:
Note, Abstract, ©
(LaTeX) Abstract:
Program termination is central to the process of ensuring that systems code can always react. We describe a new program termination prover that performs a path-sensitive and context-sensitive program analysis and provides capacity for large program fragments (i.e. more than 20,000 lines of code) together with support for programming language features such as arbitrarily nested loops, pointers, function-pointers, side-effects, etc.We also present experimental results on device driver dispatch routines from theWindows operating system. The most distinguishing aspect of our tool is how it shifts the balance between the two tasks of constructing and respectively checking the termination argument. Checking becomes the hard step. In this paper we show how we solve the corresponding challenge of checking with binary reachability analysis.
URL for the Abstract:
http://portal.acm.org/citation.cfm?id=1133981.1134029
Download
Access Level:
Public

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:
@INPROCEEDINGS{PodelskiRybalchenkoCook2006,
AUTHOR = {Cook, Byron and Podelski, Andreas and Rybalchenko, Andrey},
 TITLE = {Termination Proofs for Systems Code},
 BOOKTITLE = {PLDI 2006 : Proceedings of the ACM SIGPLAN 2006 Conference on Programming Language Design and Implementation},
 JOURNAL = {ACM SIGPLAN Notices},
 PUBLISHER = {ACM},
 YEAR = {2006},
 NUMBER = {6},
 VOLUME = {41},
 PAGES = {415--426},
 SERIES = {ACM SIGPLAN Notices},
 ADDRESS = {Ottawa, Ontario, Canada},
 ISBN = {1-59593-320-4},
}

Entry last modified by Uwe Brahm, 01/28/2008
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)
Christine Kiesel		Created
03/13/2007 04:07:37 PM
Revisions
4.
3.
2.
1.
0.		Editor(s)
Uwe Brahm
Uwe Brahm
Uwe Brahm
Christine Kiesel
Christine Kiesel		Edit Dates
2007-04-27 15:09:13
2007-04-26 12:55:37
2007-04-26 12:22:04
14.03.2007 05:52:55
13.03.2007 16:11:27