Coinductive Natural Semantics for Compiler Verification in Coq

Zúñiga, Angel; Bel-Enguix, Gemma

doi:10.3390/math8091573

Cited by 3 publications

(1 citation statement)

References 55 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, in their original forms only the latter can distinguish stuck computations from infinite computations. This limitation has been addressed by using coinductive variants of big-step semantics that can account for non-terminating behaviour [Leroy 2006a;Zúñiga and Bel-Enguix 2020].…”

Section: Related Workmentioning

confidence: 99%

Monadic compiler calculation (functional pearl)

Bahr

Hutton

2022

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

Bahr and Hutton recently developed a new approach to calculating correct compilers directly from specifications of their correctness. However, the methodology only considers converging behaviour of the source language, which means that the compiler could potentially produce arbitrary, erroneous code for source programs that diverge. In this article, we show how the methodology can naturally be extended to support the calculation of compilers that address both convergent and divergent behaviour simultaneously , without the need for separate reasoning for each aspect. Our approach is based on the use of the partiality monad to make divergence explicit, together with the use of strong bisimilarity to support equational-style calculations, but also generalises to other forms of effect by changing the underlying monad.

show abstract

Section: Related Workmentioning

confidence: 99%

Monadic compiler calculation (functional pearl)

Bahr

Hutton

2022

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

show abstract

On Coevaluation Behavior and Equivalence

Zúñiga

Bel-Enguix

2022

Mathematics

View full text Add to dashboard Cite

Coevaluation, the coinductive interpretation of standard big-step evaluation rules, is a concise form of semantics, with the same number of rules as in evaluation, which intends to simultaneously describe , finite and infinite computations. However, it is known that it is only able to express an infinite computations subset, and, to date, it remains unknown exactly what this subset is. More precisely, coevaluation behavior has several unusual features: there are terms whose for which evaluation is infinite but that do not coevaluate, it is not deterministic in the sense that there are terms which coevaluate to any value v, and there are terms whose for which evaluation is infinite but that coevaluate to only one value. In this work, we describe what the infinite computations subset which is able to be expressed by coevaluation is able to express is. More importantly, we introduce a coevaluation extension which that is well-behaved in the sense that the finite computations coevaluate exactly as in evaluation and the infinite computations coevaluate exactly as in divergence. In consequence Consequently, it does not present unusual features no unusual features are presented; in particular, this extension captures all infinite computations (not only a subset of them). In addition, as a consequence of thiswell-behavior,we present the expected equivalence between (extended) coevaluation and evaluation union divergence.

show abstract