Sciweavers

10715 search results - page 127 / 2143
» From Tests to Proofs
Sort
View
BIRTHDAY
2000
Springer
14 years 1 months ago
Enhancing the tractability of rely/guarantee specifications in the development of interfering operations
Various forms of assumption/commitment specifications have been used to specify and reason about the interference that comes from concurrent execution; in particular, consistent a...
Pierre Collette, Cliff B. Jones
BSL
2008
97views more  BSL 2008»
13 years 9 months ago
The Complexity of Orbits of Computably Enumerable Sets
The goal of this paper is to announce there is a single orbit of the c.e. sets with inclusion, E, such that the question of membership in this orbit is 1 1-complete. This result an...
Peter Cholak, Rodney G. Downey, Leo Harrington
EJC
2007
13 years 9 months ago
On the number of Tverberg partitions in the prime power case
We give an extension of the lower bound of [9] for the number of Tverberg partitions from the prime to the prime power case. Our proof is inspired by the Zp-index version of the p...
Stephan Hell
ORL
2008
115views more  ORL 2008»
13 years 9 months ago
On the convergence of stochastic dual dynamic programming and related methods
We discuss the almost-sure convergence of a broad class of sampling algorithms for multi-stage stochastic linear programs. We provide a convergence proof based on the finiteness o...
Andrew B. Philpott, Z. Guan
CADE
2010
Springer
13 years 7 months ago
Terminating Tableaux for Hybrid Logic with Eventualities
x-free and employs a novel clausal form that abstracts away from propositional reasoning. It comes with an elegant correctness proof. We discuss some optimizations for decision pro...
Mark Kaminski, Gert Smolka