826 search results - page 67 / 166 » Resolving Concurrent Interactions |
140
Voted
PLDI
2012
ACM
13 years 5 months 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...
108
Voted
CADE
2008
Springer
16 years 3 months ago
2008
Springer
Rely-guarantee (RG) reasoning is useful for modular Hoare-style proofs of concurrent programs. However, RG requires that assertions be proved stable under the actions of the enviro...
137
click to vote
PPDP
2009
Springer
15 years 10 months ago
2009
Springer
The construction of reliable concurrent and distributed systems is an extremely difficult endeavour. For complex systems, it requires modular development strategies based on prec...
125
Voted
SIGDIAL
2011
14 years 6 months ago
2011
We present a new approach to dialogue management based on the use of multiple, interconnected policies. Instead of capturing the complexity of the interaction in a single large po...
139
Voted
DSVIS
2000
Springer
15 years 7 months ago
2000
Springer
This paper presents an example of how software architectures can encode temporal properties as well as the traditional structural ones. In the context of expressing concurrency con...