Sciweavers

788 search results - page 90 / 158
» Symbolic Equivalence Checking
Sort
View
ICCAD
1994
IEEE
134views Hardware» more  ICCAD 1994»
13 years 12 months ago
Boolean constrained encoding: a new formulation and a case study
1 This paper provides a new, generalized approach to the problem of encoding information as vectors of binary digits. We furnish a formal definition for the Boolean constrained enc...
Ney Laert Vilar Calazans
ATVA
2006
Springer
140views Hardware» more  ATVA 2006»
13 years 11 months ago
On the Construction of Fine Automata for Safety Properties
Of special interest in formal verification are safety properties, which assert that the system always stays within some allowed region. Each safety property can be associated with...
Orna Kupferman, Robby Lampert
CAV
2001
Springer
83views Hardware» more  CAV 2001»
14 years 8 days ago
Iterating Transducers
Regular languages have proved useful for the symbolic state exploration of infinite state systems. They can be used to represent infinite sets of system configurations; the tran...
Dennis Dams, Yassine Lakhnech, Martin Steffen
CIE
2008
Springer
13 years 9 months ago
Effective Dimensions and Relative Frequencies
Consider the problem of calculating the fractal dimension of a set X consisting of all infinite sequences S over a finite alphabet that satisfy some given condition P on the asympt...
Xiaoyang Gu, Jack H. Lutz
CORR
2006
Springer
104views Education» more  CORR 2006»
13 years 7 months ago
Multigroup-Decodable STBCs from Clifford Algebras
A Space-Time Block Code (STBC) in K symbols (variables) is called g-group decodable STBC if its maximumlikelihood decoding metric can be written as a sum of g terms such that each ...
Sanjay Karmakar, B. Sundar Rajan