Mukul R. Prasad, Ph.D. - Publications
Affiliations: | 2001 | University of California, Berkeley, Berkeley, CA, United States |
Area:
Design, Modeling and Analysis (DMA); Advanced methods in combinational and sequential logic synthesis and formal verificationYear | Citation | Score | |||
---|---|---|---|---|---|
2005 | Prasad MR, Biere A, Gupta A. A survey of recent advances in SAT-based formal verification International Journal On Software Tools For Technology Transfer. 7: 156-173. DOI: 10.1007/S10009-004-0183-4 | 0.356 | |||
2002 | Goldberg EI, Prasad MR, Brayton RK. Using problem symmetry in search based satisfiability algorithms Proceedings -Design, Automation and Test in Europe, Date. 134-141. DOI: 10.1109/DATE.2002.998261 | 0.452 | |||
2001 | Goldberg EI, Prasad MR, Brayton RK. Using SAT for combinational equivalence checking Proceedings -Design, Automation and Test in Europe, Date. 114-121. DOI: 10.1109/DATE.2001.915010 | 0.478 | |||
2001 | Prasad MR, Chong P, Keutzer K. Why is combinational ATPG efficiently solvable for practical VLSI circuits? Journal of Electronic Testing: Theory and Applications (Jetta). 17: 509-527. DOI: 10.1023/A:1012820722053 | 0.456 | |||
1999 | Prasad MR, Chong P, Keutzer K. Why is ATPG easy? Proceedings - Design Automation Conference. 22-28. | 0.315 | |||
Show low-probability matches. |