Opening book details…
About this Computer Science article
An analysis of the Podelski–Rybalchenko termination theorem via bar recursion by Berardi, Stefano; Oliva, Paulo; Steila, Silvia is a Computer Science article available to read on EtoBox.
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- Berardi, Stefano; Oliva, Paulo; Steila, Silvia
- Publisher
- Oxford University Press; Oxford University Press (OUP) (ISSN 0955-792X)
- Published
- 2015
- Language
- EN
- Field
- Computer Science (Physical Sciences)
More by Berardi, Stefano; Oliva, Paulo; Steila, Silvia
Browse all works by Berardi, Stefano; Oliva, Paulo; Steila, Silvia