Pi-calculus, dialogue games and full abstraction PCF
FPCA '95 Proceedings of the seventh international conference on Functional programming languages and computer architecture
Game semantics and abstract machines
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
A Fully Abstract Game Semantics for General References
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Towards a Theory of Bisimulation for Local Names
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
An Observationally Complete Program Logic for Imperative Higher-Order Frame Rules
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Small bisimulations for reasoning about higher-order imperative programs
Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Fully abstract semantics of additive aspects by translation
Proceedings of the 6th international conference on Aspect-oriented software development
Sequentiality and the π-calculus
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
Java JR: fully abstract trace semantics for a core java language
ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
Global State Considered Helpful
Electronic Notes in Theoretical Computer Science (ENTCS)
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
A complete, co-inductive syntactic theory of sequential control and state
Semantics and algebraic specification
Realisability semantics of parametric polymorphism, general references and recursive types
Mathematical Structures in Computer Science
The impact of higher-order state and control effects on local relational reasoning
Proceedings of the 15th ACM SIGPLAN international conference on Functional programming
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
From Applicative to Environmental Bisimulation
Electronic Notes in Theoretical Computer Science (ENTCS)
The marriage of bisimulations and Kripke logical relations
POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Electronic Notes in Theoretical Computer Science (ENTCS)
Typed normal form bisimulation
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
| Hi-index | 0.00 |
We describe a fully abstract trace semantics for a functional language with locally declared general references (a fragment of Standard ML). It is based on a bipartite LTS in which states alternate between program and environment configurations and labels carry only (sets of) basic values, location and pointer names. Interaction between programs and environments is either direct (initiating or terminating subprocedures) or indirect (by the overwriting of shared locations): actions reflect this by carrying updates to the shared part of the store. The trace-sets of programs and contexts may be viewed as deterministic strategies and counter-strategies in the sense of game semantics: we prove soundness of the semantics by showing that the evaluation of a program in an environment tracks the interaction between the corresponding strategies. We establish full abstraction by proving a definability result: every bounded deterministic strategy of a given type is the trace-set of a configuration of that type.