3228 search results - page 237 / 646 » Computationally Sound Proofs |
154
Voted
FOSSACS
2004
Springer
16 years 17 hour ago
2004
Springer
We show that in perfect-information stochastic parity games with a finite state space both players have optimal pure positional strategies. Contrary to the recent proofs of this f...
158
click to vote
FOSSACS
2004
Springer
15 years 10 months ago
2004
Springer
In this paper we present a theorem for defining fixed-points in categories of sheaves. This result gives a unifying and general account of most techniques used in computer science ...
154
click to vote
DLOG
2007
15 years 9 months ago
2007
One of the main concerns of constructive semantics is to provide a computational interpretation for the proofs of a given logic. In this paper we introduce a constructive semantics...
195
click to vote
CADE
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. In the context of deductive program verification, supporting floatingpoint computations is tricky. We propose an expressive language to formally specify behavioral proper...
114
Voted
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We give a new, and hopefully more easily understandable, structural proof of the decomposition of a k-valued transducer into k unambiguous functional ones, a result established by...