Sciweavers

361 search results - page 63 / 73
» Analytic Methods for the Logic of Proofs
Sort
View
ICC
2007
IEEE
118views Communications» more  ICC 2007»
14 years 2 months ago
A Class of LDPC Erasure Distributions with Closed-Form Threshold Expression
— In this paper, a family of low-density parity-check (LDPC) degree distributions, whose decoding threshold on the binary erasure channel (BEC) admits a simple closed form, is pr...
Enrico Paolini, Marco Chiani
ICFP
2010
ACM
13 years 9 months ago
The impact of higher-order state and control effects on local relational reasoning
Reasoning about program equivalence is one of the oldest problems in semantics. In recent years, useful techniques have been developed, based on bisimulations and logical relation...
Derek Dreyer, Georg Neis, Lars Birkedal
LICS
2010
IEEE
13 years 6 months ago
Addition-Invariant FO and Regularity
We consider formulas which, in addition to the symbols in the vocabulary, may use two designated symbols ≺ and + that must be interpreted as a linear order and its associated ad...
Nicole Schweikardt, Luc Segoufin
JCST
2010
189views more  JCST 2010»
13 years 3 months ago
Formally Analyzing Expected Time Complexity of Algorithms Using Theorem Proving
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
Osman Hasan, Sofiène Tahar
ESOP
2004
Springer
14 years 1 months ago
Resources, Concurrency, and Local Reasoning (Abstract)
t) Peter W. O’Hearn Queen Mary, University of London In the 1960s Dijkstra suggested that, in order to limit the complexity of potential process interactions, concurrent programs...
Peter W. O'Hearn