Compositionality proofs in higher-order languages are notoriously involved, and general
semantic frameworks guaranteeing compositionality are hard to come by. In particular, Turi …

Higher-order abstract GSOS is a recent extension of Turi and Plotkin's framework of
Mathematical Operational Semantics to higher-order languages. The fundamental well …

Compositionality proofs in higher-order languages are notoriously involved, and general
semantic frameworks guaranteeing compositionality are hard to come by. In particular, Turi …

Symbolic execution is a powerful technique for program analysis. However, the formal
semantics underlying symbolic execution is often developed on an ad-hoc basis and …

Symbolic execution is a powerful technique for program analysis. However, the formal
semantics underlying symbolic execution is often developed on an ad-hoc basis and …

Compositionality proofs in higher-order languages are notoriously involved, and general
semantic frameworks guaranteeing compositionality are hard to come by. In particular, Turi …

A key prerequisite for modular reasoning about process calculi and programming languages
is compositionality: A denotational semantics is compositional if the associated semantic …