Sciweavers

472 search results - page 30 / 95
» Functional simulation using binary decision diagrams
Sort
View
CORR
2008
Springer
158views Education» more  CORR 2008»
13 years 9 months ago
Declarative Combinatorics: Isomorphisms, Hylomorphisms and Hereditarily Finite Data Types in Haskell
This paper is an exploration in a functional programming framework of isomorphisms between elementary data types (natural numbers, sets, finite functions, permutations binary deci...
Paul Tarau
CEC
2010
IEEE
13 years 9 months ago
Simulated Annealing for constructing binary covering arrays of variable strength
— This paper presents new upper bounds for binary covering arrays of variable strength constructed by using a new Simulated Annealing (SA) algorithm. This algorithm incorporates ...
Jose Torres-Jimenez, Eduardo Rodriguez-Tello
CORR
2000
Springer
100views Education» more  CORR 2000»
13 years 8 months ago
Algorithms for Analysing Firewall and Router Access Lists
Network firewalls and routers use a rule database to decide which packets will be allowed from one network onto another. By filtering packets the firewalls and routers can improve...
Scott Hazelhurst
FMSD
2007
110views more  FMSD 2007»
13 years 9 months ago
Exploiting interleaving semantics in symbolic state-space generation
Symbolic techniques based on Binary Decision Diagrams (BDDs) are widely employed for reasoning about temporal properties of hardware circuits and synchronous controllers. However, ...
Gianfranco Ciardo, Gerald Lüttgen, Andrew S. ...
ARC
2009
Springer
102views Hardware» more  ARC 2009»
14 years 3 months ago
A Parallel Branching Program Machine for Emulation of Sequential Circuits
The parallel branching program machine (PBM128) consists of 128 branching program machines (BMs) and a programmable interconnection. To represent logic functions on BMs, we use qua...
Hiroki Nakahara, Tsutomu Sasao, Munehiro Matsuura,...