Sciweavers

5180 search results - page 59 / 1036
» Concurrency, Time, and Constraints
Sort
View
ICFP
2004
ACM
15 years 11 months ago
Searching for deadlocks while debugging concurrent haskell programs
This paper presents an approach to searching for deadlocks in Concurrent Haskell programs. The search is based on a redefinition of the IO monad which allows the reversal of Concu...
Jan Christiansen, Frank Huch
LCTRTS
2004
Springer
15 years 5 months ago
Generating fast code from concurrent program dependence graphs
While concurrency in embedded systems is most often supplied by real-time operating systems, this approach can be unpredictable and difficult to debug. Synchronous concurrency, i...
Jia Zeng, Cristian Soviani, Stephen A. Edwards
FOCS
2005
IEEE
15 years 5 months ago
Linear Lower Bounds on Real-World Implementations of Concurrent Objects
This paper proves   ¡ £ ¥ lower bounds on the time to perform a single instance of an operation in any implementation of a large class of data structures shared by £ processe...
Faith Ellen Fich, Danny Hendler, Nir Shavit
COLCOM
2007
IEEE
15 years 1 months ago
Maintaining constraints expressed as formulas in collaborative systems
—Constraints allow users to declare relationships among objects and let the constraint systems maintain and satisfy these relationships. Formulas have been adopted to express con...
Kai Lin, David Chen, R. Geoff Dromey, Chengzheng S...
ICLP
2005
Springer
15 years 5 months ago
Modeling Systems in CLP
We present a methodology for the modeling of complex program behavior in CLP. In the first part we present an informal description about how to represent a system in CLP. At its ...
Joxan Jaffar, Andrew E. Santosa, Razvan Voicu