Sciweavers

570 search results - page 33 / 114
» concurrency 2006
Sort
View
ENTCS
2006
173views more  ENTCS 2006»
14 years 9 months ago
Concurrent LSC Verification: On Decomposition Properties of Partially Ordered Symbolic Automata
Partially Ordered Symbolic Automata (POSAs) are used as the semantical foundation of visual formalisms like the scenario based language of Live Sequence Charts (LSCs). To check whe...
Tobe Toben, Bernd Westphal
STOC
2006
ACM
116views Algorithms» more  STOC 2006»
15 years 3 months ago
Information-theoretically secure protocols and security under composition
We investigate the question of whether security of protocols in the information-theoretic setting (where the adversary is computationally unbounded) implies the security of these ...
Eyal Kushilevitz, Yehuda Lindell, Tal Rabin
SENSYS
2006
ACM
15 years 3 months ago
Supporting concurrent applications in wireless sensor networks
It is vital to support concurrent applications sharing a wireless sensor network in order to reduce the deployment and administrative costs, thus increasing the usability and efï¬...
Yang Yu, Loren J. Rittle, Vartika Bhandari, Jason ...
CERA
2006
36views more  CERA 2006»
14 years 9 months ago
Federated Grid Computing with Interactive Service-oriented Programing
er.sagepub.com/cgi/content/abstract/14/1/55 The online version of this article can be found at: Published by: http://www.sagepublications.com can be found at:Concurrent Engineering...
Michael W. Sobolewski, Raymond M. Kolonay
ICFP
2006
ACM
15 years 9 months ago
Modelling deterministic concurrent I/O
The problem of expressing I/O and side effects in functional languages is a well-established one. This paper addresses this problem from a general semantic viewpoint by giving a u...
Malcolm Dowse, Andrew Butterfield