Sciweavers

126 search results - page 21 / 26
» Using model checking with symbolic execution to verify paral...
Sort
View
CONCUR
2006
Springer
14 years 9 days 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, ...
VMCAI
2009
Springer
14 years 3 months ago
Finding Concurrency-Related Bugs Using Random Isolation
This paper describes the methods used in Empire, a tool to detect concurrency-related bugs, namely atomic-set serializability violations in Java programs. The correctness criterion...
Nicholas Kidd, Thomas W. Reps, Julian Dolby, Manda...
ICAC
2005
IEEE
14 years 2 months ago
Myrrh: A Transaction-Based Model for Autonomic Recovery
As software comes under increasing scrutiny for its lack of safety and reliability, numerous static and partially dynamic tools (including model checking) have been proposed for v...
Guy Eddon, Steven P. Reiss
HPCC
2007
Springer
14 years 2 months ago
PARMI: A Publish/Subscribe Based Asynchronous RMI Framework for Cluster Computing
This paper presents a publish/subscribe based asynchronous remote method invocation framework (PARMI) aiming to improve performance and programming flexibility. PARMI enables high-...
Heejin Son, Xiaolin Li
IPPS
1998
IEEE
14 years 25 days ago
Processor Lower Bound Formulas for Array Computations and Parametric Diophantine Systems
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
Peter R. Cappello, Ömer Egecioglu