Sciweavers

13383 search results - page 175 / 2677
» Abstractions from proofs
Sort
View
BIRTHDAY
2000
Springer
15 years 10 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»
15 years 6 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
15 years 6 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»
15 years 6 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
FMOODS
2007
15 years 8 months ago
Pict Correctness Revisited
The Pict programming language is an implementation of the π-calculus in which executions of π-calculus terms are specified via an abstract machine. An important property of any ...
Philippe Bidinger, Adriana B. Compagnoni