Sciweavers

2466 search results - page 331 / 494
» Concurrent Clustered Programming
Sort
View
KBSE
2009
IEEE
14 years 5 months ago
Cache-Based Model Checking of Networked Applications: From Linear to Branching Time
Abstract—Many applications are concurrent and communicate over a network. The non-determinism in the thread and communication schedules makes it desirable to model check such sys...
Cyrille Artho, Watcharin Leungwattanakit, Masami H...
IISWC
2009
IEEE
14 years 5 months ago
Phoenix rebirth: Scalable MapReduce on a large-scale shared-memory system
Abstract—Dynamic runtimes can simplify parallel programming by automatically managing concurrency and locality without further burdening the programmer. Nevertheless, implementin...
Richard M. Yoo, Anthony Romano, Christos Kozyrakis
RP
2009
Springer
124views Control Systems» more  RP 2009»
14 years 4 months ago
Forward Analysis of Dynamic Network of Pushdown Systems Is Easier without Order
Dynamic networks of Pushdown Systems (PDN in short) have been introduced to perform static analysis of concurrent programs that may spawn threads dynamically. In this model the se...
Denis Lugiez
ATAL
2007
Springer
14 years 4 months ago
Modular interpreted systems
We propose a new class of representations that can be used for modeling (and model checking) temporal, strategic and epistemic properties of agents and their teams. Our representa...
Wojciech Jamroga, Thomas Ågotnes
CC
2007
Springer
139views System Software» more  CC 2007»
14 years 4 months ago
Using Prefetching to Improve Reference-Counting Garbage Collectors
Reference counting is a classical garbage collection method. Recently, a series of papers have extended the basic method to drastically reduce its notorious overhead and extend the...
Harel Paz, Erez Petrank