238 search results - page 28 / 48 » Compositional Proof Methods for Concurrency: A Semantic Appr... |
ICTAC
2004
Springer
15 years 3 months ago
2004
Springer
Among the possible approaches for expressing real-time problems with the B method, two are dominant : the use of the usual B mechanisms to define temporal constraints on the one h...
ICPP
2003
IEEE
15 years 2 months ago
2003
IEEE
For concurrent I/O operations, atomicity defines the results in the overlapping file regions simultaneously read/written by requesting processes. Atomicity has been well studied...
102
click to vote
CORR
2011
Springer
14 years 4 months ago
2011
Springer
Grishin ([10]) proposed enriching the Lambek calculus with multiplicative disjunction (par) and coresiduals. Applications to linguistics were discussed by Moortgat ([15]), who spok...
BIRTHDAY
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. A long-running transaction is an interactive component of a distributed system which must be executed as if it were a single atomic action. In principle, it should not be...
FUIN
2008
14 years 9 months ago
2008
Abstract. Many formalisms use interleaving to model concurrency. To describe some system behaviours appropriately, we need to limit interleaving. For example, in a component-based ...