Skip to main content
Conference ProceedingsOPEN ACCESS

Proving conditional termination

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2008) 5123 LNCS 328-340
DOI: 10.1007/978-3-540-70545-1_32
61Citations
Citations of this article
25Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We describe a method for synthesizing reasonable underapproximations to weakest preconditions for termination-a long-standing open problem. The paper provides experimental evidence to demonstrate the usefulness of the new procedure. © 2008 Springer-Verlag.

Cite

CITATION STYLE

APA

Cook, B., Gulwani, S., Lev-Ami, T., Rybalchenko, A., & Sagiv, M. (2008). Proving conditional termination. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5123 LNCS, pp. 328–340). Springer Verlag. https://doi.org/10.1007/978-3-540-70545-1_32

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