592 search results - page 41 / 119 » Can Component Service-Based Systems Be Proved Correct |
APN
2009
Springer
14 years 2 months ago
2009
Springer
In previous works we defined ν-APNs, an extension of P/T nets with the capability of creating and managing pure names. We proved that, though reachability is undecidable, coverab...
KR
2000
Springer
13 years 11 months ago
2000
Springer
In contrast with classical reasoning, where a solution is either correct or incorrect, approximate reasoning tries to compute solutions which are close to the ideal solution, with...
CONCUR
2004
Springer
14 years 1 months ago
2004
Springer
We define a language whose type system, incorporating session types, allows complex protocols to be specified by types and verified by static typechecking. A session type, asso...
CSL
2004
Springer
13 years 11 months ago
2004
Springer
It is well known that in an o-minimal hybrid system the continuous and discrete components can be separated, and therefore the problem of finite bisimulation reduces to the same pr...
HPCA
2000
IEEE
14 years 2 hour ago
2000
IEEE
Abstract—Sharing patterns in shared-memory multiprocessors are the key to performance: uniprocessor latencytolerating techniques such as out-of-order execution and non-blocking c...