Sciweavers

423 search results - page 63 / 85
» The Generalization of Generalized Automata: Expression Autom...
Sort
View
CSL
2009
Springer
14 years 3 months ago
Algorithmic Analysis of Array-Accessing Programs
For programs whose data variables range over boolean or finite domains, program verification is decidable, and this forms the basis of recent tools for software model checking. I...
Rajeev Alur, Pavol Cerný, Scott Weinstein
SACRYPT
2009
Springer
147views Cryptology» more  SACRYPT 2009»
14 years 3 months ago
A New Approach for FCSRs
The Feedback with Carry Shift Registers (FCSRs) have been proposed as an alternative to Linear Feedback Shift Registers (LFSRs) for the design of stream ciphers. FCSRs have good st...
François Arnault, Thierry P. Berger, C&eacu...
CAI
2007
Springer
14 years 2 months ago
Learning Deterministically Recognizable Tree Series - Revisited
Abstract. We generalize a learning algorithm originally devised for deterministic all-accepting weighted tree automata (wta) to the setting of arbitrary deterministic wta. The lear...
Andreas Maletti
DATE
2006
IEEE
136views Hardware» more  DATE 2006»
14 years 2 months ago
Defect tolerance of QCA tiles
Quantum dot Cellular Automata (QCA) is one of the promising technologies for nano scale implementation. The operation of QCA systems is based on a new paradigm generally referred ...
Jing Huang, Mariam Momenzadeh, Fabrizio Lombardi
ACSD
2005
IEEE
121views Hardware» more  ACSD 2005»
14 years 2 months ago
LusSy: A Toolbox for the Analysis of Systems-on-a-Chip at the Transactional Level
We describe a toolbox for the analysis of Systems-on-achip described in SystemC at the transactional level. The tools are able to extract information from SystemC code, and to bui...
Matthieu Moy, Florence Maraninchi, Laurent Maillet...