Toggle navigation
Login
Toggle navigation
JavaScript is disabled for your browser. Some features of this site may not work without it.
An analysis of the Podelski-Rybalchenko termination theorem via bar recursion
QMRO Home
School of Electronic Engineering and Computer Science
Electronic Engineering and Computer Science
An analysis of the Podelski-Rybalchenko termination theorem via bar recursion
QMRO Home
School of Electronic Engineering and Computer Science
Electronic Engineering and Computer Science
An analysis of the Podelski-Rybalchenko termination theorem via bar recursion
Browse
All of QMRO
Communities & Collections
By Issue Date
Authors
Titles
Subjects
This Collection
By Issue Date
Authors
Titles
Subjects
Administrators only
Login
Statistics
Most Popular Items
Statistics by Country
Most Popular Authors
An analysis of the Podelski-Rybalchenko termination theorem via bar recursion
Volume
29
Pagination
555 - 575
DOI
10.1093/logcom/exv058
Journal
JOURNAL OF LOGIC AND COMPUTATION
Issue
4
ISSN
0955-792X
Metadata
Show full item record
Authors
Berardi, S; Oliva, P; Steila, S
URI
http://qmro.qmul.ac.uk/xmlui/handle/123456789/31913
Collections
Electronic Engineering and Computer Science
[3387]
Copyright statements
© The Author, 2015. Published by Oxford University Press. All rights reserved.