Sciweavers

366 search results - page 4 / 74
» Synthesis: Words and Traces
Sort
View
AAECC
2007
Springer
85views Algorithms» more  AAECC 2007»
14 years 2 months ago
Distribution of Trace Values and Two-Weight, Self-orthogonal Codes over GF ( p , 2)
The uniform distribution of the trace map lends itself very well to the construction of binary and non-binary codes from Galois fields and Galois rings. In this paper we study the...
N. Pinnawala, A. Rao, T. Aaron Gulliver
FGCS
2006
125views more  FGCS 2006»
13 years 8 months ago
Compressible memory data structures for event-based trace analysis
The article presents a new compressible memory data structure for trace events. Its primary intention is to aid the analysis of huge traces by reducing the memory requirements sig...
Andreas Knüpfer, Wolfgang E. Nagel
ENTCS
2006
169views more  ENTCS 2006»
13 years 8 months ago
Constructing Induction Rules for Deductive Synthesis Proofs
We describe novel computational techniques for constructing induction rules for deductive synthesis proofs. Deductive synthesis holds out the promise of automated construction of ...
Alan Bundy, Lucas Dixon, Jeremy Gow, Jacques D. Fl...
DLT
2006
13 years 9 months ago
Polynomials, Fragments of Temporal Logic and the Variety DA over Traces
Abstract. We show that some language theoretic and logical characterizations of recognizable word languages whose syntactic monoid is in the variety DA also hold over traces. To th...
Manfred Kufleitner
CORR
2011
Springer
175views Education» more  CORR 2011»
13 years 3 months ago
Traced communication complexity of cellular automata
We study cellular automata with respect to a new communication complexity problem: each of two players know half of some finite word, and must be able to tell whether the state o...
Eric Goles Ch., Pierre Guillon, Ivan Rapaport