What is she best known for?
The fields of study she is best known for:
- Programming language
- Algorithm
- Algebra
Her primary scientific interests are in Theoretical computer science, Model checking, Temporal logic, Automaton and Discrete mathematics.
The Theoretical computer science study combines topics in areas such as Time complexity, Algorithm and Computation.
Her Model checking research is multidisciplinary, incorporating elements of Linear temporal logic, Correctness and Extension.
Within one scientific family, she focuses on topics pertaining to Game theory under Temporal logic, and may sometimes address concerns connected to Rational agent and Mathematical optimization.
Orna Kupferman has included themes like Tree, Realizability, Decision problem and Process in her Automaton study.
Her work carried out in the field of Discrete mathematics brings together such families of science as ω-automaton, Quantum finite automata, Automata theory, Combinatorics and Algebra.
Her most cited work include:
- Alternating-time temporal logic (1278 citations)
- An automata-theoretic approach to branching-time model checking (582 citations)
- Model Checking of Safety Properties (453 citations)
What are the main themes of her work throughout her whole career to date?
Her main research concerns Theoretical computer science, Discrete mathematics, Automaton, Model checking and Temporal logic.
Her work deals with themes such as Set and State, which intersect with Theoretical computer science.
Her Discrete mathematics research is multidisciplinary, relying on both ω-automaton, Deterministic automaton, Büchi automaton and Combinatorics.
Her Automaton study combines topics from a wide range of disciplines, such as Time complexity, Word, Undecidable problem, Simple and Finite-state machine.
Her Model checking research incorporates themes from Linear temporal logic, Correctness and Tree automaton.
Orna Kupferman combines subjects such as Satisfiability, Concurrency and Fragment with her study of Temporal logic.
She most often published in these fields:
- Theoretical computer science (40.74%)
- Discrete mathematics (37.41%)
- Automaton (32.22%)
What were the highlights of her more recent work (between 2015-2021)?
- Automaton (32.22%)
- Theoretical computer science (40.74%)
- Discrete mathematics (37.41%)
In recent papers she was focusing on the following fields of study:
Automaton, Theoretical computer science, Discrete mathematics, Mathematical optimization and Nash equilibrium are her primary areas of study.
Her biological study spans a wide range of topics, including Minification, Decidability, Undecidable problem, Word and Nondeterministic algorithm.
Her Theoretical computer science research includes themes of Qualitative reasoning, State and Directed graph.
Her studies deal with areas such as Temporal logic and Exponential function as well as Discrete mathematics.
Her Probabilistic logic research focuses on Computation and how it relates to Correctness, Value, Sequence and Linear temporal logic.
The study incorporates disciplines such as Semantics and Robustness in addition to Linear temporal logic.
Between 2015 and 2021, her most popular works were:
- Synthesis with rational environments (44 citations)
- Formally Reasoning About Quality (24 citations)
- Automata Theory and Model Checking (20 citations)
In her most recent research, the most cited papers focused on:
- Programming language
- Algorithm
- Algebra
Her primary areas of study are Theoretical computer science, Automaton, Nash equilibrium, Discrete mathematics and Computation.
Her Theoretical computer science research is multidisciplinary, incorporating perspectives in State and Directed graph.
She interconnects Succinctness, Model checking, Decidability and Closure in the investigation of issues within Automaton.
Her Discrete mathematics research includes elements of Upper and lower bounds and Exponential function.
Her research in Computation intersects with topics in Linear temporal logic, Truth value, Correctness, Complete information and Lattice.
Her Linear temporal logic study introduces a deeper knowledge of Algorithm.
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.
