Sciweavers

2300 search results - page 307 / 460
» Maximally Concurrent Programs
Sort
View
130
Voted
MSCS
1998
58views more  MSCS 1998»
15 years 6 months ago
Minimal Realization in Bicategories of Automata
The context of this article is the program to develop monoidal bicategories with a feedback operation as an algebra of processes, with applications to concurrency theory. The obje...
Robert D. Rosebrugh, Nicoletta Sabadini, Robert F....
TCS
1998
15 years 6 months ago
Algebraic Translations, Correctness and Algebraic Compiler Construction
Algebraic translation methods are argued for in many fields of science. Several examples will be considered: from the field of compiler construction, database updates, concurren...
Theo M. V. Janssen
FGCS
2010
129views more  FGCS 2010»
15 years 4 months ago
Bulk synchronous parallel ML with exceptions
Bulk Synchronous Parallel ML is a high-level language for programming parallel algorithms. Built upon OCaml and using the BSP model, it provides a safe setting for their implementa...
Louis Gesbert, Frédéric Gava, Fr&eac...
RV
2010
Springer
171views Hardware» more  RV 2010»
15 years 4 months ago
Runtime Verification for Software Transactional Memories
Software transactional memories (STMs) promise simple and efficient concurrent programming. Several correctness properties have been proposed for STMs. Based on a bounded conflict ...
Vasu Singh
POPL
2006
ACM
16 years 6 months ago
Autolocker: synchronization inference for atomic sections
The movement to multi-core processors increases the need for simpler, more robust parallel programming models. Atomic sections have been widely recognized for their ease of use. T...
Bill McCloskey, Feng Zhou, David Gay, Eric A. Brew...