What is he best known for?
The fields of study he is best known for:
- 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.
His most cited work include:
- 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)
What are the main themes of his work throughout his whole career to date?
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.
He most often published in these fields:
- Theoretical computer science (26.51%)
- Formal verification (22.09%)
- Algorithm (21.69%)
What were the highlights of his more recent work (between 2013-2021)?
- Computational biology (7.23%)
- Genetics (7.63%)
- Artificial neural network (3.61%)
In recent papers he was focusing on the following fields of study:
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.
Between 2013 and 2021, his most popular works were:
- 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)
In his most recent research, the most cited papers focused on:
- 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.
