A Fully Abstract Trace Semantics for General References
From MaRDI portal
Recommendations
Cited in
(23)- A curry-style semantics of interaction: from untyped to second-order lazy -calculus
- Complete trace models of state and control
- Higher-order linearisability
- Operational nominal game semantics
- A system-level game semantics
- A Complete, Co-inductive Syntactic Theory of Sequential Control and State
- Trace Semantics for IPDL
- Realisability semantics of parametric polymorphism, general references and recursive types
- A Complete Characterization of Observational Equivalence in Polymorphic λ-Calculus with General References
- scientific article; zbMATH DE number 1949638 (Why is no real title available?)
- Trace semantics for polymorphic references
- Deconstructing general references via game semantics
- Higher-order linearisability
- Global state considered helpful
- Full Abstraction for Linda
- From applicative to environmental bisimulation
- Deciding contextual equivalence of \(\nu \)-calculus with effectful contexts
- From bounded checking to verification of equivalence via symbolic up-to techniques
- Symbolic execution game semantics
- Fully abstract normal form bisimulation for call-by-value PCF
- Pushdown normal-form bisimulation: a nominal context-free approach to program equivalence
- First-order store and visibility in name-passing calculi
- Nanopass back-translation of call-return trees for mechanized secure compilation proofs
This page was built for publication: A Fully Abstract Trace Semantics for General References
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5428848)
