Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: A Higher-Order Logic for Concurrent Termination-Preserving Refinement   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.

36
The categories of this paper are: cmp-lg
5
The categories of this paper are: gr-qc
32
The categories of this paper are: atom-ph
8
The categories of this paper are: hep-ex
19
The categories of this paper are: eess
16
The categories of this paper are: stat
2
The categories of this paper are: math
30
The categories of this paper are: q-alg
6
The categories of this paper are: astro-ph
9
The categories of this paper are: nlin
4
The categories of this paper are: cond-mat
20
The categories of this paper are: acc-phys
15
The categories of this paper are: nucl-ex
11
The categories of this paper are: hep-lat
28
The categories of this paper are: alg-geom
14
The categories of this paper are: math-ph