Sciweavers

1322 search results - page 125 / 265
» Unsound Theorem Proving
Sort
View
CORR
2006
Springer
79views Education» more  CORR 2006»
13 years 10 months ago
Source coding and channel requirements for unstable processes
Our understanding of information in systems has been based on the foundation of memoryless processes. Extensions to stable Markov and auto-regressive processes are classical. Berg...
Anant Sahai, Sanjoy K. Mitter
JUCS
2008
166views more  JUCS 2008»
13 years 10 months ago
ASM Refinement Preserving Invariants
: This paper gives a definition of ASM refinement suitable for the verification that a protocol implements atomic transactions. We used this definition as the basis of the formal v...
Gerhard Schellhorn
ENDM
2007
106views more  ENDM 2007»
13 years 10 months ago
Removing Even Crossings on Surfaces
In this paper we investigate how certain results related to the HananiTutte theorem can be extended from the plane to surfaces. We give a simple topological proof that the weak Ha...
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stef...
CSFW
2012
IEEE
12 years 17 days ago
Generic Indifferentiability Proofs of Hash Designs
—In this paper, we propose a formal analysis of domain extenders for hash functions in the indifferentiability framework. We define a general model for domain extenders and prov...
Marion Daubignard, Pierre-Alain Fouque, Yassine La...
ICDCS
2005
IEEE
14 years 3 months ago
The Impossibility of Boosting Distributed Service Resilience
We prove two theorems saying that no distributed system in which processes coordinate using reliable registers and -resilient services can solve the consensus problem in the prese...
Paul C. Attie, Rachid Guerraoui, Petr Kouznetsov, ...