535 search results - page 17 / 107 » Checking Computations in Polylogarithmic Time |
IPPS
1998
IEEE
13 years 12 months ago
1998
IEEE
We propose a periodic diagnostic algorithm based on the testing model of computation for real-time systems. The diagnostic task runs on every processor of the system. When the task...
EUC
2008
Springer
13 years 9 months ago
2008
Springer
Static path analysis is a key process of Worst Case Execution Time (WCET) estimation, the objective of which is to find the execution path that has the largest execution time. Cur...
BIRTHDAY
2010
Springer
14 years 15 days ago
2010
Springer
Egon Börger Ambient Abstract State Machines with Applications 11:00 AM Manfred Broy Realizability of System Interface Specifications 11:30 AM Ofer Strichman Proving Equivalence be...
CSR
2008
Springer
13 years 9 months ago
2008
Springer
The universal cover TG of a connected graph G is the unique (possible infinite) tree covering G, i.e., that allows a locally bijective homomorphism from TG to G. Universal covers h...
ASM
2008
ASM
13 years 9 months ago
2008
ASM
Abstract. In this paper we examine the difference between model checking high-level and low-level models. In particular, we compare the ProB model checker for the B-method and the ...