H-Index & Metrics Best Publications

H-Index & Metrics

Discipline name H-index Citations Publications World Ranking National Ranking
Computer Science D-index 56 Citations 27,125 114 World Ranking 2043 National Ranking 1116

Research.com Recognitions

Awards & Achievements

1998 - ACM Paris Kanellakis Theory and Practice Award Symbolic Model Checking

Overview

What is he best known for?

The fields of study he is best known for:

  • Programming language
  • Algorithm
  • Algebra

Kenneth L. McMillan mainly focuses on Model checking, Theoretical computer science, Algorithm, Symbolic trajectory evaluation and Programming language. His research integrates issues of Temporal logic, Sequential logic, Binary decision diagram, Abstract interpretation and True quantified Boolean formula in his study of Model checking. Kenneth L. McMillan regularly links together related areas like Speedup in his Theoretical computer science studies.

His study in the fields of State, Linear temporal logic and Boolean function under the domain of Algorithm overlaps with other disciplines such as Hadamard transform. His work investigates the relationship between Symbolic trajectory evaluation and topics such as Abstraction model checking that intersect with problems in Unsatisfiable core. Kenneth L. McMillan interconnects Formal methods and Functional verification in the investigation of issues within Formal specification.

His most cited work include:

  • Symbolic Model Checking (2922 citations)
  • Symbolic model checking: 10/sup 20/ states and beyond (2502 citations)
  • Symbolic model checking: an approach to the state explosion problem (963 citations)

What are the main themes of his work throughout his whole career to date?

Kenneth L. McMillan focuses on Model checking, Theoretical computer science, Algorithm, Programming language and Mathematical proof. His Model checking research includes elements of Abstract interpretation, Binary decision diagram and Temporal logic. His work deals with themes such as Solver and Counterexample, which intersect with Theoretical computer science.

Kenneth L. McMillan has included themes like Invariant and Set in his Algorithm study. The study incorporates disciplines such as Liveness, Automated theorem proving, Correctness and Satisfiability modulo theories in addition to Mathematical proof. His study explores the link between Formal verification and topics such as Formal specification that cross with problems in Formal methods.

He most often published in these fields:

  • Model checking (54.42%)
  • Theoretical computer science (48.30%)
  • Algorithm (32.65%)

What were the highlights of his more recent work (between 2013-2020)?

  • Programming language (29.25%)
  • Model checking (54.42%)
  • Theoretical computer science (48.30%)

In recent papers he was focusing on the following fields of study:

His scientific interests lie mostly in Programming language, Model checking, Theoretical computer science, Formal specification and Horn clause. His Programming language study frequently links to adjacent areas such as Decidability. His studies deal with areas such as Abstract interpretation, Automated theorem proving and Executable as well as Model checking.

Kenneth L. McMillan conducts interdisciplinary study in the fields of Theoretical computer science and Generalization through his works. The Formal specification study combines topics in areas such as QUIC and Heartbleed. Kenneth L. McMillan combines subjects such as Heap, Quantifier elimination and Time complexity with his study of Horn clause.

Between 2013 and 2020, his most popular works were:

  • Horn Clause Solvers for Program Verification (122 citations)
  • Ivy: safety verification by interactive generalization (78 citations)
  • Lazy Annotation Revisited (31 citations)

In his most recent research, the most cited papers focused on:

  • Programming language
  • Algorithm
  • Algebra

His primary areas of investigation include Model checking, Theoretical computer science, Programming language, Horn clause and Paxos. As a member of one scientific family, Kenneth L. McMillan mostly works in the field of Model checking, focusing on Automated theorem proving and, on occasion, SLD resolution and Unit propagation. His research ties Counterexample and Theoretical computer science together.

His work in the fields of Programming language, such as Formal verification, intersects with other areas such as Automation and Key. His Horn clause research includes themes of Heap, Projection, Time complexity and Value. His study in Paxos is interdisciplinary in nature, drawing from both Modularity, Modular design, Decidability and Formal specification.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Best Publications

Symbolic Model Checking

Edmund M. Clarke;Kenneth L. McMillan;Sérgio Vale Aguiar Campos;Vassili Hartonas-Garmhausen.
(1993)

5715 Citations

Symbolic model checking: 10/sup 20/ states and beyond

J.R. Burch;E.M. Clarke;K.L. McMillan;D.L. Dill.
logic in computer science (1990)

4132 Citations

Symbolic model checking: an approach to the state explosion problem

Kenneth Lauchlin McMillan.
Ph. D. Thesis, Carnegie Mellon University (1992)

1542 Citations

Interpolation and SAT-Based Model Checking

Kenneth L. McMillan.
computer aided verification (2003)

1049 Citations

Symbolic model checking for sequential circuit verification

J.R. Burch;E.M. Clarke;D.E. Long;K.L. McMillan.
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems (1994)

830 Citations

Sequential circuit verification using symbolic model checking

J. R. Burch;E. M. Clarke;K. L. McMillan;David L. Dill.
design automation conference (1990)

684 Citations

Abstractions from proofs

Thomas A. Henzinger;Ranjit Jhala;Rupak Majumdar;Kenneth L. McMillan.
symposium on principles of programming languages (2004)

635 Citations

Compositional model checking

E.M. Clarke;D.E. Long;K.L. McMillan.
logic in computer science (1989)

634 Citations

Using Unfoldings to Avoid the State Explosion Problem in the Verification of Asynchronous Circuits

Kenneth L. McMillan.
computer aided verification (1992)

592 Citations

Lazy abstraction with interpolants

Kenneth L. Mcmillan.
Lecture Notes in Computer Science (2006)

559 Citations

If you think any of the details on this page are incorrect, let us know.

Contact us

Best Scientists Citing Kenneth L. McMillan

Edmund M. Clarke

Edmund M. Clarke

Carnegie Mellon University

Publications: 130

Moshe Y. Vardi

Moshe Y. Vardi

Rice University

Publications: 111

Daniel Kroening

Daniel Kroening

Amazon (United States)

Publications: 95

Thomas A. Henzinger

Thomas A. Henzinger

Institute of Science and Technology Austria

Publications: 83

Tsutomu Sasao

Tsutomu Sasao

Meiji University

Publications: 76

Fabio Somenzi

Fabio Somenzi

University of Colorado Boulder

Publications: 74

Alessandro Cimatti

Alessandro Cimatti

Fondazione Bruno Kessler

Publications: 73

Orna Grumberg

Orna Grumberg

Technion – Israel Institute of Technology

Publications: 71

Rolf Drechsler

Rolf Drechsler

University of Bremen

Publications: 69

Alberto Sangiovanni-Vincentelli

Alberto Sangiovanni-Vincentelli

University of California, Berkeley

Publications: 67

Rajeev Alur

Rajeev Alur

University of Pennsylvania

Publications: 65

Aarti Gupta

Aarti Gupta

Princeton University

Publications: 63

Randal E. Bryant

Randal E. Bryant

Carnegie Mellon University

Publications: 63

David L. Dill

David L. Dill

Stanford University

Publications: 56

Orna Kupferman

Orna Kupferman

Hebrew University of Jerusalem

Publications: 56

Jordi Cortadella

Jordi Cortadella

Universitat Politècnica de Catalunya

Publications: 56

Something went wrong. Please try again later.