Prati
Byron Cook
Byron Cook
Professor of Computer Science, UCL, Amazon
Potvrđena adresa e-pošte na cs.ucl.ac.uk - Početna stranica
Naslov
Citirano
Citirano
Godina
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
5422006
Termination proofs for systems code
B Cook, A Podelski, A Rybalchenko
ACM Sigplan Notices 41 (6), 415-426, 2006
4872006
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
4662004
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
3332008
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
3082007
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
1952018
Terminator: Beyond Safety: (Tool Paper)
B Cook, A Podelski, A Rybalchenko
Computer Aided Verification: 18th International Conference, CAV 2006 …, 2006
1902006
Proving program termination
B Cook, A Podelski, A Rybalchenko
Communications of the ACM 54 (5), 88-98, 2011
1802011
SLAyer: Memory Safety for Systems-Level Code
J Berdine, B Cook, S Ishtiaq
International Conference on Computer Aided Verification, 178-183, 2011
1772011
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
1742007
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
1622006
Abstraction refinement for termination
B Cook, A Podelski, A Rybalchenko
International Static Analysis Symposium, 87-101, 2005
1532005
Interprocedural shape analysis with separated heap abstractions
A Gotsman, J Berdine, B Cook
Static Analysis: 13th International Symposium, SAS 2006, Seoul, Korea …, 2006
1492006
A symbolic approach to predicate abstraction
SK Lahiri, RE Bryant, B Cook
International Conference on Computer Aided Verification, 141-153, 2003
1472003
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
1402007
Formal reasoning about the security of amazon web services
B Cook
International Conference on Computer Aided Verification, 38-47, 2018
1302018
Thread-modular shape analysis
A Gotsman, J Berdine, B Cook, M Sagiv
ACM SIGPLAN Notices 42 (6), 266-277, 2007
1292007
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
1282011
Ramsey vs. lexicographic termination proving
B Cook, A See, F Zuleger
Tools and Algorithms for the Construction and Analysis of Systems: 19th …, 2013
1232013
Proving conditional termination
B Cook, S Gulwani, T Lev-Ami, A Rybalchenko, M Sagiv
Computer Aided Verification: 20th International Conference, CAV 2008 …, 2008
1202008
Sustav trenutno ne može provesti ovu radnju. Pokušajte ponovo kasnije.
Članci 1–20