5015 search results - page 512 / 1003 » Model Checking a Path |
178
click to vote
OSDI
2004
ACM
16 years 7 months ago
2004
ACM
We present a new technique, failure-oblivious computing, that enables servers to execute through memory errors without memory corruption. Our safe compiler for C inserts checks th...
184
click to vote
ATVA
2007
Springer
16 years 1 months ago
2007
Springer
Multi-valued Kripke structures are Kripke structures in which the atomic propositions and the transitions are not Boolean and can take values from some set. In particular, latticed...
178
click to vote
SIGECOM
2005
ACM
16 years 13 days ago
2005
ACM
We study various computational aspects of solving games using dominance and iterated dominance. We first study both strict and weak dominance (not iterated), and show that checki...
207
click to vote
ECOOP
2004
Springer
16 years 8 days ago
2004
Springer
Abstract. Software systems obey the 80/20 rule: aggressively optimizing a vital few execution paths yields large speedups. However, finding the vital few paths can be difficult, e...
208
click to vote
USS
2004
15 years 8 months ago
2004
We present Tor, a circuit-based low-latency anonymous communication service. This second-generation Onion Routing system addresses limitations in the original design by adding per...