123 search results - page 6 / 25 » Complexity of Boolean Functions on PRAMs - Lower Bound Techn... |
CPC
2004
13 years 7 months ago
2004
We consider boolean functions over n variables. Any such function can be represented (and computed) by a complete binary tree with and or or in the internal nodes and a literal in...
CHARME
2005
Springer
14 years 27 days ago
2005
Springer
Abstract. We define and study a quantitative generalization of the traditional boolean framework of model-based specification and verification. In our setting, propositions have...
SAS
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Proving the termination of a flowchart program can be done by exhibiting a ranking function, i.e., a function from the program states to a wellfounded set, which strictl...
FM
2009
Springer
14 years 1 months ago
2009
Springer
In Bounded Model Checking both the system model and the checked property are translated into a Boolean formula to be analyzed by a SAT-solver. We introduce a new encoding technique...
TCAD
2008
13 years 7 months ago
2008
Boolean matching is one of the enabling techniques for technology mapping and logic resynthesis of Field Programmable Gate Array (FPGA). SAT-based Boolean matching (SAT-BM) has bee...