Bryan Brady, Ph.D. - Publications
Affiliations: | 2011 | Electrical Engineering & Computer Sciences | University of California, Berkeley, Berkeley, CA, United States |
Area:
Design, Modeling and Analysis (DMA); Programming Systems (PS); Dependable Computing; Computational Logic; Formal Methods; Control, Intelligent Systems, and Robotics (CIR); Security (SEC); Theory (THY)Year | Citation | Score | |||
---|---|---|---|---|---|
2011 | Brady BA, Bryant RE, Seshia SA. Learning conditional abstractions 2011 Formal Methods in Computer-Aided Design, Fmcad 2011. 116-124. | 0.553 | |||
2011 | Holcomb D, Brady B, Seshia S. Abstraction-based performance verification of NoCs Proceedings - Design Automation Conference. 492-497. | 0.609 | |||
2011 | Brady BA, Holcomb D, Seshia SA. Counterexample-guided SMT-driven optimal buffer sizing Proceedings -Design, Automation and Test in Europe, Date. 329-334. | 0.606 | |||
2010 | Brady BA, Bryant RE, Seshia SA, O'Leary JW. ATLAS: Automatic term-level abstraction of RTL designs 8th Acm/Ieee International Conference On Formal Methods and Models For Codesign, Memocode 2010. 31-40. DOI: 10.1109/MEMCOD.2010.5558624 | 0.601 | |||
2009 | Bryant RE, Kroening D, Ouaknine J, Seshia SA, Strichman O, Brady B. An abstraction-based decision procedure for bit-vector arithmetic International Journal On Software Tools For Technology Transfer. 11: 95-104. DOI: 10.1007/S10009-009-0101-X | 0.573 | |||
2007 | Bryant RE, Kroening D, Ouaknine J, Seshia SA, Strichman O, Brady B. Deciding bit-vector arithmetic with abstraction Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4424: 358-372. | 0.544 | |||
2007 | Jha S, Brady BA, Seshia SA. Symbolic reachability analysis of lazy linear hybrid automata Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4763: 241-256. | 0.542 | |||
Show low-probability matches. |