Sciweavers

788 search results - page 136 / 158
» Symbolic Equivalence Checking
Sort
View
127
Voted
STOC
2001
ACM
163views Algorithms» more  STOC 2001»
16 years 3 months ago
Extractor codes
We study error-correcting codes for highly noisy channels. For example, every received signal in the channel may originate from some half of the symbols in the alphabet. Our main c...
Amnon Ta-Shma, David Zuckerman
TCS
2010
15 years 1 months ago
Itineraries of rigid rotations and diffeomorphisms of the circle
We examine the itinerary of 0 ∈ S1 = R/Z under the rotation by α ∈ R\Q. The motivating question is: if we are given only the itinerary of 0 relative to I ⊂ S1 , a finite un...
David Richeson, Paul Winkler, Jim Wiseman
POPL
2010
ACM
16 years 16 days ago
Dependent Types from Counterexamples
d by recent research in abstract model checking, we present a new approach to inferring dependent types. Unlike many of the existing approaches, our approach does not rely on prog...
Tachio Terauchi
CADE
2009
Springer
15 years 10 months ago
Interpolant Generation for UTVPI
Abstract. The problem of computing Craig interpolants in SMT has recently received a lot of interest, mainly for its applications in formal verification. Efficient algorithms for ...
Alessandro Cimatti, Alberto Griggio, Roberto Sebas...
QEST
2007
IEEE
15 years 9 months ago
GRIP: Generic Representatives in PRISM
We give an overview of GRIP, a symmetry reduction tool for the probabilistic model checker PRISM, together with experimental results for a selection of example specifications. 1 ...
Alastair F. Donaldson, Alice Miller, David Parker