Randal Bryant

Last updated
Randal Bryant
Randal Bryant FLoC 2006.jpg
Bryant in 2006
Born (1952-10-27) October 27, 1952 (age 71)
United States
Alma mater University of Michigan
Known forBinary Decision Diagrams (BDDs), formal hardware and software verification
Awards Paris Kanellakis Theory and Practice Award
Phil Kaufman Award
Scientific career
FieldsHardware, system software, networking
Institutions School of Computer Science, Carnegie Mellon University

Randal E. Bryant (born October 27, 1952) is an American computer scientist and academic noted for his research on formally verifying digital hardware and software. Bryant has been a faculty member at Carnegie Mellon University since 1984. He served as the Dean of the School of Computer Science (SCS) at Carnegie Mellon from 2004 to 2014. Dr. Bryant retired and became a Founders University Professor Emeritus on June 30, 2020.

Contents

Bryant has received many recognitions for his research on hardware and software verification as well as algorithms and computer architecture. His 1986 paper on symbolic Boolean manipulation using Ordered Binary Decision Diagrams (BDDs) has the highest citation count of any publication in the Citeseer database of computer science literature. [1] In 2009 Bryant was awarded the Phil Kaufman Award by the EDA Consortium "for his seminal technological breakthroughs in the area of formal verification."

Early life and education

Bryant was born on October 27, 1952, and is the son of John H. Bryant and Barbara Everitt Bryant, and the grandson of William Littell Everitt, former dean of the electrical engineering department at the University of Illinois at Urbana–Champaign (1949–68). His sister is Lois Bryant, a textile artist. Bryant was raised in Birmingham, Michigan. Starting in 1970, he attended the University of Michigan, where he received his B.S. in applied mathematics from in 1973. His master thesis on Simulation of Packet Communication Architecture Computer Systems, published in 1977, is known to be one of the first publications on distributed simulation. [2] He received his PhD from the Massachusetts Institute of Technology in 1981. [3]

Career

Research and publications

Awards and honors

Related Research Articles

In computer engineering, a hardware description language (HDL) is a specialized computer language used to describe the structure and behavior of electronic circuits, most commonly to design ASICs and program FPGAs.

Computer science is the study of the theoretical foundations of information and computation and their implementation and application in computer systems. One well known subject classification system for computer science is the ACM Computing Classification System devised by the Association for Computing Machinery.

<span class="mw-page-title-main">Carnegie Mellon School of Computer Science</span> School for computer science in the United States

The School of Computer Science (SCS) at Carnegie Mellon University in Pittsburgh, Pennsylvania, US is a school for computer science established in 1988. It has been consistently ranked among the top computer science programs over the decades. As of 2022 U.S. News & World Report ranks the graduate program as tied for second with Stanford University and University of California, Berkeley. It is ranked second in the United States on Computer Science Open Rankings, which combines scores from multiple independent rankings.

<span class="mw-page-title-main">Model checking</span> Computer science field

In computer science, model checking or property checking is a method for checking whether a finite-state model of a system meets a given specification. This is typically associated with hardware or software systems, where the specification contains liveness requirements as well as safety requirements.

In computer science, a binary decision diagram (BDD) or branching program is a data structure that is used to represent a Boolean function. On a more abstract level, BDDs can be considered as a compressed representation of sets or relations. Unlike other compressed representations, operations are performed directly on the compressed representation, i.e. without decompression.

Formal equivalence checking process is a part of electronic design automation (EDA), commonly used during the development of digital integrated circuits, to formally prove that two representations of a circuit design exhibit exactly the same behavior.

Hsiang-Tsung Kung is a Taiwanese-born American computer scientist. He is the William H. Gates professor of computer science at Harvard University. His early research in parallel computing produced the systolic array in 1979, which has since become a core computational component of hardware accelerators for artificial intelligence, including Google's Tensor Processing Unit (TPU). Similarly, he proposed optimistic concurrency control in 1981, now a key principle in memory and database transaction systems, including MySQL, Apache CouchDB, Google's App Engine, and Ruby on Rails. He remains an active researcher, with ongoing contributions to computational complexity theory, hardware design, parallel computing, routing, wireless communication, signal processing, and artificial intelligence.

<span class="mw-page-title-main">Charles E. Leiserson</span> American computer scientist

Charles Eric Leiserson is a computer scientist and professor at Massachusetts Institute of Technology (M.I.T.). He specializes in the theory of parallel computing and distributed computing.

<span class="mw-page-title-main">And-inverter graph</span> Graph representing an implementation of the logical functionality of a network

An and-inverter graph (AIG) is a directed, acyclic graph that represents a structural implementation of the logical functionality of a circuit or network. An AIG consists of two-input nodes representing logical conjunction, terminal nodes labeled with variable names, and edges optionally containing markers indicating logical negation. This representation of a logic function is rarely structurally efficient for large circuits, but is an efficient representation for manipulation of boolean functions. Typically, the abstract graph is represented as a data structure in software.

<span class="mw-page-title-main">Edmund M. Clarke</span> American computer scientist (1945–2020)

