544 search results - page 41 / 109 » Testing concurrent programs using value schedules |
RISE
2004
Springer
15 years 3 months ago
2004
Springer
In this paper, we develop a symbolic representation for timed concurrent constraint (tccp) programs, which can be used for defining a lightweight model–checking algorithm for re...
IPPS
2000
IEEE
15 years 2 months ago
2000
IEEE
The primary goal of the Multimedia Router (MMR) project is the design and implementation of a router optimized for multimedia applications. The router is targeted for use in clust...
AAAI
2006
14 years 11 months ago
2006
We study how to find plans that maximize the expected total utility for a given MDP, a planning objective that is important for decision making in high-stakes domains. The optimal...
ESEC
1995
Springer
15 years 1 months ago
1995
Springer
This paper presents the results of an exploratory experiment investigating the use of program metrics to predict reachability graph size, reachability graph generation time, and d...
PLDI
2012
ACM
13 years 6 days ago
2012
ACM
Modern architectures implement relaxed memory models which may reorder memory operations or execute them non-atomically. Special instructions called memory fences are provided, al...