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 104 Citations 59,374 364 World Ranking 120 National Ranking 1

Research.com Recognitions

Awards & Achievements

2020 - Fellow of the American Academy of Arts and Sciences

2020 - Member of the National Academy of Sciences

2015 - European Association for Theoretical Computer Science (EATCS) Fellow For fundamental contributions to formal verification and synthesis of computer and biological systems

2012 - Wittgenstein Award

2006 - ACM Fellow For contributions to formal verification and hybrid systems.

2006 - Member of Academia Europaea

Overview

What is he best known for?

The fields of study he is best known for:

  • Programming language
  • Operating system
  • Algorithm

His main research concerns Theoretical computer science, Model checking, Algorithm, Programming language and Temporal logic. His studies link State with Theoretical computer science. Thomas A. Henzinger has included themes like Formal verification, Mathematical proof and Hybrid system in his Model checking study.

Thomas A. Henzinger combines subjects such as Control theory and Counterexample with his study of Algorithm. His work on Predicate abstraction, CPAchecker, Specification language and Reactive system as part of general Programming language research is often related to TRACE, thus linking different fields of science. In general Automaton, his work in Hybrid automaton and Automata theory is often linked to Compatibility linking many areas of study.

His most cited work include:

  • The theory of hybrid automata (1872 citations)
  • The algorithmic analysis of hybrid systems (1707 citations)
  • Alternating-time temporal logic (1278 citations)

What are the main themes of his work throughout his whole career to date?

Thomas A. Henzinger mainly investigates Theoretical computer science, Algorithm, Model checking, Programming language and Discrete mathematics. Many of his studies involve connections with topics such as Finite-state machine and Theoretical computer science. In his research on the topic of Algorithm, Mathematical optimization is strongly related with Markov chain.

The various areas that Thomas A. Henzinger examines in his Model checking study include Formal verification, State space, State and Software verification. His Correctness, Software, Formal specification and Specification language study in the realm of Programming language interacts with subjects such as TRACE. His Discrete mathematics study integrates concerns from other disciplines, such as Nested word, Quantum finite automata, Automata theory and Reachability, Combinatorics.

He most often published in these fields:

  • Theoretical computer science (30.97%)
  • Algorithm (21.13%)
  • Model checking (19.31%)

What were the highlights of his more recent work (between 2015-2021)?

  • Automaton (15.48%)
  • Reachability (10.56%)
  • Bidding (2.55%)

In recent papers he was focusing on the following fields of study:

His scientific interests lie mostly in Automaton, Reachability, Bidding, Mathematical economics and Algorithm. His Automaton research is under the purview of Theoretical computer science. His study in Theoretical computer science is interdisciplinary in nature, drawing from both Computational complexity theory and Scalability.

Within one scientific family, he focuses on topics pertaining to Affine transformation under Reachability, and may sometimes address concerns connected to Series and Hybrid automaton. The study incorporates disciplines such as Dynamical systems theory, Hybrid system, Nonlinear system, Monotonic function and Robustness in addition to Algorithm. His Hybrid system study incorporates themes from Invariant and Gröbner basis.

Between 2015 and 2021, his most popular works were:

  • Contracts for System Design (121 citations)
  • PSync: a partially synchronous language for fault-tolerant distributed algorithms (56 citations)
  • Scalable Static Hybridization Methods for Analysis of Nonlinear Systems (21 citations)

In his most recent research, the most cited papers focused on:

  • Programming language
  • Operating system
  • Algorithm

The scientist’s investigation covers issues in Automaton, Discrete mathematics, Reachability, Markov chain and Algorithm. His research in Automaton intersects with topics in Control engineering, Control theory and Construct. His Reachability study deals with the bigger picture of Theoretical computer science.

His research in Theoretical computer science tackles topics such as Hybrid system which are related to areas like Nonlinear system. His studies in Markov chain integrate themes in fields like Class and Temporal logic. His Abstract interpretation study in the realm of Algorithm connects with subjects such as Convex optimization.

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

The theory of hybrid automata

T.A. Henzinger.
logic in computer science (1996)

2897 Citations

The algorithmic analysis of hybrid systems

Rajeev Alur;Costas Courcoubetis;Nicolas Halbwachs;Thomas A. Henzinger.
Theoretical Computer Science (1995)

2500 Citations

Hybrid Automata: An Algorithmic Approach to the Specification and Verification of Hybrid Systems

Rajeev Alur;Costas Courcoubetis;Thomas A. Henzinger;Pei-Hsin Ho.
Hybrid Systems (1993)

1701 Citations

Symbolic model checking for real-time systems

Thomas A. Henzinger;Xavier Nicollin;Joseph Sifakis;Sergio Yovine.
Information & Computation (1994)

1678 Citations

Interface automata

Luca de Alfaro;Thomas A. Henzinger.
foundations of software engineering (2001)

1633 Citations

Alternating-time temporal logic

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

1627 Citations

HYTECH: a model checker for hybrid systems

Thomas A. Henzinger;Pei-Hsin Ho;Howard Wong-Toi.
International Journal on Software Tools for Technology Transfer (1997)

1601 Citations

Lazy abstraction

Thomas A. Henzinger;Ranjit Jhala;Rupak Majumdar;Grégoire Sutre.
symposium on principles of programming languages (2002)

1471 Citations

What's Decidable about Hybrid Automata?

Thomas A. Henzinger.
Journal of Computer and System Sciences (1998)

1419 Citations

Discrete abstractions of hybrid systems

R. Alur;T.A. Henzinger;G. Lafferriere;G.J. Pappas.
Proceedings of the IEEE (2000)

1007 Citations

Best Scientists Citing Thomas A. Henzinger

Krishnendu Chatterjee

Krishnendu Chatterjee

Institute of Science and Technology Austria

Publications: 206

Kim Guldstrand Larsen

Kim Guldstrand Larsen

Aalborg University

Publications: 191

Jean-François Raskin

Jean-François Raskin

Université Libre de Bruxelles

Publications: 140

Rajeev Alur

Rajeev Alur

University of Pennsylvania

Publications: 138

Axel Legay

Axel Legay

Université Catholique de Louvain

Publications: 134

Marta Kwiatkowska

Marta Kwiatkowska

University of Oxford

Publications: 114

Patricia Bouyer

Patricia Bouyer

University of Paris-Saclay

Publications: 112

Stavros Tripakis

Stavros Tripakis

Northeastern University

Publications: 99

Edmund M. Clarke

Edmund M. Clarke

Carnegie Mellon University

Publications: 98

Edward A. Lee

Edward A. Lee

University of California, Berkeley

Publications: 95

Moshe Y. Vardi

Moshe Y. Vardi

Rice University

Publications: 93

Alberto Sangiovanni-Vincentelli

Alberto Sangiovanni-Vincentelli

University of California, Berkeley

Publications: 86

André Platzer

André Platzer

Carnegie Mellon University

Publications: 86

Joost-Pieter Katoen

Joost-Pieter Katoen

RWTH Aachen University

Publications: 86

Orna Kupferman

Orna Kupferman

Hebrew University of Jerusalem

Publications: 85

George J. Pappas

George J. Pappas

University of Pennsylvania

Publications: 84

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.