Edmund Melson Clarke, Jr. was an American computer scientist and academic noted for developing model checking, a method for formally verifying hardware and software designs. He was the FORE Systems Professor of Computer Science at Carnegie Mellon University. Clarke, along with E. Allen Emerson and Joseph Sifakis, received the 2007 ACM Turing Award.

<span class="mw-page-title-main">E. Allen Emerson</span> American computer scientist

Ernest Allen Emerson II, better known as E. Allen Emerson, is an American computer scientist and winner of the 2007 Turing Award. He is Professor and Regents Chair Emeritus at the University of Texas at Austin, United States.

Krishna V. Palem is a computer scientist and engineer of Indian origin and is the Kenneth and Audrey Kennedy Professor of Computing at Rice University and the director of Institute for Sustainable Nanoelectronics (ISNE) at Nanyang Technological University (NTU). He is recognized for his "pioneering contributions to the algorithmic, compilation, and architectural foundations of embedded computing", as stated in the citation of his 2009 Wallace McDowell Award, the "highest technical award made solely by the IEEE Computer Society".

<span class="mw-page-title-main">Pradeep Khosla</span> 8th Chancellor of UC San Diego

Pradeep Kumar Khosla is an Indian-American computer scientist and university administrator. He is the current chancellor of the University of California, San Diego.

<span class="mw-page-title-main">Rob A. Rutenbar</span> American academic

Rob A. Rutenbar is an American academic noted for contributions to software tools that automate analog integrated circuit design, and custom hardware platforms for high-performance automatic speech recognition. He is Senior Vice Chancellor for Research at the University of Pittsburgh, where he leads the university's strategic and operational vision for research and innovation.

Helmut Veith was an Austrian computer scientist who worked on the areas of computer-aided verification, software engineering, computer security, and logic in computer science. He was a Professor of Informatics at the Vienna University of Technology, Austria.

Daniel Kroening is a German computer scientist, Professor in computer science at the University of Oxford, and Chief Science Officer at the company he co-founded, Diffblue Ltd. He is a fellow of Magdalen College.

David Lansing Dill is a computer scientist and academic noted for contributions to formal verification, electronic voting security, and computational systems biology.

Lawrence Pileggi is the Coraluppi Head and Tanoto Professor of Electrical and Computer Engineering at Carnegie Mellon University. He is a specialist in the automation of integrated circuits, and developing software tools for the optimization of power grids. Pileggi's research has been cited thousands of times in engineering papers.

<span class="mw-page-title-main">Kenneth L. McMillan</span> American computer scientist

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.

Karem Sakallah is an American electrical engineer and computer scientist, a professor at University of Michigan known for his work on computational logic, functional verification, SAT solvers, satisfiability modulo theories, and the Graph automorphism problem. He was elevated to the rank of IEEE Fellow in 1998. In 2009, he shared the CAV award with eight other individuals "for major advances in creating high-performance Boolean satisfiability solvers." In 2012, Sakallah became an ACM Fellow "for algorithms for Boolean Satisfiability that advanced the state-of-the-art of hardware verification."

References

  1. 1 2 "Most cited source documents". Citeseer . September 2006. Retrieved March 5, 2007.
  2. 1 2 "Bryant's home". www.cs.cmu.edu. Retrieved 2018-02-01.
  3. 1 2 "Randal Bryant - Education and Publications".
  4. University, Carnegie Mellon. "Press Release: Former Carnegie Mellon Computer Science Dean Now Assisting in White House Policy Office - News - Carnegie Mellon University" . Retrieved 2018-02-01.
  5. "Infosys Prize - Jury 2013". Infosys Science Foundation. Retrieved 1 March 2021.
  6. Bryant, R. E. (August 1986). "Graph-Based Algorithms for Boolean Function Manipulation". IEEE Transactions on Computers. C-35 (8): 677–691. arXiv: cs/0508044 . doi:10.1109/TC.1986.1676819. ISSN   0018-9340. S2CID   10385726.
  7. Bryant, Randal E. (1992-09-01). "Symbolic Boolean manipulation with ordered binary-decision diagrams" (PDF). ACM Computing Surveys. 24 (3): 293–318. doi:10.1145/136035.136043. ISSN   0360-0300. S2CID   1933530.
  8. Seger, Carl-Johan H.; Bryant, Randal E. (1995-03-01). "Formal verification by symbolic evaluation of partially-ordered trajectories". Formal Methods in System Design. 6 (2): 147–189. doi:10.1007/BF01383966. ISSN   0925-9856. S2CID   14804600.
  9. University, Carnegie Mellon. "Randal Bryant - Institute for Software Research - Carnegie Mellon University". www.isri.cmu.edu. Retrieved 2018-02-01.
  10. "IEEE Emanuel R. Piore Award Recipients" (PDF). IEEE. Archived from the original (PDF) on November 24, 2010. Retrieved March 20, 2021.
  11. "ACM/IEEE A. Richard Newton Technical Impact Award in Electronic Design Automation". SIGDA. Retrieved 2 February 2018.