932 search results - page 91 / 187 » Verifying Progress in Timed Systems |
158
click to vote
COCO
2010
Springer
15 years 7 months ago
2010
Springer
A PCP is a proof system for NP in which the proof can be checked by a probabilistic verifier. The verifier is only allowed to read a very small portion of the proof, and in return ...
171
Voted
PODC
2006
ACM
15 years 10 months ago
2006
ACM
Byzantine agreement algorithms typically assume implicit initial state consistency and synchronization among the correct nodes and then operate in coordinated rounds of informatio...
135
click to vote
IJFCS
2006
15 years 4 months ago
2006
For successful software verification, model checkers must be capable of handling a large number of program variables. Traditional, BDD-based model checking is deficient in this re...
105
click to vote
ICALP
2000
Springer
15 years 7 months ago
2000
Springer
This paper demonstrates how three stochastic process algebras can be mapped on to a generally-distributed stochastic transition system. We demonstrate an aggregation technique on ...
170
click to vote
EMSOFT
2004
Springer
15 years 9 months ago
2004
Springer
In current embedded systems, one of the major concerns is energy conservation. The dynamic voltage-scheduling (DVS) framework, which involves dynamically adjusting the voltage and...