- Home
- Top Scientists - Computer Science
- David L. Dill

Discipline name
H-index
Citations
Publications
World Ranking
National Ranking

Computer Science
H-index
69
Citations
37,858
166
World Ranking
877
National Ranking
527

2013 - Fellow of the American Academy of Arts and Sciences

2013 - Member of the National Academy of Engineering For the development of techniques to verify hardware, software, and electronic voting systems.

2005 - ACM Fellow For contributions to system verification and for leadership in the development of verifiable voting systems.

1932 - Fellow of the American Association for the Advancement of Science (AAAS)

- Programming language
- Algorithm
- Gene

His primary areas of study are Theoretical computer science, Algorithm, Model checking, Programming language and Temporal logic. His Theoretical computer science study integrates concerns from other disciplines, such as Simple and Heuristics. The study incorporates disciplines such as Solver and Symbolic execution in addition to Algorithm.

His study in Model checking is interdisciplinary in nature, drawing from both Finite-state machine, State space and State. The various areas that he examines in his Temporal logic study include Time domain, Undecidable problem, Correctness and Specification language. His work in Automaton covers topics such as Formal language which are related to areas like Deterministic automaton, Hybrid automaton, Nondeterministic finite automaton, Nondeterministic finite automaton with ε-moves and Mobile automaton.

- A theory of timed automata (5832 citations)
- Symbolic model checking: 10/sup 20/ states and beyond (2502 citations)
- Automata for modeling real-time systems (861 citations)

David L. Dill mainly focuses on Theoretical computer science, Formal verification, Algorithm, Programming language and Model checking. Theoretical computer science and State are commonly linked in his work. His work in Formal verification addresses issues such as Correctness, which are connected to fields such as Protocol.

His biological study spans a wide range of topics, including Solver, Set and Temporal logic. His Temporal logic research is mostly focused on the topic Computation tree logic. His Model checking study combines topics in areas such as State space and Binary decision diagram.

- Theoretical computer science (26.51%)
- Formal verification (22.09%)
- Algorithm (21.69%)

- Computational biology (7.23%)
- Genetics (7.63%)
- Artificial neural network (3.61%)

Computational biology, Genetics, Artificial neural network, Cancer research and Cancer are his primary areas of study. His Computational biology research incorporates themes from Genome, Genetic variation, Haplotype and Bioinformatics. His work on Gene, Mutation, Caulobacter crescentus and Gene expression profiling as part of general Genetics study is frequently linked to Pantetheinase, bridging the gap between disciplines.

His research integrates issues of Complex system, Theoretical computer science and Robustness in his study of Artificial neural network. David L. Dill has included themes like Message passing and Vertex cover in his Theoretical computer science study. His studies deal with areas such as Simple and Myeloid leukemia as well as Cancer.

- Reluplex: An Efficient SMT Solver for Verifying Deep Neural Networks (757 citations)
- Automated identification of stratifying signatures in cellular subpopulations (286 citations)
- MYC through miR-17-92 suppresses specific target genes to maintain survival, autonomous proliferation, and a neoplastic state. (110 citations)

- Programming language
- Algorithm
- Gene

His primary areas of study are Artificial neural network, Robustness, Adversarial system, Theoretical computer science and Deep neural networks. His Artificial neural network research is multidisciplinary, relying on both Complex system, Scalability and Boolean satisfiability problem. David L. Dill has researched Complex system in several fields, including Software, Correctness, Distributed computing and Rendering.

His work focuses on many connections between Adversarial system and other disciplines, such as Formal verification, that overlap with his field of interest in Key, Ground truth and Computer security. David L. Dill usually deals with Theoretical computer science and limits it to topics linked to Message passing and Satisfiability. His Deep neural networks research is multidisciplinary, incorporating elements of Activation function, Computer engineering, Simplex algorithm and Satisfiability modulo theories.

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.

A theory of timed automata

Rajeev Alur;David L. Dill.

Theoretical Computer Science **(1994)**

8881 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

Automata for modeling real-time systems

Rajeev Alur;David L. Dill.

international colloquium on automata, languages and programming **(1990)**

1526 Citations

EXE: Automatically Generating Inputs of Death

Cristian Cadar;Vijay Ganesh;Peter M. Pawlowski;David L. Dill.

ACM Transactions on Information and System Security **(2008)**

1452 Citations

Model-checking for real-time systems

R. Alur;C. Courcoubetis;D. Dill.

logic in computer science **(1990)**

1323 Citations

Model-Checking in Dense Real-Time

R. Alur;C. Courcoubetis;D. Dill.

logic in computer science **(1993)**

1297 Citations

Timing assumptions and verification of finite-state concurrent systems

David L. Dill.

computer aided verification **(1989)**

1057 Citations

Reluplex: An Efficient SMT Solver for Verifying Deep Neural Networks

Guy Katz;Clark W. Barrett;David L. Dill;Kyle Julian.

computer aided verification **(2017)**

841 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

Trace Theory for Automatic Hierarchical Verification of Speed-Independent Circuits

David L. Dill.

**(1989)**

801 Citations

Profile was last updated on December 6th, 2021.

Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).

The ranking h-index is inferred from publications deemed to belong to the considered discipline.

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

Contact us

Stanford University

Stanford University

Columbia University

Stanford University

University of Pennsylvania

Chinese University of Hong Kong, Shenzhen

Stanford University

Stanford University

Stanford University

Carnegie Mellon University

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Something went wrong. Please try again later.