Sciweavers

203 search results - page 7 / 41
» A Linear Metalanguage for Concurrency
Sort
View
LICS
1999
IEEE
15 years 4 months ago
Concurrent Games and Full Completeness
A new concurrent form of game semantics is introduced. This overcomes the problems which had arisen with previous, sequential forms of game semantics in modelling Linear Logic. It...
Samson Abramsky, Paul-André Melliès
104
Voted
WDAG
2004
Springer
88views Algorithms» more  WDAG 2004»
15 years 5 months ago
Nonblocking Concurrent Data Structures with Condition Synchronization
We apply the classic theory of linearizability to operations that must wait for some other thread to establish a precondition. We model such an operation as a request and a follow-...
William N. Scherer III, Michael L. Scott
125
Voted
ICFP
2012
ACM
13 years 2 months ago
Propositions as sessions
Continuing a line of work by Abramsky (1994), by Bellin and Scott (1994), and by Caires and Pfenning (2010), among others, this paper presents CP, a calculus in which propositions...
Philip Wadler
AGP
1999
IEEE
15 years 4 months ago
Freeness Analysis through Linear Refinement
Domains Decomposing Non-Redundant Sharing by Complementation . . . . . . . . . . . . . 69 Enea Zaffanella, Patricia M. Hill, Roberto Bagnara Freeness Analysis Through Linear Refine...
Patricia M. Hill, Fausto Spoto
ESOP
2008
Springer
15 years 1 months ago
Inferring Channel Buffer Bounds Via Linear Programming
We present a static analysis for inferring the maximum amount of buffer space used by a program consisting of concurrently running processes communicating via buffered channels. We...
Tachio Terauchi, Adam Megacz