| 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 | 537 | 2006 |
| Termination proofs for systems code B Cook, A Podelski, A Rybalchenko ACM Sigplan Notices 41 (6), 415-426, 2006 | 487 | 2006 |
| SLAM and Static Driver Verifier: Technology transfer of formal methods inside Microsoft T Ball, B Cook, V Levin, SK Rajamani Integrated Formal Methods: 4th International Conference, IFM 2004 …, 2004 | 460 | 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 | 330 | 2008 |
| Shape analysis for composite data structures J Berdine, C Calcagno, B Cook, D Distefano, PW O’hearn, T Wies, ... Computer Aided Verification: 19th International Conference, CAV 2007, Berlin …, 2007 | 305 | 2007 |
| Terminator: Beyond Safety: (Tool Paper) B Cook, A Podelski, A Rybalchenko Computer Aided Verification: 18th International Conference, CAV 2006 …, 2006 | 189 | 2006 |
| Proving program termination B Cook, A Podelski, A Rybalchenko Communications of the ACM 54 (5), 88-98, 2011 | 185 | 2011 |
| Semantic-based automated reasoning for AWS access policies using SMT J Backes, P Bolignano, B Cook, C Dodge, A Gacek, K Luckow, N Rungta, ... 2018 Formal Methods in Computer Aided Design (FMCAD), 1-9, 2018 | 182 | 2018 |
| SLAyer: Memory Safety for Systems-Level Code J Berdine, B Cook, S Ishtiaq Computer Aided Verification: 23rd International Conference, CAV 2011 …, 2011 | 179 | 2011 |
| Local reasoning for storable locks and threads A Gotsman, J Berdine, B Cook, N Rinetzky, M Sagiv Programming Languages and Systems: 5th Asian Symposium, APLAS 2007 …, 2007 | 169 | 2007 |
| Automatic termination proofs for programs with shape-shifting heaps J Berdine, B Cook, D Distefano, PW O’hearn Computer Aided Verification: 18th International Conference, CAV 2006 …, 2006 | 160 | 2006 |
| A symbolic approach to predicate abstraction SK Lahiri, RE Bryant, B Cook International Conference on Computer Aided Verification, 141-153, 2003 | 151 | 2003 |
| Abstraction refinement for termination B Cook, A Podelski, A Rybalchenko Static Analysis: 12th International Symposium, SAS 2005, London, UK …, 2005 | 150 | 2005 |
| Interprocedural shape analysis with separated heap abstractions A Gotsman, J Berdine, B Cook Static Analysis: 13th International Symposium, SAS 2006, Seoul, Korea …, 2006 | 149 | 2006 |
| 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 | 140 | 2007 |
| Formal reasoning about the security of amazon web services B Cook Computer Aided Verification: 30th International Conference, CAV 2018, Held …, 2018 | 128 | 2018 |
| Thread-modular shape analysis A Gotsman, J Berdine, B Cook, M Sagiv ACM SIGPLAN Notices 42 (6), 266-277, 2007 | 126 | 2007 |
| Ramsey vs. lexicographic termination proving B Cook, A See, F Zuleger Tools and Algorithms for the Construction and Analysis of Systems: 19th …, 2013 | 125 | 2013 |
| Tractable reasoning in a fragment of separation logic B Cook, C Haase, J Ouaknine, M Parkinson, J Worrell CONCUR 2011–Concurrency Theory: 22nd International Conference, CONCUR 2011 …, 2011 | 124 | 2011 |
| Proving conditional termination B Cook, S Gulwani, T Lev-Ami, A Rybalchenko, M Sagiv Computer Aided Verification: 20th International Conference, CAV 2008 …, 2008 | 120 | 2008 |
Andreas PodelskiProfessor of Computer Science, Freiburg UniversityVerified email at informatik.uni-freiburg.de
