Sciweavers

16 search results - page 2 / 4
» Model-Checking Parameterized Concurrent Programs Using Linea...
Sort
View
SOFTVIS
2010
ACM
13 years 5 months ago
TIE: an interactive visualization of thread interleavings
Multi-core processors have become increasingly prevalent, driving a software shift toward concurrent programs which best utilize these processors. Testing and debugging concurrent...
Gowritharan Maheswara, Jeremy S. Bradbury, Christo...
CONCUR
2011
Springer
12 years 4 months ago
Reasoning about Threads with Bounded Lock Chains
The problem of model checking threads interacting purely via the standard synchronization primitives is key for many concurrent program analyses, particularly dataflow analysis. U...
Vineet Kahlon
CAV
2008
Springer
130views Hardware» more  CAV 2008»
13 years 6 months ago
A Hybrid Type System for Lock-Freedom of Mobile Processes
We propose a type system for lock-freedom in the -calculus, which guarantees that certain communications will eventually succeed. Distinguishing features of our type system are: it...
Naoki Kobayashi, Davide Sangiorgi
CONCUR
2006
Springer
13 years 8 months ago
Proving Liveness by Backwards Reachability
Abstract. We present a new method for proving liveness and termination properties for fair concurrent programs, which does not rely on finding a ranking function or on computing th...
Parosh Aziz Abdulla, Bengt Jonsson, Ahmed Rezine, ...
ICSOC
2010
Springer
13 years 3 months ago
Service Discovery Using Communication Fingerprints
A request to a service registry must be answered with a service that fits in several regards, including semantic compatibility, non-functional compatibility, and interface compati...
Olivia Oanea, Jan Sürmeli, Karsten Wolf