Sciweavers

1159 search results - page 162 / 232
» Binary Decision Graphs
Sort
View
SAS
2004
Springer
140views Formal Methods» more  SAS 2004»
14 years 3 months ago
Path-Sensitive Analysis for Linear Arithmetic and Uninterpreted Functions
We describe data structures and algorithms for performing a path-sensitive program analysis to discover equivalences of expressions involving linear arithmetic or uninterpreted fun...
Sumit Gulwani, George C. Necula
WIA
2004
Springer
14 years 3 months ago
A BDD-Like Implementation of an Automata Package
In this paper we propose a new data structure, called shared automata, for representing deterministic finite automata (DFA). Shared automata admit a strong canonical form for DFA ...
Jean-Michel Couvreur
DATE
2003
IEEE
99views Hardware» more  DATE 2003»
14 years 3 months ago
Fast Computation of Data Correlation Using BDDs
Data correlation is a well-known problem that causes difficulty in VLSI testing. Based on a correlation metric, an efficient heuristic to select BIST registers has been proposed...
Zhihong Zeng, Qiushuang Zhang, Ian G. Harris, Maci...
IPPS
2002
IEEE
14 years 3 months ago
Optimal Remapping in Dynamic Bulk Synchronous Computations via a Stochastic Control Approach
A bulk synchronous computation proceeds in phases that are separated by barrier synchronization. For dynamic bulk synchronous computations that exhibit varying phase-wise computat...
Gang George Yin, Cheng-Zhong Xu, Le Yi Wang
ICFCA
2009
Springer
14 years 2 months ago
Handling Large Formal Context Using BDD - Perspectives and Limitations
This paper presents Binary Decision Diagrams (BDDs) applied to Formal Concept Analysis (FCA). The aim is to increase the FCA capability to handle large formal contexts. The main id...
Andrei Rimsa, Luis E. Zárate, Mark A. J. So...