Sciweavers

1173 search results - page 110 / 235
» On the Compositionality of Round Abstraction
Sort
View
PPOPP
2005
ACM
15 years 6 months ago
Composable memory transactions
Writing concurrent programs is notoriously difficult, and is of increasing practical importance. A particular source of concern is n correctly-implemented concurrency abstraction...
Tim Harris, Simon Marlow, Simon L. Peyton Jones, M...
77
Voted
CP
2005
Springer
15 years 6 months ago
Parallel Local Search in Comet
Abstract. The availability of commodity multiprocessors offers significant opportunities for addressing the increasing computational requirements of optimization applications. To...
Laurent Michel, Pascal Van Hentenryck
93
Voted
TGC
2005
Springer
15 years 6 months ago
A Practical Formal Model for Safety Analysis in Capability-Based Systems
Abstract. We present a formal system that models programmable abstractions for access control. Composite abstractions and patterns of arbitrary complexity are modeled as a configu...
Fred Spiessens, Peter Van Roy
FLAIRS
2000
15 years 2 months ago
Verification of Cooperating Systems - An Approach Based on Formal Languages
Behaviour of systems is described by formal languages: the sets of all sequences of actions. Regarding ion, alphabetic language homomorphisms are compute abstract behaviours. To a...
Peter Ochsenschläger, Jürgen Repp, Rolan...
IPL
2006
141views more  IPL 2006»
15 years 21 days ago
Perfectly Reliable Message Transmission
We study the problem of Perfectly Reliable Message Transmission (PRMT) and Perfectly Secure Message Transmission (PSMT) between two nodes S and R in an undirected synchronous netw...
Arvind Narayanan, K. Srinathan, C. Pandu Rangan