Sciweavers

1159 search results - page 193 / 232
» Adding Concurrency to a Programming Language
Sort
View
ICALP
1994
Springer
15 years 1 months ago
Liveness in Timed and Untimed Systems
When provingthe correctness of algorithmsin distributed systems, one generally considers safety conditions and liveness conditions. The Input Output I O automaton model and its ti...
Rainer Gawlick, Roberto Segala, Jørgen F. S...
ENTCS
2002
101views more  ENTCS 2002»
14 years 9 months ago
A categorical framework for typing CCS-style process communication
Category theory has proved a useful tool in the study of type systems for sequential programming languages. Various approaches have been proposed to use categorical models to exam...
Ralf Schweimeier
IFIP
2010
Springer
14 years 4 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...
IFIP
2010
Springer
14 years 4 months ago
Resource Adaptive Distributed Information Sharing
We have designed, implemented and evaluated a resource adaptive distributed information sharing system where automatic adjustments are made internally in our information sharing sy...
Hans Vatne Hansen, Vera Goebel, Thomas Plagemann, ...
ASPLOS
2011
ACM
14 years 1 months ago
Ensuring operating system kernel integrity with OSck
Kernel rootkits that modify operating system state to avoid detection are a dangerous threat to system security. This paper presents OSck, a system that discovers kernel rootkits ...
Owen S. Hofmann, Alan M. Dunn, Sangman Kim, Indraj...