Sciweavers

2300 search results - page 29 / 460
» Maximally Concurrent Programs
Sort
View
CONCUR
2010
Springer
13 years 8 months ago
Reasoning about Optimistic Concurrency Using a Program Logic for History
Optimistic concurrency algorithms provide good performance for parallel programs but they are extremely hard to reason about. Program logics such as concurrent separation logic and...
Ming Fu, Yong Li, Xinyu Feng, Zhong Shao, Yu Zhang
JUCS
2008
166views more  JUCS 2008»
13 years 7 months ago
Exploring Lua for Concurrent Programming
The popularization of multi-core processors and of technologies such as hyper-threading demonstrates a fundamental change in the way processors have been evolving and also increase...
Alexandre Skyrme, Noemi de La Rocque Rodriguez, Ro...
SIGSOFT
2000
ACM
13 years 12 months ago
The universe model: an approach for improving the modularity and reliability of concurrent programs
We present the universe model,a new approach to concurrencymanagement that isolates concurrency concerns and represents them in the modular interface of a component. This approach...
Reimer Behrends, Kurt Stirewalt
ENTCS
2008
101views more  ENTCS 2008»
13 years 7 months ago
On the Approximation of Stochastic Concurrent Constraint Programming by Master Equation
We explore the relation between the stochastic semantic associated to stochastic Concurrent Constrain Programming (sCCP) and its fluid-flow approximation. Writing the master equat...
Luca Bortolussi
TACAS
2009
Springer
135views Algorithms» more  TACAS 2009»
14 years 2 months ago
Context-Bounded Analysis for Concurrent Programs with Dynamic Creation of Threads
Context-bounded analysis has been shown to be both efficient and effective at finding bugs in concurrent programs. According to its original definition, context-bounded analysis...
Mohamed Faouzi Atig, Ahmed Bouajjani, Shaz Qadeer