Follow
Byron Cook
Byron Cook
Professor of Computer Science, UCL, Amazon
Verified email at cs.ucl.ac.uk - Homepage
Title
Cited by
Cited by
Year
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
5262006
Termination proofs for systems code
B Cook, A Podelski, A Rybalchenko
Acm Sigplan Notices 41 (6), 415-426, 2006
4592006
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
4222004
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
3222008
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
2902007
Terminator: Beyond Safety
B Cook, A Podelski, A Rybalchenko
International Conference on Computer Aided Verification, 415-418, 2006
1702006
SLAyer: Memory safety for systems-level code
J Berdine, B Cook, S Ishtiaq
International Conference on Computer Aided Verification, 178-183, 2011
1692011
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
1632007
Proving program termination
B Cook, A Podelski, A Rybalchenko
Communications of the ACM 54 (5), 88-98, 2011
1512011
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
1512006
Abstraction refinement for termination
B Cook, A Podelski, A Rybalchenko
International Static Analysis Symposium, 87-101, 2005
1472005
Interprocedural shape analysis with separated heap abstractions
A Gotsman, J Berdine, B Cook
International Static Analysis Symposium, 240-260, 2006
1462006
A symbolic approach to predicate abstraction
SK Lahiri, RE Bryant, B Cook
International Conference on Computer Aided Verification, 141-153, 2003
1392003
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
1272007
Thread-modular shape analysis
A Gotsman, J Berdine, B Cook, M Sagiv
ACM SIGPLAN Notices 42 (6), 266-277, 2007
1202007
Ramsey vs. lexicographic termination proving
B Cook, A See, F Zuleger
International Conference on Tools and Algorithms for the Construction and …, 2013
1132013
Proving conditional termination
B Cook, S Gulwani, T Lev-Ami, A Rybalchenko, M Sagiv
International Conference on Computer Aided Verification, 328-340, 2008
1132008
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
1122011
Microprocessor specification in Hawk
J Matthews, B Cook, J Launchbury
Proceedings of the 1998 International Conference on Computer Languages (Cat …, 1998
1081998
Proving that non-blocking algorithms don't block
A Gotsman, B Cook, M Parkinson, V Vafeiadis
ACM SIGPLAN Notices 44 (1), 16-28, 2009
1062009
The system can't perform the operation now. Try again later.
Articles 1–20