A Higher-Order Logic for Concurrent Termination-Preserving Refinement

Tassarotti, Joseph; Jung, Ralf; Harper, Robert

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Paper

A Higher-Order Logic for Concurrent Termination-Preserving Refinement

MPS-Authors

/persons/resource/persons144769

Jung, Ralf
Group D. Dreyer, Max Planck Institute for Software Systems, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

arXiv:1701.05888.pdf
(Preprint), 732KB

Supplementary Material (public)

There is no public supplementary material available

Citation

Tassarotti, J., Jung, R., & Harper, R. (2017). A Higher-Order Logic for Concurrent Termination-Preserving Refinement. Retrieved from http://arxiv.org/abs/1701.05888.

Cite as: https://hdl.handle.net/21.11116/0000-0000-7622-5

Abstract

Compiler correctness proofs for higher-order concurrent languages are difficult: they involve establishing a termination-preserving refinement between a concurrent high-level source language and an implementation that uses low-level shared memory primitives. However, existing logics for proving concurrent refinement either neglect properties such as termination, or only handle first-order state. In this paper, we address these limitations by extending Iris, a recent higher-order concurrent separation logic, with support for reasoning about termination-preserving refinements. To demonstrate the power of these extensions, we prove the correctness of an efficient implementation of a higher-order, session-typed language. To our knowledge, this is the first program logic capable of giving a compiler correctness proof for such a language. The soundness of our extensions and our compiler correctness proof have been mechanized in Coq.