Skip to main content
Conference ProceedingsOPEN ACCESS

Automatically proving program termination

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2007) 4590 LNCS 1
DOI: 10.1007/978-3-540-73368-3_1
1Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this talk I will describe new tools that allow us to automatically prove termination and other liveness properties of software systems. In particular I will discuss the TERMINATOR program termination prover and its application to the problem of showing that Windows device driver event-handling routines always eventually stop responding to events. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Cook, B. (2007). Automatically proving program termination. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4590 LNCS, p. 1). Springer Verlag. https://doi.org/10.1007/978-3-540-73368-3_1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free