1716 search results - page 247 / 344 » Proving Conditional Termination |
115
click to vote
COCO
2009
Springer
15 years 10 months ago
2009
Springer
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...
112
Voted
INFOCOM
2007
IEEE
15 years 10 months ago
2007
IEEE
We consider the problem of reliable broadcast in a wireless network in which nodes are prone to failure. In the failure mode considered in this paper, each node can fail independe...
181
click to vote
ESOP
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We instantiate an Isabelle/HOL framework for proof carrying code to Jinja bytecode, a downsized variant of Java bytecode featuring objects, inheritance, method calls and ...
162
click to vote
NMR
2004
Springer
15 years 9 months ago
2004
Springer
A logic is defined which in addition to propositional calculus contains several types of probabilistic operators which are applied only to propositional formulas. For every s ∈...
119
click to vote
SRDS
2003
IEEE
15 years 9 months ago
2003
IEEE
How will a virus propagate in a real network? Does an epidemic threshold exist for a finite powerlaw graph, or any finite graph? How long does it take to disinfect a network giv...