Sciweavers

184 search results - page 16 / 37
» Monitoring Atomicity in Concurrent Programs
Sort
View
172
Voted
FSTTCS
2004
Springer
16 years 24 days ago
Toward a Grainless Semantics for Shared-Variable Concurrency
Abstract. Conventional semantics for shared-variable concurrency suffers from the “grain of time” problem, i.e., the necessity of specifying a default level of atomicity. We pr...
John C. Reynolds
209
Voted
ICDCS
1997
IEEE
15 years 11 months ago
Concurrency Control and View Notification Algorithms for Collaborative Replicated Objects
—This paper describes algorithms for implementing a high-level programming model for synchronous distributed groupware applications. In this model, several application data objec...
Robert E. Strom, Guruduth Banavar, Kevan Miller, A...
192
Voted
ICFEM
2004
Springer
16 years 23 days ago
A General Model for Reachability Testing of Concurrent Programs
Reachability testing is a technique for testing concurrent programs. Reachability testing derives test sequences on-the-fly as the testing process progresses, and can be used to sy...
Richard H. Carver, Yu Lei
338
Voted
POPL
2007
ACM
16 years 7 months ago
A concurrent constraint handling rules implementation in Haskell with software transactional memory
Constraint Handling Rules (CHR) is a concurrent committedchoice constraint logic programming language to describe transformations (rewritings) among multi-sets of constraints (ato...
Edmund S. L. Lam, Martin Sulzmann
SIGSOFT
2007
ACM
16 years 8 months ago
Detection and resolution of atomicity violation in service composition
Atomicity is a desirable property that safeguards application consistency for service compositions. A service composition exhibiting this property could either complete or cancel ...
Chunyang Ye, S. C. Cheung, W. K. Chan, Chang Xu