227 search results - page 29 / 46 » Tutorial: Parallel Model Checking |
131
click to vote
PODS
1994
ACM
15 years 3 months ago
1994
ACM
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
COORDINATION
2010
Springer
14 years 12 months ago
2010
Springer
In the context of service-oriented computing, behavioural contracts are descriptions of the message-passing behaviour of services. They can be used to check properties of service c...
110
click to vote
CAV
2010
Springer
15 years 3 months ago
2010
Springer
ions of ODE models (MAPLE, GNA). On the algorithmic side (Sec. 3.2), it supports two main streams in high-performance model checking: reachability analysis based on BDDs (symbolic)...
151
click to vote
CSCLP
2008
Springer
15 years 1 months ago
2008
Springer
In the analysis of hybrid discrete-continuous systems, rich arithmetic constraint formulae with complex Boolean structure arise naturally. The iSAT algorithm, a solver for such for...
103
click to vote
ICECCS
2010
IEEE
14 years 12 months ago
2010
IEEE
Abstract—Transactional Memory (TM) is a promising technique that addresses the difficulty of parallel programming. Since TM takes responsibility for all concurrency control, TM ...