Sciweavers

140 search results - page 8 / 28
» Verifying timing properties of concurrent algorithms
Sort
View
WECWIS
2003
IEEE
82views ECommerce» more  WECWIS 2003»
14 years 20 days ago
Property Propagation Rules for Prioritizing and Synchronizing Trading Activities
With the growing number of marketplaces and trading partners in the e–commerce environment, software tools designed to act on behalf of human traders are increasingly used to au...
Yain-Whar Si, David Edmond, Arthur H. M. ter Hofst...
POPL
2009
ACM
14 years 8 months ago
Proving that non-blocking algorithms don't block
A concurrent data-structure implementation is considered nonblocking if it meets one of three following liveness criteria: waitfreedom, lock-freedom, or obstruction-freedom. Devel...
Alexey Gotsman, Byron Cook, Matthew J. Parkinson, ...
CAV
2008
Springer
122views Hardware» more  CAV 2008»
13 years 9 months ago
Thread Quantification for Concurrent Shape Analysis
In this paper we address the problem of shape analysis for concurrent programs. We present new algorithms, based on abstract interpretation, for automatically verifying properties ...
Josh Berdine, Tal Lev-Ami, Roman Manevich, G. Rama...
PPDP
2005
Springer
14 years 27 days ago
Isolation-only transactions by typing and versioning
In this paper we design a language and runtime support for isolation-only, multithreaded transactions (called tasks). Tasks allow isolation to be declared instead of having to be ...
Pawel T. Wojciechowski
DEDS
2007
104views more  DEDS 2007»
13 years 7 months ago
Trellis Processes : A Compact Representation for Runs of Concurrent Systems
The unfolding of a concurrent system represents in a compact manner all possible runs of this system. Unfoldings are used in many applications, ranging from model-checking (offlin...
Eric Fabre