| Thorough static analysis of device drivers T Ball, E Bounimova, B Cook, V Levin, J Lichtenberg, C McGarvey, ... ACM SIGOPS Operating Systems Review 40 (4), 73-85, 2006 | 493 | 2006 |
| Termination proofs for systems code B Cook, A Podelski, A Rybalchenko ACM Sigplan Notices 41 (6), 415-426, 2006 | 433 | 2006 |
| SLAM and Static Driver Verifier: Technology transfer of formal methods inside Microsoft T Ball, B Cook, V Levin, SK Rajamani International Conference on Integrated Formal Methods, 1-20, 2004 | 374 | 2004 |
| Scalable shape analysis for systems code H Yang, O Lee, J Berdine, C Calcagno, B Cook, D Distefano, P O’Hearn International Conference on Computer Aided Verification, 385-398, 2008 | 306 | 2008 |
| Shape analysis for composite data structures J Berdine, C Calcagno, B Cook, D Distefano, PW O’hearn, T Wies, ... International Conference on Computer Aided Verification, 178-192, 2007 | 272 | 2007 |
| Proving program termination B Cook, A Podelski, A Rybalchenko Communications of the ACM 54 (5), 88-98, 2011 | 183* | 2011 |
| Terminator: Beyond Safety B Cook, A Podelski, A Rybalchenko International Conference on Computer Aided Verification, 415-418, 2006 | 153 | 2006 |
| SLAyer: Memory safety for systems-level code J Berdine, B Cook, S Ishtiaq International Conference on Computer Aided Verification, 178-183, 2011 | 149 | 2011 |
| Automatic termination proofs for programs with shape-shifting heaps J Berdine, B Cook, D Distefano, PW O’hearn International Conference on Computer Aided Verification, 386-400, 2006 | 145 | 2006 |
| Abstraction refinement for termination B Cook, A Podelski, A Rybalchenko International Static Analysis Symposium, 87-101, 2005 | 145 | 2005 |
| Local reasoning for storable locks and threads A Gotsman, J Berdine, B Cook, N Rinetzky, M Sagiv Asian Symposium on Programming Languages And Systems, 19-37, 2007 | 144 | 2007 |
| Interprocedural shape analysis with separated heap abstractions A Gotsman, J Berdine, B Cook International Static Analysis Symposium, 240-260, 2006 | 141 | 2006 |
| A symbolic approach to predicate abstraction SK Lahiri, RE Bryant, B Cook International Conference on Computer Aided Verification, 141-153, 2003 | 128 | 2003 |
| Proving that programs eventually do something good B Cook, A Gotsman, A Podelski, A Rybalchenko, MY Vardi ACM SIGPLAN Notices 42 (1), 265-276, 2007 | 120 | 2007 |
| Microprocessor specification in Hawk J Matthews, B Cook, J Launchbury Proceedings of the 1998 International Conference on Computer Languages (Cat …, 1998 | 108 | 1998 |
| Thread-modular shape analysis A Gotsman, J Berdine, B Cook, M Sagiv ACM SIGPLAN Notices 42 (6), 266-277, 2007 | 106 | 2007 |
| Proving conditional termination B Cook, S Gulwani, T Lev-Ami, A Rybalchenko, M Sagiv International Conference on Computer Aided Verification, 328-340, 2008 | 104 | 2008 |
| Ramsey vs. lexicographic termination proving B Cook, A See, F Zuleger International Conference on Tools and Algorithms for the Construction and …, 2013 | 103 | 2013 |
| Proving that non-blocking algorithms don't block A Gotsman, B Cook, M Parkinson, V Vafeiadis ACM SIGPLAN Notices 44 (1), 16-28, 2009 | 101 | 2009 |
| Tractable reasoning in a fragment of separation logic B Cook, C Haase, J Ouaknine, M Parkinson, J Worrell International Conference on Concurrency Theory, 235-249, 2011 | 98 | 2011 |
Josh BerdineFacebookE-mail megerősítve itt: fb.com
