Sciweavers

72 search results - page 8 / 15
» Secure function evaluation with ordered binary decision diag...
Sort
View
CORR
2008
Springer
142views Education» more  CORR 2008»
13 years 7 months ago
Declarative Combinatorics: Boolean Functions, Circuit Synthesis and BDDs in Haskell
We describe Haskell implementations of interesting combinatorial generation algorithms with focus on boolean functions and logic circuit representations. First, a complete exact c...
Paul Tarau
CCS
2004
ACM
14 years 26 days ago
KNOW Why your access was denied: regulating feedback for usable security
We examine the problem of providing useful feedback about access control decisions to users while controlling the disclosure of the system’s security policies. Relevant feedback...
Apu Kapadia, Geetanjali Sampemane, Roy H. Campbell
SCP
1998
134views more  SCP 1998»
13 years 7 months ago
Abstract Interpretation Using Typed Decision Graphs
Interpretation Using Typed Decision Graphs Laurent Mauborgne LIENS, ´Ecole Normale Sup´erieure, 45 rue d’Ulm, 75230 Paris cedex 05, France Abstract. This article presents a way...
Laurent Mauborgne
ISCAS
2006
IEEE
94views Hardware» more  ISCAS 2006»
14 years 1 months ago
On the sensitivity of BDDs with respect to path-related objective functions
— Reduced ordered Binary Decision Diagrams (BDDs) are a data structure for efficient representation and manipulation of Boolean functions. They are frequently used in logic synt...
Rüdiger Ebendt, Rolf Drechsler
ICCD
2001
IEEE
176views Hardware» more  ICCD 2001»
14 years 4 months ago
BDD Variable Ordering by Scatter Search
Reduced Ordered Binary Decision Diagrams (BDDs) are a data structure for representation and manipulation of Boolean functions which are frequently used in VLSI Design Automation. ...
William N. N. Hung, Xiaoyu Song