13383 search results - page 157 / 2677 » Abstractions from proofs |
126
click to vote
JUCS
2007
15 years 6 months ago
2007
: In this paper we obtain new effective results on the Halpern iterations of nonexpansive mappings using methods from mathematical logic or, more specifically, proof-theoretic te...
218
click to vote
LPAR
2010
Springer
15 years 4 months ago
2010
Springer
Data trees and data words have been studied extensively in connection with XML reasoning. These are trees or words that, in addition to labels from a finite alphabet, carry labels ...
150
click to vote
FOCS
1995
IEEE
15 years 10 months ago
1995
IEEE
d Abstract) Noga Alon ∗ Jeff Edmonds † Michael Luby ‡ An (n, c, , r)-erasure code consists of an encoding algorithm and a decoding algorithm with the following properties. ...
137
click to vote
FSTTCS
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. Transactions are commonly described as being ACID: Allor-nothing, Consistent, Isolated and Durable. However, although these words convey a powerful intuition, the ACID pr...
143
click to vote
MEMOCODE
2005
IEEE
16 years 2 days ago
2005
IEEE
There are few published examples of the proof of correctness of a cache-coherence protocol expressed in an HDL. A designer generally shows the correctness of a protocol ny impleme...