Game Semantics for Interface Middleweight Java

Murawski, Andrzej S.; Tzevelekos, Nikos

doi:10.1145/3428676

Cited by 2 publications

(1 citation statement)

References 39 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Environmental bisimulation [37,54,58,59] introduces stratification of bisimulations based on state and opponent knowledge, providing an effective proof technique due to being amenable to up-to techniques [6,37,52,54], while applying functions to closed arguments derived by the congruence of the bisimulation. Game semantics [3,29,51], provides fully abstract denotational semantics for a range of higher-order languages, and in particular languages with higher-order state [2,39,50]. Algorithmic interpretations thereof give rise to decision procedures for contextual equivalence for restricted language fragments [11,20,26,48].…”

Section: Implementation and Evaluationmentioning

confidence: 99%

Pushdown Normal-Form Bisimulation: A Nominal Context-Free Approach to Program Equivalence

Koutavas,

Lin,

Tzevelekos

2024

Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science

View full text Add to dashboard Cite

Section: Implementation and Evaluationmentioning

confidence: 99%

Pushdown Normal-Form Bisimulation: A Nominal Context-Free Approach to Program Equivalence

Koutavas,

Lin,

Tzevelekos

2024

Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science

View full text Add to dashboard Cite

Verified compilation of C programs with a nominal memory model

Wang

Zhang

Shao

et al. 2022

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

Memory models play an important role in verified compilation of imperative programming languages. A representative one is the block-based memory model of CompCert---the state-of-the-art verified C compiler. Despite its success, the abstraction over memory space provided by CompCert's memory model is still primitive and inflexible. In essence, it uses a fixed representation for identifying memory blocks in a global memory space and uses a globally shared state for distinguishing between used and unused blocks. Therefore, any reasoning about memory must work uniformly for the global memory; it is impossible to individually reason about different sub-regions of memory (i.e., the stack and global definitions). This not only incurs unnecessary complexity in compiler verification, but also poses significant difficulty for supporting verified compilation of open or concurrent programs which need to work with contextual memory, as manifested in many previous extensions of CompCert. To remove the above limitations, we propose an enhancement to the block-based memory model based on nominal techniques; we call it the nominal memory model. By adopting the key concepts of nominal techniques such as atomic names and supports to model the memory space, we are able to 1) generalize the representation of memory blocks to any types satisfying the properties of atomic names and 2) remove the global constraints for managing memory blocks, enabling flexible memory structures for open and concurrent programs. To demonstrate the effectiveness of the nominal memory model, we develop a series of extensions of CompCert based on it. These extensions show that the nominal memory model 1) supports a general framework for verified compilation of C programs, 2) enables intuitive reasoning of compiler transformations on partial memory; and 3) enables modular reasoning about programs working with contextual memory. We also demonstrate that these extensions require limited changes to the original CompCert, making the verification techniques based on the nominal memory model easy to adopt.

show abstract

Game Semantics for Interface Middleweight Java

Cited by 2 publications

References 39 publications

Pushdown Normal-Form Bisimulation: A Nominal Context-Free Approach to Program Equivalence

Pushdown Normal-Form Bisimulation: A Nominal Context-Free Approach to Program Equivalence

Verified compilation of C programs with a nominal memory model

Contact Info

Product

Resources

About