A Game Semantics of Idealized CSP

DOI10.1016/S1571-0661(04)80965-4MaRDI QIDQ4917059zbMATH OpenOpenAlexFDO

Authors

Publication date 26 April 2013

Published in Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s1571-0661(04)80965-4

Mathematics Subject Classification ID

Theory of programming languages (68N15) Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55)

Recommendations

• From CSP to game semantics
• Game semantics and linear CPS interpretation
• The complexity of constraint satisfaction games and QCSP
• Game semantics approach to higher-order complexity
• A game semantics for system P
• A game semantics for proof search (preliminary results)
• A CSP-Based Approach for Solving Parity Game
• scientific article; zbMATH DE number 2110612
• Coalition games over Kripke semantics: expressiveness and complexity
• The complexity of rational synthesis for concurrent games

Cites work

• A mathematical semantics for a nondeterministic typed lambda-calculus
• Communicating sequential processes
• Game theoretic analysis of call-by-value computation
• Games and full completeness for multiplicative linear logic
• scientific article; zbMATH DE number 1223609 (Why is no real title available?)
• scientific article; zbMATH DE number 1231510 (Why is no real title available?)
• scientific article; zbMATH DE number 1231564 (Why is no real title available?)
• scientific article; zbMATH DE number 1259144 (Why is no real title available?)
• scientific article; zbMATH DE number 1499102 (Why is no real title available?)
• On full abstraction for PCF: I, II and III

Cited in

(33)

• Full abstraction for idealized Algol with passive expressions
• Game semantics and linear CPS interpretation
• Games and full abstraction for FPC.
• Higher-order linearisability
• Angelic semantics of fine-grained concurrency
• A game semantics of names and pointers
• Asynchronous games. II: The true concurrency of innocence
• A categorical semantics of higher order store
• Handshake games
• Full abstraction for fair testing in CCS (expanded version)
• A truly concurrent game model of the asynchronous -calculus
• Synchronous game semantics via round abstraction
• From CSP to game semantics
• Full abstraction without synchronization primitives
• Bad Variables Under Control
• scientific article; zbMATH DE number 1231510 (Why is no real title available?)
• scientific article; zbMATH DE number 1231564 (Why is no real title available?)
• scientific article; zbMATH DE number 1956521 (Why is no real title available?)
• Causality vs. interleavings in concurrent game semantics
• Transition systems over games
• Higher-order linearisability
• Abstract machines for game semantics, revisited
• Slot games: a quantitative model of computation
• Foundations of Software Science and Computation Structures
• Foundations of Software Science and Computation Structures
• Game Semantics for Higher-Order Concurrency
• Probabilistic game semantics
• CONCUR 2005 – Concurrency Theory
• The far side of the cube. An elementary introduction to game semantics
• A tale of additives and concurrency in game semantics
• Disentangling parallelism and interference in game semantics
• Saturating automata for game semantics
• A compositional theory of linearizability

This page was built for publication: A Game Semantics of Idealized CSP

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4917059)