Sciweavers

73 search results - page 8 / 15
» Optimistic Concurrency Semantics for Transactions in Coordin...
Sort
View
ICFP
2008
ACM
14 years 7 months ago
Transactional events for ML
Transactional events (TE) are an approach to concurrent programming that enriches the first-class synchronous message-passing of Concurrent ML (CML) with a combinator that allows ...
Laura Effinger-Dean, Matthew Kehrt, Dan Grossman
PPOPP
2012
ACM
12 years 2 months ago
A speculation-friendly binary search tree
We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-specu...
Tyler Crain, Vincent Gramoli, Michel Raynal
ACMMSP
2006
ACM
250views Hardware» more  ACMMSP 2006»
14 years 1 months ago
What do high-level memory models mean for transactions?
Many people have proposed adding transactions, or atomic blocks, to type-safe high-level programming languages. However, researchers have not considered the semantics of transacti...
Dan Grossman, Jeremy Manson, William Pugh
FMCO
2007
Springer
118views Formal Methods» more  FMCO 2007»
14 years 1 months ago
Coordination: Reo, Nets, and Logic
This article considers the coordination language Reo, a Petri net variant called zero-safe nets, and intuitionistic temporal linear logic (ITLL). The first part examines the seman...
Dave Clarke
PPDP
1999
Springer
13 years 11 months ago
Distributed Programming in a Multi-Paradigm Declarative Language
Curry is a multi-paradigm declarative language covering functional, logic, and concurrent programming paradigms. Curry’s operational semantics is based on lazy reduction of expre...
Michael Hanus