Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Byron Cook
2010 – today
- 2013
[j15]Domagoj Babic, Byron Cook, Alan J. Hu, Zvonimir Rakamaric: Proving termination of nonlinear command sequences. Formal Asp. Comput. 25(3): 389-403 (2013)- [j14]Byron Cook, Daniel Kroening, Philipp Rümmer, Christoph M. Wintersteiger: Ranking function synthesis for bit-vector relations. Formal Methods in System Design 43(1): 93-120 (2013)
- [c60]Marc Brockschmidt, Byron Cook, Carsten Fuhs: Better Termination Proving through Cooperation. CAV 2013: 413-429
- [c59]Alex S. Taylor, Nir Piterman, Samin Ishtiaq, Jasmin Fisher, Byron Cook, Caitlin Cockerton, Sam Bourton, David Benque: At the interface of biology and computation. CHI 2013: 493-502
- [c58]
- [c57]Byron Cook, Abigail See, Florian Zuleger: Ramsey vs. Lexicographic Termination Proving. TACAS 2013: 47-61
- 2012
- [j13]Byron Cook, Eric Koskinen, Moshe Y. Vardi: Temporal property verification as a program analysis task - Extended Version. Formal Methods in System Design 41(1): 66-82 (2012)
- [c56]David Benque, Sam Bourton, Caitlin Cockerton, Byron Cook, Jasmin Fisher, Samin Ishtiaq, Nir Piterman, Alex S. Taylor, Moshe Y. Vardi: Bma: Visual Tool for Modeling and Analyzing Biological Networks. CAV 2012: 686-692
- 2011
- [j12]Byron Cook, Andreas Podelski, Andrey Rybalchenko: Proving program termination. Commun. ACM 54(5): 88-98 (2011)
- [j11]Alexey Gotsman, Josh Berdine, Byron Cook: Precision and the Conjunction Rule in Concurrent Separation Logic. Electr. Notes Theor. Comput. Sci. 276: 171-190 (2011)
- [c55]
- [c54]Josh Berdine, Byron Cook, Samin Ishtiaq: SLAyer: Memory Safety for Systems-Level Code. CAV 2011: 178-183
- [c53]Byron Cook, Eric Koskinen, Moshe Y. Vardi: Temporal Property Verification as a Program Analysis Task. CAV 2011: 333-348
- [c52]Byron Cook, Christoph Haase, Joël Ouaknine, Matthew J. Parkinson, James Worrell: Tractable Reasoning in a Fragment of Separation Logic. CONCUR 2011: 235-249
- [c51]
- [c50]Byron Cook, Jasmin Fisher, Elzbieta Krepska, Nir Piterman: Proving Stabilization of Biological Systems. VMCAI 2011: 134-149
- 2010
- [c49]Byron Cook, Daniel Kroening, Philipp Rümmer, Christoph M. Wintersteiger: Ranking Function Synthesis for Bit-Vector Relations. TACAS 2010: 236-250
- [e4]Tayssir Touili, Byron Cook, Paul Jackson (Eds.): Computer Aided Verification, 22nd International Conference, CAV 2010, Edinburgh, UK, July 15-19, 2010. Proceedings. Lecture Notes in Computer Science 6174, Springer 2010, ISBN 978-3-642-14294-9
2000 – 2009
- 2009
- [j10]Byron Cook, Andreas Podelski, Andrey Rybalchenko: Summarization for termination: no return! Formal Methods in System Design 35(3): 369-387 (2009)
- [c48]Byron Cook, Ashutosh Gupta, Stephen Magill, Andrey Rybalchenko, Jirí Simsa, Satnam Singh, Viktor Vafeiadis: Finding heap-bounds for hardware synthesis. FMCAD 2009: 205-212
- [c47]
- [c46]Alexey Gotsman, Byron Cook, Matthew J. Parkinson, Viktor Vafeiadis: Proving that non-blocking algorithms don't block. POPL 2009: 16-28
- [c45]
- [e3]María Alpuente, Byron Cook, Christophe Joubert (Eds.): Formal Methods for Industrial Critical Systems, 14th International Workshop, FMICS 2009, Eindhoven, The Netherlands, November 2-3, 2009. Proceedings. Lecture Notes in Computer Science 5825, Springer 2009, ISBN 978-3-642-04569-1
- 2008
- [j9]Mike Hinchey, Michael Jackson, Patrick Cousot, Byron Cook, Jonathan P. Bowen, Tiziana Margaria: Software engineering and formal methods. Commun. ACM 51(9): 54-59 (2008)
- [c44]Byron Cook, Sumit Gulwani, Tal Lev-Ami, Andrey Rybalchenko, Mooly Sagiv: Proving Conditional Termination. CAV 2008: 328-340
- [c43]Hongseok Yang, Oukseh Lee, Josh Berdine, Cristiano Calcagno, Byron Cook, Dino Distefano, Peter W. O'Hearn: Scalable Shape Analysis for Systems Code. CAV 2008: 385-398
- [c42]Aziem Chawdhary, Byron Cook, Sumit Gulwani, Mooly Sagiv, Hongseok Yang: Ranking Abstractions. ESOP 2008: 148-162
- 2007
- [j8]Byron Cook, Roberto Sebastiani: Preface and Foreword. Electr. Notes Theor. Comput. Sci. 174(8): 3-6 (2007)
- [j7]
- [j6]Shuvendu K. Lahiri, Thomas Ball, Byron Cook: Predicate Abstraction via Symbolic Decision Procedures. Logical Methods in Computer Science 3(2) (2007)
- [j5]Byron Cook, Daniel Kroening, Natasha Sharygina: Verification of Boolean programs with unbounded thread creation. Theor. Comput. Sci. 388(1-3): 227-242 (2007)
- [c41]Alexey Gotsman, Josh Berdine, Byron Cook, Noam Rinetzky, Mooly Sagiv: Local Reasoning for Storable Locks and Threads. APLAS 2007: 19-37
- [c40]
- [c39]Josh Berdine, Cristiano Calcagno, Byron Cook, Dino Distefano, Peter W. O'Hearn, Thomas Wies, Hongseok Yang: Shape Analysis for Composite Data Structures. CAV 2007: 178-192
- [c38]Franz Baader, Byron Cook, Jürgen Giesl, Robert Nieuwenhuis: 07401 Executive Summary -- Deduction and Decision Procedures. Deduction and Decision Procedures 2007
- [c37]Franz Baader, Byron Cook, Jürgen Giesl, Robert Nieuwenhuis: 07401 Abstracts Collection -- Deduction and Decision Procedures. Deduction and Decision Procedures 2007
- [c36]Byron Cook: Bringing Hardware and Software Closer Together with Termination Analysis. MEMOCODE 2007: 201
- [c35]Alexey Gotsman, Josh Berdine, Byron Cook, Mooly Sagiv: Thread-modular shape analysis. PLDI 2007: 266-277
- [c34]
- [c33]Josh Berdine, Aziem Chawdhary, Byron Cook, Dino Distefano, Peter W. O'Hearn: Variance analyses from invariance analyses. POPL 2007: 211-224
- [c32]Byron Cook, Alexey Gotsman, Andreas Podelski, Andrey Rybalchenko, Moshe Y. Vardi: Proving that programs eventually do something good. POPL 2007: 265-276
- [c31]Stephen Magill, Josh Berdine, Edmund M. Clarke, Byron Cook: Arithmetic Strengthening for Shape Analysis. SAS 2007: 419-436
- [c30]Domagoj Babic, Alan J. Hu, Zvonimir Rakamaric, Byron Cook: Proving Termination by Divergence. SEFM 2007: 93-102
- [c29]
- [c28]Roman Manevich, Josh Berdine, Byron Cook, G. Ramalingam, Mooly Sagiv: Shape Analysis by Graph Decomposition. TACAS 2007: 3-18
- [e2]Franz Baader, Byron Cook, Jürgen Giesl, Robert Nieuwenhuis (Eds.): Deduction and Decision Procedures, 30.09. - 05.10.2007. Dagstuhl Seminar Proceedings 07401, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007
- [e1]Byron Cook, Andreas Podelski (Eds.): Verification, Model Checking, and Abstract Interpretation, 8th International Conference, VMCAI 2007, Nice, France, January 14-16, 2007, Proceedings. Lecture Notes in Computer Science 4349, Springer 2007, ISBN 978-3-540-69735-0
- 2006
- [j4]Byron Cook, Scott D. Stoller, Willem Visser: Preface. Electr. Notes Theor. Comput. Sci. 144(3): 1-2 (2006)
- [c27]Andreas Griesmayer, Roderick Bloem, Byron Cook: Repair of Boolean Programs with an Application to C. CAV 2006: 358-371
- [c26]Josh Berdine, Byron Cook, Dino Distefano, Peter W. O'Hearn: Automatic Termination Proofs for Programs with Shape-Shifting Heaps. CAV 2006: 386-400
- [c25]
- [c24]Thomas Ball, Ella Bounimova, Byron Cook, Vladimir Levin, Jakob Lichtenberg, Con McGarvey, Bohus Ondrusek, Sriram K. Rajamani, Abdullah Ustuner: Thorough static analysis of device drivers. EuroSys 2006: 73-85
- [c23]Byron Cook, Daniel Kroening, Natasha Sharygina: Over-Approximating Boolean Programs with Unbounded Thread Creation. FMCAD 2006: 53-59
- [c22]Byron Cook, Andreas Podelski, Andrey Rybalchenko: Termination proofs for systems code. PLDI 2006: 415-426
- [c21]Alexey Gotsman, Josh Berdine, Byron Cook: Interprocedural Shape Analysis with Separated Heap Abstractions. SAS 2006: 240-260
- [i1]Shuvendu K. Lahiri, Thomas Ball, Byron Cook: Predicate Abstraction via Symbolic Decision Procedures. CoRR abs/cs/0612003 (2006)
- 2005
- [c20]Byron Cook: Finding Bugs in Device Drivers with Static Driver Verifier. Abstract State Machines 2005: 71
- [c19]Shuvendu K. Lahiri, Thomas Ball, Byron Cook: Predicate Abstraction via Symbolic Decision Procedures. CAV 2005: 24-38
- [c18]Byron Cook, Daniel Kroening, Natasha Sharygina: Cogent: Accurate Theorem Proving for Program Verification. CAV 2005: 296-300
- [c17]Byron Cook, Georges Gonthier: Using Stålmarck's Algorithm to Prove Inequalities. ICFEM 2005: 330-344
- [c16]Byron Cook, Andreas Podelski, Andrey Rybalchenko: Abstraction Refinement for Termination. SAS 2005: 87-101
- [c15]Byron Cook, Daniel Kroening, Natasha Sharygina: Symbolic Model Checking for Asynchronous Boolean Programs. SPIN 2005: 75-90
- 2004
- [c14]Thomas Ball, Byron Cook, Shuvendu K. Lahiri, Lintao Zhang: Zapato: Automatic Theorem Proving for Predicate Abstraction Refinement. CAV 2004: 457-461
- [c13]Thomas Ball, Byron Cook, Vladimir Levin, Sriram K. Rajamani: SLAM and Static Driver Verifier: Technology Transfer of Formal Methods inside Microsoft. IFM 2004: 1-20
- [c12]Byron Cook: Finding API usage rule violations in Windows device drivers using Static Driver Verifier. ISoLA (Preliminary proceedings) 2004: 18-18
- [c11]Byron Cook, Daniel Kroening, Natasha Sharygina: Accurate Theorem Proving for Program Verification. ISoLA 2004: 96-114
- [c10]Thomas Ball, Byron Cook, Satyaki Das, Sriram K. Rajamani: Refining Approximations in Software Predicate Abstraction. TACAS 2004: 388-403
- 2003
- [j3]Byron Cook, Scott D. Stoller, Willem Visser: SoftMC 2003: Workshop on Software Model Checking. Electr. Notes Theor. Comput. Sci. 89(3): 377 (2003)
- [j2]Mark Aagaard, Byron Cook, Nancy A. Day, Robert B. Jones: A framework for superscalar microprocessor correctness statements. STTT 4(3): 298-312 (2003)
- [j1]Gunnar Andersson, Per Bjesse, Byron Cook, Ziyad Hanna: Design automation with mixtures of proof strategies for propositional logic. IEEE Trans. on CAD of Integrated Circuits and Systems 22(8): 1042-1048 (2003)
- [c9]Shuvendu K. Lahiri, Randal E. Bryant, Byron Cook: A Symbolic Approach to Predicate Abstraction. CAV 2003: 141-153
- 2002
- [c8]Gunnar Andersson, Per Bjesse, Byron Cook, Ziyad Hanna: A proof engine approach to solving combinational design automation problems. DAC 2002: 725-730
- 2001
- [c7]Mark Aagaard, Byron Cook, Nancy A. Day, Robert B. Jones: A Framework for Microprocessor Correctness Statements. CHARME 2001: 433-448
- 2000
- [c6]Nancy A. Day, Mark Aagaard, Byron Cook: Combining Stream-Based and State-Based Verification Techniques. FMCAD 2000: 126-142
1990 – 1999
- 1999
- [c5]Byron Cook, John Launchbury, John Matthews, Richard B. Kieburtz: Formal Verification of Explicitly Parallel Microprocessors. CHARME 1999: 23-36
- [c4]Nancy A. Day, Jeffrey R. Lewis, Byron Cook: Symbolic Simulation of Microprocessor Models using Type Classes in Haskell. CHARME 1999: 346-349
- [c3]John Launchbury, Jeffrey R. Lewis, Byron Cook: On Embedding a Microarchitectural Design Language within Haskell. ICFP 1999: 60-69
- 1998
- [c2]
- 1997
- [c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 10:57 CEST by the dblp team