Sciweavers

906 search results - page 66 / 182
» Linking Theories of Concurrency
Sort
View
BIRTHDAY
2005
Springer
15 years 11 months ago
Timing the Untimed: Terminating Successfully While Being Conservative
Abstract. There have been several timed extensions of ACP-style process algebras with successful termination. None of them, to our knowledge, are equationally conservative (ground-...
Jos C. M. Baeten, Mohammad Reza Mousavi, Michel A....
SIGSOFT
1996
ACM
15 years 10 months ago
Abstracting Dependencies between Software Configuration Items
ing Dependencies between Software Configuration Items CARL A. GUNTER University of Pennsylvania icle studies an abstract model of dependencies between software configuration items ...
Carl A. Gunter
IFIP
2010
Springer
15 years 1 months ago
Reasoning about Probabilistic Security Using Task-PIOAs
Abstract. Task-structured probabilistic input/output automata (taskPIOAs) are concurrent probabilistic automata that, among other things, have been used to provide a formal framewo...
Aaron D. Jaggard, Catherine Meadows, Michael Mislo...
ICIP
2003
IEEE
16 years 7 months ago
On the scalability of an image transcoding proxy server
Image transcoding proxies are used to improve Web browsing over low bandwidth networks by adapting content-rich web images to bandwidth-constrained clients. Such transcoding proxi...
Anubhav Savant, Nasir D. Memon, Torsten Suel
PODC
1990
ACM
15 years 10 months ago
Sharing Memory Robustly in Message-Passing Systems
Emulators that translate algorithms from the shared-memory model to two different message-passing models are presented. Both are achieved by implementing a wait-free, atomic, singl...
Hagit Attiya, Amotz Bar-Noy, Danny Dolev