49 search results - page 9 / 10 » Analysis of the Suzuki-Kasami Algorithm with SAL Model Check... |
FMCAD
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. We consider the problem of refinement checking for asynchronous processes where refinement corresponds to stutter-closed language inclusion. Since an efficient algorithmi...
102
click to vote
IPPS
2007
IEEE
15 years 3 months ago
2007
IEEE
High-end computing is universally recognized to be a strategic tool for leadership in science and technology. A significant portion of high-end computing is conducted on clusters...
QEST
2006
IEEE
15 years 3 months ago
2006
IEEE
The time-bounded reachability problem for continuoustime Markov chains (CTMCs) amounts to determine the probability to reach a (set of) goal state(s) within a given time span, suc...
SIGSOFT
2008
ACM
15 years 10 months ago
2008
ACM
Many testing and analysis techniques have been developed for inhouse use. Although they are effective at discovering defects before a program is deployed, these techniques are oft...
104
click to vote
ISTCS
1992
Springer
15 years 27 days ago
1992
Springer
Concurrent Time-stamp Systems (ctss) allow processes to temporally order concurrent events in an asynchronous shared memorysystem, a powerful tool for concurrency control, serving...