9 search results - page 2 / 2 » The Myth of the Folk Theorem |
FORMATS
2005
Springer
13 years 10 months ago
2005
Springer
This paper attempts to improve our understanding of timed languages and their relation to timed automata. We start by giving a constructive proof of the folk theorem stating that t...
USS
2004
13 years 6 months ago
2004
It is well known that it is insecure to use the access(2) system call in a setuid program to test for the ability of the program's executor to access a file before opening sa...
PPOPP
2003
ACM
13 years 10 months ago
2003
ACM
We present a new method for dynamically detecting potential data races in multithreaded programs. Our method improves on the state of the art in accuracy, in usability, and in ove...
JFP
2000
13 years 5 months ago
2000
Indeterminism is typical for concurrent computation. If several concurrent actors compete for the same resource then at most one of them may succeed, whereby the choice of the suc...