Sciweavers

58 search results - page 11 / 12
» Counterexamples to witness conjectures
Sort
View
ATVA
2008
Springer
143views Hardware» more  ATVA 2008»
13 years 9 months ago
Automating Algebraic Specifications of Non-freely Generated Data Types
Abstract. Non-freely generated data types are widely used in case studies carried out in the theorem prover KIV. The most common examples are stores, sets and arrays. We present an...
Andriy Dunets, Gerhard Schellhorn, Wolfgang Reif
TIT
2008
94views more  TIT 2008»
13 years 7 months ago
Why Do Block Length and Delay Behave Differently if Feedback Is Present?
Abstract--For output-symmetric discrete memoryless channels (DMCs) at even moderately high rates, fixed-block-length communication systems show no improvements in their error expon...
Anant Sahai
TOMS
2010
106views more  TOMS 2010»
13 years 5 months ago
Computing Tutte Polynomials
The Tutte polynomial of a graph, also known as the partition function of the q-state Potts model, is a 2-variable polynomial graph invariant of considerable importance in both comb...
Gary Haggard, David J. Pearce, Gordon Royle
FMCAD
2008
Springer
13 years 9 months ago
Automatic Non-Interference Lemmas for Parameterized Model Checking
Parameterized model checking refers to any method that extends traditional, finite-state model checking to handle systems arbitrary number of processes. One popular approach to thi...
Jesse D. Bingham
APAL
2010
98views more  APAL 2010»
13 years 7 months ago
Classical proof forestry
Classical proof forests are a proof formalism for first-order classical logic based on Herbrand's Theorem and backtracking games in the style of Coquand. First described by M...
Willem Heijltjes