Results 11 to 20 of about 432,853 (282)
A Fully Abstract Symbolic Semantics for Psi-Calculi [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 We present a symbolic transition system and bisimulation equivalence for psi-calculi, and show that it is fully abstract with respect to bisimulation congruence in the non-symbolic semantics. A psi-calculus is an extension of the pi-calculus with nominal
Magnus Johansson +2 more
doaj +5 more sources
Full Abstraction Without Synchronization Primitives
Electronic Notes in Theoretical Computer Science, 2010 AbstractUsing game semantics, we prove a full abstraction result (with respect to the may-testing preorder) for Idealized Algol augmented with parallel composition (IA||). Although it is common knowledge that semaphores can be implemented using shared memory, we find that semaphores do not extend IA|| conservatively.
Andrzej S Murawski
exaly +2 more sources
On Timed Models and Full Abstraction
Electronic Notes in Theoretical Computer Science, 2006 AbstractIn this paper we study a denotational model for a discrete-time version of CSP. We give a compositional semantics for the language. The model records refusal information at the end of each time unit; we believe this model to be simpler than existing models.
Joel Ouaknine
exaly +4 more sources
Full abstraction for nominal general references [PDF]
Logical Methods in Computer Science, 2009 Game semantics has been used with considerable success in formulating fully abstract semantics for languages with higher-order procedures and a wide range of computational effects.
Nikos Tzevelekos
doaj +1 more source
Full abstraction for Reduced ML [PDF]
Annals of Pure and Applied Logic, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Murawski, Andrzej S., Tzevelekos, Nikos
openaire +1 more source
Models for CSP with availability information [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 We consider models of CSP based on recording what events are available as possible alternatives to the events that are actually performed. We present many different varieties of such models.
Gavin Lowe
doaj +1 more source
Actris 2.0: Asynchronous Session-Type Based Reasoning in Separation Logic [PDF]
Logical Methods in Computer Science, 2022 Message passing is a useful abstraction for implementing concurrent programs. For real-world systems, however, it is often combined with other programming and concurrency paradigms, such as higher-order functions, mutable state, shared-memory concurrency,
Jonas Kastberg Hinrichsen +2 more
doaj +1 more source
Full Abstraction for Linda [PDF]
, 2008 This paper investigates full abstraction of a trace semantics for two Linda-like languages. The first language provides primitives for adding and removing messages from a shared memory, local choice, parallel composition and recursion. The second one adds the possibility of checking for the absence of a message in the store.
DI GIUSTO, CINZIA, GABBRIELLI, MAURIZIO
openaire +2 more sources
A transcendental analysis of mathematics: The abstract nature of mathematical knowledge [PDF]
Кантовский сборник, 2015 Kant’s transcendental philosophy (transcendentalism) focuses on both the human method of cognition in general [CPR, B25] and certain types of cognition aimed at justifying their objective significance. This article aims to explicate Kant’s understanding (
Katrechko S. L.
doaj +1 more source
Full abstraction for fair testing in CCS [PDF]
, 2013 In previous work with Pous, we defined a semantics for CCS which may both be viewed as an innocent presheaf semantics and as a concurrent game semantics. It is here proved that a behavioural equivalence induced by this semantics on CCS processes is fully
B. Ahrens +10 more
core +5 more sources