What is he best known for?
The fields of study he is best known for:
- Programming language
- Algorithm
- Operating system
His primary areas of investigation include Algorithm, Model checking, Programming language, Partial order reduction and Theoretical computer science.
His Algorithm research incorporates themes from State space and Temporal logic.
His research integrates issues of PSPACE, Black box, Artificial intelligence, White-box testing and Machine learning in his study of Model checking.
His work on Decision problem and Correctness as part of general Programming language study is frequently connected to Engineering design process, therefore bridging the gap between diverse disciplines of science and establishing a new relationship between them.
His Partial order reduction research is multidisciplinary, relying on both Depth-first search, Search algorithm, Breadth-first search, Systems design and Formal verification.
His research in Theoretical computer science focuses on subjects like Formal methods, which are connected to Formal specification, Functional verification and Automated theorem proving.
His most cited work include:
- Simple on-the-fly automatic verification of linear temporal logic (630 citations)
- All from One, One for All: on Model Checking Using Representatives (483 citations)
- Combining Partial Order Reductions with On-the-fly Model-Checking (235 citations)
What are the main themes of his work throughout his whole career to date?
Doron Peled mainly investigates Model checking, Theoretical computer science, Algorithm, Programming language and Linear temporal logic.
The various areas that Doron Peled examines in his Model checking study include Formal verification, Genetic programming and Concurrency.
The study incorporates disciplines such as Sequence and Correctness in addition to Theoretical computer science.
His Algorithm research is multidisciplinary, incorporating elements of Structure, Graph and State space.
His Programming language research integrates issues from Communications protocol and Notation.
His Linear temporal logic research incorporates elements of Discrete mathematics, Equivalence class and Equivalence relation.
He most often published in these fields:
- Model checking (40.87%)
- Theoretical computer science (38.70%)
- Algorithm (27.83%)
What were the highlights of his more recent work (between 2012-2020)?
- Theoretical computer science (38.70%)
- Runtime verification (7.39%)
- Model checking (40.87%)
In recent papers he was focusing on the following fields of study:
Doron Peled spends much of his time researching Theoretical computer science, Runtime verification, Model checking, Programming language and Genetic programming.
His Runtime verification research is multidisciplinary, incorporating elements of Property, Carry, Temporal logic and Linear temporal logic.
His Temporal logic research is multidisciplinary, relying on both Measure, Representation, Algorithm, Binary decision diagram and Sequence.
He has researched Algorithm in several fields, including Collapse and State space.
His work in Linear temporal logic addresses subjects such as Adjacency list, which are connected to disciplines such as Automaton.
His research investigates the link between Model checking and topics such as Software that cross with problems in Dependability.
Between 2012 and 2020, his most popular works were:
- First order temporal logic monitoring with BDDs (35 citations)
- Using Statistical Model Checking for Measuring Systems (19 citations)
- Runtime Verification: From Propositional to First-Order Temporal Logic (12 citations)
In his most recent research, the most cited papers focused on:
- Programming language
- Algorithm
- Operating system
Doron Peled mostly deals with Theoretical computer science, Runtime verification, Model checking, Temporal logic and Genetic programming.
In his work, Dual, Correctness and Liveness is strongly intertwined with Property, which is a subfield of Theoretical computer science.
In his works, Doron Peled performs multidisciplinary study on Model checking and Psychological resilience.
Doron Peled interconnects Measure and Algorithm in the investigation of issues within Temporal logic.
His study in Online algorithm and Linear temporal logic is done as part of Algorithm.
The Genetic programming study combines topics in areas such as Programming language, Automated theorem proving, Heuristics and Heuristic.
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.
