Kenneth L. McMillan is an American computer scientist working in the area of formal methods, logic, and programming languages. He is a professor in the computer science department at the University of Texas at Austin, where he holds the Admiral B.R. Inman Centennial Chair in Computing Theory.[1]
Career
McMillan received his Ph.D. from Carnegie Mellon University in 1992, under Edmund M. Clarke.[2] He is credited to have invented symbolic model checking during his thesis work, which won him the 1992 ACM Doctoral Dissertation Award, the highest doctoral dissertation prize awarded by the Association for Computing Machinery (ACM).[3] He also won the 1998 ACM Paris Kanellakis Award for Theory and Practice jointly with Randal Bryant, Edmund Clarke, and E. Allen Emerson for work on symbolic model checking.[4] McMillan subsequently worked at Bell Labs, Cadence Berkeley Labs, and was a Principal Researcher at Microsoft Research, Redmond[5] before joining the faculty of University of Texas at Austin in 2021.[6]
Research
McMillan pioneered several influential research areas in formal methods. His initial work on symbolic model checking based on binary decision diagrams culminated in the creation of the SMV/nuSMV family of model checkers.[7] He also pioneered techniques based on Craig interpolation in model checking infinite-state systems.[8] He is also known for his work on Constrained Horn Clause (CHC) solving[9] and the IVy distributed system verification tool.[10]
Awards
- 2014 - POPL Most Influential Paper Award[11]
- 2010 - LICS Test of Time Award[12]
- 1998 - CMU Allen Newell Medal[13]
- 1998 - CAV Award[14]
- 1998 - ACM Paris Kanellakis Award
- 1996 - SRC Technical Excellence Award[15]
- 1992 - ACM Doctoral Dissertation Award
Service
McMillan currently serves on the steering committee of the International Conference on Computer-Aided Verification (CAV).[16]
References
- ^ "Ken McMillan | Department of Computer Science". Computer Science, University of Texas at Austin: Faculty and Researchers.
- ^ "Kenneth McMillan - The Mathematics Genealogy Project". The Mathematics Genealogy Project. American Mathematical Society (AMS). Retrieved June 21, 2023.
- ^ "Kenneth McMillan - ACM Awards". awards.acm.org. Association for Computing Machinery. Retrieved June 21, 2023.
- ^ "Kenneth L. McMillan - ACM Awards". awards.acm.org. Association for Computing Machinery (ACM) - Paris Kanellakis Award. Retrieved June 21, 2023.
- ^ "WayBackMachine - Kenneth McMillan at Microsoft Research". Microsoft. Archived from the original on 2019-03-26. Retrieved March 26, 2019.
- ^ Twitter https://twitter.com/UTCompSci/status/1365040812359176193?lang=en. Retrieved June 21, 2023.
{{cite web}}
: Missing or empty|title=
(help) - ^ "SMV Model Checker Free Download". SMV Model Checker Free Download. Retrieved June 21, 2023.
- ^ McMillan, K. L. (2006). "Lazy Abstraction with Interpolants". Computer Aided Verification. Lecture Notes in Computer Science. Vol. 4144. pp. 123–136. doi:10.1007/11817963_14. ISBN 978-3-540-37406-0.
{{cite book}}
:|journal=
ignored (help) - ^ Bjorner, Nikolaj; Gurfinkel, Arie; McMillan, Ken; Rybalchenko, Andrey (2015). "Horn Clause Solvers for Program Verification". Horn Clause Solvers for Software Verification. Lecture Notes in Computer Science. Vol. II. pp. 24–51. doi:10.1007/978-3-319-23534-9_2. ISBN 978-3-319-23534-9.
{{cite book}}
:|journal=
ignored (help) - ^ Padon, Oded; McMillan, Kenneth; Aurojit, Panda; Mooly, Sagiv; Sharon, Shoham (2016). "Ivy: Safety verification by interactive generalization". ACM SIGPLAN Notices. 51 (6): 614–630. doi:10.1145/2980983.2908118.
- ^ "Most Influential POPL Paper Award". ACM SIGPLAN.
- ^ "LICS - Archive".
- ^ "The CMU Allen Newell Award for Research Excellence - Past Winners". Carnegie Mellon University. Retrieved June 21, 2023.
- ^ "CAV Award". International Conference on Computer Aided Verification.
- ^ "Technical Excellence Award - SRC". Semiconductor Research Corporation. Retrieved June 21, 2023.
- ^ "International Conference on Computer Aided Verification". i-cav.org. Retrieved June 21, 2023.