On Excusable and Inexcusable Failures

12 years 7 days ago
On Excusable and Inexcusable Failures
Abstract. The classical concepts of partial and total correctness identify all types of runtime errors and divergence. We argue that the associated notions of translation correctness cannot cope adequately with practical questions like optimizations and finiteness of machines. As a step towards a solution we propose more fine-grained correctness notions, which are parameterized in sets of acceptable failure outcomes, and study a corresponding family of predicate transformers that generalize the well-known wp and wlp transformers. We also discuss the utility of the resulting setup for answering compiler correctness questions.
Markus Müller-Olm, Andreas Wolf
Added 04 Aug 2010
Updated 04 Aug 2010
Type Conference
Year 1999
Where FM
Authors Markus Müller-Olm, Andreas Wolf
Comments (0)