D-Index & Metrics Best Publications

D-Index & Metrics

Discipline name D-index D-index (Discipline H-index) only includes papers and citation values for an examined discipline in contrast to General H-index which accounts for publications across all disciplines. Citations Publications World Ranking National Ranking
Computer Science D-index 47 Citations 11,385 164 World Ranking 3253 National Ranking 61

Research.com Recognitions

Awards & Achievements

2016 - Member of Academia Europaea

Overview

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.

Best Publications

Alternating-time temporal logic

Rajeev Alur;Thomas A. Henzinger;Orna Kupferman.
Journal of the ACM (2002)

1627 Citations

An automata-theoretic approach to branching-time model checking

Orna Kupferman;Moshe Y. Vardi;Pierre Wolper.
Journal of the ACM (2000)

663 Citations

Model Checking of Safety Properties

Orna Kupferman;Moshe Y. Vardi.
formal methods (2001)

494 Citations

Alternating Refinement Relations

R. Alur;T. A. Henzinger;O. Kupferman;M. Y. Vardi.
international conference on concurrency theory (1998)

400 Citations

Weak alternating automata are not that weak

Orna Kupferman;Moshe Y. Vardi.
ACM Transactions on Computational Logic (2001)

319 Citations

Safraless decision procedures

O. Kupferman;M.Y. Vardi.
foundations of computer science (2005)

265 Citations

Concurrent reachability games

Luca de Alfaro;Thomas A. Henzinger;Orna Kupferman.
Theoretical Computer Science (2007)

249 Citations

Module Checking

Orna Kupferman;Moshe Y Vardi;Pierre Wolper.
Information & Computation (2001)

204 Citations

Module Checking

Orna Kupferman;Moshe Y. Vardi.
computer aided verification (1996)

175 Citations

Vacuity detection in temporal model checking

Orna Kupferman;Moshe Y. Vardi.
tools and algorithms for construction and analysis of systems (2003)

175 Citations

Editorial Boards

Best Scientists Citing Orna Kupferman

Krishnendu Chatterjee

Krishnendu Chatterjee

Institute of Science and Technology Austria

Publications: 158

Moshe Y. Vardi

Moshe Y. Vardi

Rice University

Publications: 145

Thomas A. Henzinger

Thomas A. Henzinger

Institute of Science and Technology Austria

Publications: 110

Jean-François Raskin

Jean-François Raskin

Université Libre de Bruxelles

Publications: 77

Michael Wooldridge

Michael Wooldridge

University of Oxford

Publications: 70

Roderick Bloem

Roderick Bloem

Graz University of Technology

Publications: 49

Wiebe van der Hoek

Wiebe van der Hoek

University of Liverpool

Publications: 47

Alessio Lomuscio

Alessio Lomuscio

Imperial College London

Publications: 42

Ufuk Topcu

Ufuk Topcu

The University of Texas at Austin

Publications: 41

Axel Legay

Axel Legay

Université Catholique de Louvain

Publications: 40

Rajeev Alur

Rajeev Alur

University of Pennsylvania

Publications: 40

Calin Belta

Calin Belta

Boston University

Publications: 39

Giuseppe De Giacomo

Giuseppe De Giacomo

Sapienza University of Rome

Publications: 39

Luca de Alfaro

Luca de Alfaro

University of California, Santa Cruz

Publications: 36

Rupak Majumdar

Rupak Majumdar

Max Planck Institute for Software Systems

Publications: 35

Christel Baier

Christel Baier

TU Dresden

Publications: 34

Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking d-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
Something went wrong. Please try again later.