3825 search results - page 175 / 765 » The Language of Time: A Reader |
181
click to vote
OSDI
1996
ACM
15 years 7 months ago
1996
ACM
This paper describes a mechanism by which an operating system kernel can determine with certainty that it is safe to execute a binary supplied by an untrusted source. The kernel r...
149
click to vote
ICALP
2010
Springer
15 years 8 months ago
2010
Springer
In the first part of the paper, we propose an algorithm which inputs an NFA A and a word a1
134
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
We prove that TAUT has a p-optimal proof system if and only if a logic related to least fixed-point logic captures polynomial time on all finite structures. Furthermore, we show ...
165
click to vote
SFM
2004
Springer
15 years 11 months ago
2004
Springer
This paper surveys the language Modest, a Modelling and Description language for Stochastic and Timed systems, and its accompanying tool-environment MOTOR. The language and tool ar...
203
click to vote
ICALP
2011
Springer
14 years 10 months ago
2011
Springer
Markov automata describe systems in terms of events which may be nondeterministic, may occur probabilistically, or may be subject to time delays. We define a novel notion of weak ...