\n \n \n
\n\n\n
\n
\n\n \n \n \n \n \n Robust SAT-Based Search Algorithm for Leakage Power Reduction.\n \n \n \n\n\n \n Aloul, F. A.; Hassoun, S.; Sakallah, K. A.; and Blaauw, D.\n\n\n \n\n\n\n In
12th International Workshop on Power and Timing Modeling, Optimization and Simulation (PATMOS '02), pages 167-177, Sevilla, Spain, September 11-13 2002. \n
\n\n
\n\n
\n\n
\n\n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{aloul2002robust,\n author = {Aloul, Fadi A. and Hassoun, Soha and Sakallah, Karem A. and Blaauw, David},\n title = {{Robust SAT-Based Search Algorithm for Leakage Power Reduction}},\n booktitle = {12th International Workshop on Power and Timing Modeling, Optimization and Simulation (PATMOS '02)},\n address = {Sevilla, Spain},\n pages = {167-177},\n month = {September 11-13},\n year = {2002}\n\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n Symmetry Breaking for Boolean Satisfiability: The Mysteries of Logic Minimization.\n \n \n \n\n\n \n Aloul, F. A.; Markov, I. L.; and Sakallah, K. A.\n\n\n \n\n\n\n In
Second International Workshop on Symmetry in Constraint Satisfaction Problems, Held in conjunction with Eighth International Conference on Principles and Practice of Constraint Programming, CP2002, pages 37-46, Ithaca, New York, September 8 2002. \n
\n\n
\n\n
\n\n
\n\n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{aloul2002symmetry,\n author = {Aloul, Fadi A. and Markov, Igor L. and Sakallah, Karem A.},\n title = {{Symmetry Breaking for Boolean Satisfiability: The Mysteries of Logic Minimization}},\n booktitle = {Second International Workshop on Symmetry in Constraint Satisfaction Problems, Held in conjunction with Eighth International Conference on Principles and Practice of Constraint Programming, CP2002},\n address = {Ithaca, New York},\n pages = {37-46},\n month = {September 8},\n year = {2002}\n\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n SAT-based Sequential Depth Computation.\n \n \n \n\n\n \n Mneimneh, M.; and Sakallah, K.\n\n\n \n\n\n\n In
First International Workshop on Constraints in Formal Verification, Held in conjunction with Eight International Conference on Principles and Practice of Constraint Programming, CP2002, Ithaca, New York, September 8 2002. \n
\n\n
\n\n
\n\n
\n\n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{mneimneh2002sat,\n author = {Mneimneh, Maher and Sakallah, Karem},\n title = {{SAT-based Sequential Depth Computation}},\n booktitle = {First International Workshop on Constraints in Formal Verification, Held in conjunction with Eight International Conference on Principles and Practice of Constraint Programming, CP2002},\n address = {Ithaca, New York},\n month = {September 8},\n year = {2002}\n\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n Hybrid Routing for FPGAs by Integrating Boolean Satisfiability with Geometric Search.\n \n \n \n\n\n \n Nam, G.; Sakallah, K.; and Rutenbar, R.\n\n\n \n\n\n\n In Glesner, M.; Zipf, P.; and Renovell, M., editor(s),
12th International Conference on Field Programmable Logic and Application (FPL 2002), volume LNCS 2438, pages 360-369, Montpellier, France, September 2-4 2002. Springer-Verlag\n
\n\n
\n\n
\n\n
\n\n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{nam2002hybrid,\n author = {Nam, Gi-Joon and Sakallah, Karem and Rutenbar, Rob},\n title = {{Hybrid Routing for FPGAs by Integrating Boolean Satisfiability with Geometric Search}},\n booktitle = {12th International Conference on Field Programmable Logic and Application (FPL 2002)},\n editor = {Glesner, M. and Zipf, P. and Renovell, M.},\n address = {Montpellier, France},\n publisher = {Springer-Verlag},\n volume = {LNCS 2438},\n pages = {360-369},\n month = {September 2-4},\n year = {2002}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n Generic ILP versus Specialized 0-1 ILP: an Update.\n \n \n \n\n\n \n Aloul, F. A.; Ramani, A.; Markov, I. L.; and Sakallah, K. A.\n\n\n \n\n\n\n In
Digest of IEEE International Conference on Computer-Aided Design (ICCAD), pages 450-457, San Jose, California, November 2002. \n
\n\n
\n\n
\n\n
\n\n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{aloul2002generic,\n author = {Aloul, Fadi A. and Ramani, Arathi and Markov, Igor L. and Sakallah, Karem A.},\n title = {{Generic ILP versus Specialized 0-1 ILP: an Update}},\n booktitle = {Digest of IEEE International Conference on Computer-Aided Design (ICCAD)},\n address = {San Jose, California},\n pages = {450-457},\n month = {November},\n year = {2002}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n Resynthesis of Multi-level Circuits Under Tight Constraints Using Symbolic Optimization.\n \n \n \n\n\n \n Kravets, V. N.; and Sakallah, K. A.\n\n\n \n\n\n\n In
Digest of IEEE International Conference on Computer-Aided Design (ICCAD), pages 687-693, San Jose, California, November 2002. \n
\n\n
\n\n
\n\n
\n\n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{kravets2002resynthesis,\n author = {Kravets, Victor N. and Sakallah, Karem A.},\n title = {{Resynthesis of Multi-level Circuits Under Tight Constraints Using Symbolic Optimization}},\n booktitle = {Digest of IEEE International Conference on Computer-Aided Design (ICCAD)},\n address = {San Jose, California},\n pages = {687-693},\n month = {November},\n year = {2002}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n Solving Difficult SAT Instances in the Presence of Symmetry.\n \n \n \n\n\n \n Aloul, F. A.; Ramani, A.; Markov, I. L.; and Sakallah, K. A.\n\n\n \n\n\n\n In
Fifth International Symposium on Theory and Applications of Satisfiability Testing, pages 338-345, Cincinnati, Ohio, May 2002. \n
\n\n
\n\n
\n\n
\n\n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{aloul2002solving,\n author = {Aloul, Fadi A. and Ramani, Arathi and Markov, Igor L. and Sakallah, Karem A.},\n title = {{Solving Difficult SAT Instances in the Presence of Symmetry}},\n booktitle = {Fifth International Symposium on Theory and Applications of Satisfiability Testing},\n address = {Cincinnati, Ohio},\n pages = {338-345},\n month = {May},\n year = {2002}\n\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n PBS: A Backtrack-Search Pseudo-Boolean Solver and Optimizer.\n \n \n \n\n\n \n Aloul, F. A.; Ramani, A.; Markov, I. L.; and Sakallah, K. A.\n\n\n \n\n\n\n In
Fifth International Symposium on Theory and Applications of Satisfiability Testing, pages 346-353, Cincinnati, Ohio, May 2002. \n
\n\n
\n\n
\n\n
\n\n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{aloul2002pbs,\n author = {Aloul, Fadi A. and Ramani, Arathi and Markov, Igor L. and Sakallah, Karem A.},\n title = {{PBS: A Backtrack-Search Pseudo-Boolean Solver and Optimizer}},\n booktitle = {Fifth International Symposium on Theory and Applications of Satisfiability Testing},\n address = {Cincinnati, Ohio},\n pages = {346-353},\n month = {May},\n year = {2002}\n\n}\n\n
\n
\n\n\n\n
\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n Search-Based SAT Using Zero-Suppressed BDDs.\n \n \n \n\n\n \n Aloul, F. A.; Mneimneh, M. N.; and Sakallah, K. A.\n\n\n \n\n\n\n In
Proceedings of the Design, Automation and Test in Europe Conference (DATE 2002), pages 1082, Paris, France, March 2002. \n
\n\n
\n\n
\n\n
\n\n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{aloul2002search,\n author = {Aloul, Fadi A. and Mneimneh, Maher N. and Sakallah, Karem A.},\n title = {{Search-Based SAT Using Zero-Suppressed BDDs}},\n booktitle = {Proceedings of the Design, Automation and Test in Europe Conference (DATE 2002)},\n address = {Paris, France},\n pages = {1082},\n month = {March},\n year = {2002}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n Solving Difficult SAT Instances in the Presence of Symmetry.\n \n \n \n\n\n \n Aloul, F. A.; Arathi, R.; Markov, I.; and Sakallah, K. A.\n\n\n \n\n\n\n In
Proc. 39th IEEE/ACM Design Automation Conference (DAC), pages 731-736, New Orlean, Louisiana, June 2002. \n
\n\n
\n\n
\n\n
\n\n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{aloul2002asolving,\n author = {Aloul, Fadi A. and Arathi, Raman and Markov, Igor and Sakallah, Karem A.},\n title = {{Solving Difficult SAT Instances in the Presence of Symmetry}},\n booktitle = {Proc. 39th IEEE/ACM Design Automation Conference (DAC)},\n address = {New Orlean, Louisiana},\n pages = {731-736},\n month = {June},\n year = {2002}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n ZBDD-Based Backtrack Search SAT Solver.\n \n \n \n\n\n \n Aloul, F. A.; Mneimneh, M. N.; and Sakallah, K. A.\n\n\n \n\n\n\n In
International Workshop on Logic & Synthesis (IWLS), pages 131-136, New Orleans, Louisiana, June 2002. \n
\n\n
\n\n
\n\n
\n\n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{aloul2002zbdd,\n author = {Aloul, Fadi A. and Mneimneh, Maher N. and Sakallah, Karem A.},\n title = {{ZBDD-Based Backtrack Search SAT Solver}},\n booktitle = {International Workshop on Logic \\& Synthesis (IWLS)},\n address = {New Orleans, Louisiana},\n pages = {131-136},\n month = {June},\n year = {2002}\n\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n Satometer: How Much Have We Searched?.\n \n \n \n\n\n \n Aloul, F. A.; Sierawski, B.; and Sakallah, K. A.\n\n\n \n\n\n\n In
Proc. 39th IEEE/ACM Design Automation Conference (DAC), pages 737-742, New Orleans, Louisiana, June 2002. \n
\n\n
\n\n
\n\n
\n\n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{aloul2002satometer,\n author = {Aloul, Fadi A. and Sierawski, Brian and Sakallah, Karem A.},\n title = {{Satometer: How Much Have We Searched?}},\n booktitle = {Proc. 39th IEEE/ACM Design Automation Conference (DAC)},\n address = {New Orleans, Louisiana},\n pages = {737-742},\n month = {June},\n year = {2002}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n A New FPGA Detailed Routing Approach via Search-Based Boolean Satisfiability.\n \n \n \n\n\n \n Nam, G.; Sakallah, K. A.; and Rutenbar, R.\n\n\n \n\n\n\n
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 21(6): 674-684. June 2002.\n
\n\n
\n\n
\n\n
\n\n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@article{nam2002new,\n author = {Nam, Gi-Joon and Sakallah, Karem A. and Rutenbar, Rob},\n title = {{A New FPGA Detailed Routing Approach via Search-Based Boolean Satisfiability}},\n journal = {IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems},\n volume = {21},\n number = {6},\n pages = {674-684},\n month = {June},\n year = {2002}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n Majority-Based Decomposition of Carry Logic in Binary Adders.\n \n \n \n\n\n \n Nazhandali, L.; and Sakallah, K. A.\n\n\n \n\n\n\n In
International Workshop on Logic & Synthesis (IWLS), pages 179-184, New Orleans, Louisiana, June 2002. \n
\n\n
\n\n
\n\n
\n\n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{nazhandali2002majority,\n author = {Nazhandali, Leyla and Sakallah, Karem A.},\n title = {{Majority-Based Decomposition of Carry Logic in Binary Adders}},\n booktitle = {International Workshop on Logic \\& Synthesis (IWLS)},\n address = {New Orleans, Louisiana},\n pages = {179-184},\n month = {June},\n year = {2002}\n\n}\n\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n Satisfiability Models and Algorithms for Circuit Delay Computation.\n \n \n \n\n\n \n e Silva, L. G.; Marques-Silva, J.; Silveira, L. M.; and Sakallah, K. A.\n\n\n \n\n\n\n
ACM Transactions on Design Automation of Electronic Systems (TODAES), 7(1): 137-158. January 2002.\n
\n\n
\n\n
\n\n
\n\n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@article{esilva2002satisfiability,\n author = {e Silva, Luis Guerra and Marques-Silva, {J\\~oao} and Silveira, L. Miguel and Sakallah, Karem A.},\n title = {{Satisfiability Models and Algorithms for Circuit Delay Computation}},\n journal = {ACM Transactions on Design Automation of Electronic Systems (TODAES)},\n volume = {7},\n number = {1},\n pages = {137-158},\n month = {January},\n year = {2002}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n Static Timing Analysis.\n \n \n \n\n\n \n Kukimoto, Y.; Berkelaar, M.; and Sakallah, K.\n\n\n \n\n\n\n In Hassoun, S.; and Sasao, T., editor(s),
Logic Synthesis and Verification, of The Kluwer International Series in Engineering and Computer Science, pages 373-401. Kluwer Academic Publishers, 2002.\n
\n\n
\n\n
\n\n
\n\n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@incollection{kukimoto2002static,\n author = {Kukimoto, Yuji and Berkelaar, Michel and Sakallah, Karem},\n title = {{Static Timing Analysis}},\n booktitle = {Logic Synthesis and Verification},\n editor = {Hassoun, Soha and Sasao, Tsutomu},\n series = {The Kluwer International Series in Engineering and Computer Science},\n publisher = {Kluwer Academic Publishers},\n pages = {373-401},\n year = {2002}\n}\n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n% 2001\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n
\n
\n\n\n\n
\n\n\n\n\n\n