ICCAD '92 1992 IEEE/ACM international conference proceedings on Computer-aided design
Modeling design constraints and biasing in simulation using BDDs
ICCAD '99 Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design
Building Circuits from Relations
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Simplification of non-deterministic multi-valued networks
Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design
Constraint synthesis for environment modeling in functional verification
Proceedings of the 40th annual Design Automation Conference
A recursive paradigm to solve Boolean relations
Proceedings of the 41st annual Design Automation Conference
Interactive presentation: Automatic hardware synthesis from specifications: a case study
Proceedings of the conference on Design, automation and test in Europe
Scalable exploration of functional dependency by interpolation and incremental SAT solving
Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
Bi-decomposing large Boolean functions via interpolation and satisfiability solving
Proceedings of the 45th annual Design Automation Conference
Scalable don't-care-based logic optimization and resynthesis
Proceedings of the ACM/SIGDA international symposium on Field programmable gate arrays
To SAT or not to SAT: Ashenhurst decomposition in a large scale
Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design
Synthesizing complementary circuits automatically
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Resolution proofs and Skolem functions in QBF evaluation and applications
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Towards completely automatic decoder synthesis
Proceedings of the International Conference on Computer-Aided Design
Unified QBF certification and its applications
Formal Methods in System Design
Henkin quantifiers and boolean formulae
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Interpolant strength revisited
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Generalized reactivity(1) synthesis without a monolithic strategy
HVC'11 Proceedings of the 7th international Haifa Verification conference on Hardware and Software: verification and testing
Henkin quantifiers and Boolean formulae: A certification perspective of DQBF
Theoretical Computer Science
| Hi-index | 0.00 |
Boolean relations are an important tool in system synthesis and verification to characterize solutions to a set of Boolean constraints. For physical realization as hardware, a deterministic function often has to be extracted from a relation. Prior methods however are unlikely to handle large problem instances. From the scalability standpoint this paper demonstrates how interpolation can be exploited to extend deter-minization capacity. A comparative study is performed on several proposed computation techniques. Experimental results show that Boolean relations with thousands of variables can be effectively determinized and the extracted functional implementations are of reasonable quality.