H-Index & Metrics Best Publications

H-Index & Metrics

Discipline name H-index Citations Publications World Ranking National Ranking
Computer Science D-index 57 Citations 14,125 224 World Ranking 1895 National Ranking 81

Research.com Recognitions

Awards & Achievements

2010 - Fellow of Alfred P. Sloan Foundation

Overview

What is he best known for?

The fields of study he is best known for:

  • Programming language
  • Operating system
  • Artificial intelligence

The scientist’s investigation covers issues in Model checking, Programming language, Theoretical computer science, Algorithm and Predicate abstraction. His Model checking research includes elements of Linear temporal logic, Thread, Software, Software development and Concurrency. His study in the fields of Program analysis and Correctness under the domain of Programming language overlaps with other disciplines such as CPAchecker.

His Theoretical computer science study integrates concerns from other disciplines, such as Concolic testing, Mathematical proof, Software system, Modular design and String. His Algorithm research integrates issues from Invariant, Data structure and Counterexample. His biological study deals with issues like Abstraction model checking, which deal with fields such as Abstract interpretation and Control flow.

His most cited work include:

  • Lazy abstraction (1080 citations)
  • Automatic predicate abstraction of C programs (738 citations)
  • The software model checker B last : Applications to software engineering (533 citations)

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

His main research concerns Theoretical computer science, Programming language, Model checking, Algorithm and Reachability. His research integrates issues of Probabilistic logic, Control theory, Petri net and Parameterized complexity in his study of Theoretical computer science. His Control theory study which covers Bisimulation that intersects with Temporal logic.

In general Programming language, his work in Correctness and Program analysis is often linked to TRACE linking many areas of study. His work on Predicate abstraction and Abstraction model checking as part of his general Model checking study is frequently connected to Software verification, thereby bridging the divide between different branches of science. His Reachability research focuses on Discrete mathematics and how it relates to Combinatorics, Pushdown automaton, Linear temporal logic and Hybrid system.

He most often published in these fields:

  • Theoretical computer science (26.95%)
  • Programming language (18.33%)
  • Model checking (16.17%)

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

  • Reachability (11.86%)
  • Theoretical computer science (26.95%)
  • Decidability (10.24%)

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

His primary scientific interests are in Reachability, Theoretical computer science, Decidability, Control theory and Liveness. His study in Discrete mathematics extends to Reachability with its themes. His Theoretical computer science research incorporates elements of Systems design, Formal methods, Debugging and Resolution.

His work carried out in the field of Control theory brings together such families of science as Field, Relation and Supervisory control. The study incorporates disciplines such as Mathematical optimization and Shared memory in addition to Liveness. His work focuses on many connections between Order and other disciplines, such as Programming language, that overlap with his field of interest in Mathematical proof.

Between 2018 and 2021, his most popular works were:

  • Compositional Synthesis of Finite-State Abstractions (29 citations)
  • Paracosm: A Language and Tool for Testing Autonomous Driving Systems. (17 citations)
  • Symbolic controller synthesis for Büchi specifications on stochastic systems (14 citations)

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

  • Programming language
  • Operating system
  • Artificial intelligence

Control theory, Theoretical computer science, Mathematical optimization, Reachability and Control system are his primary areas of study. His work deals with themes such as Field, Bounded function and Relation, which intersect with Control theory. His studies deal with areas such as Reactive system and Formal methods as well as Theoretical computer science.

In his study, Stochastic game, Set and Liveness is strongly linked to Fixed point, which falls under the umbrella field of Mathematical optimization. Rupak Majumdar regularly ties together related areas like Discrete mathematics in his Reachability studies. His research investigates the connection between Temporal logic and topics such as Soundness that intersect with problems in 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

Lazy abstraction

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

1471 Citations

Automatic predicate abstraction of C programs

Thomas Ball;Rupak Majumdar;Todd Millstein;Sriram K. Rajamani.
programming language design and implementation (2001)

1060 Citations

The software model checker BLAST Applications to software engineering

Dirk Beyer;Thomas A. Henzinger;Ranjit Jhala;Rupak Majumdar.
International Journal on Software Tools for Technology Transfer (2007)

820 Citations

Abstractions from proofs

Thomas A. Henzinger;Ranjit Jhala;Rupak Majumdar;Kenneth L. McMillan.
symposium on principles of programming languages (2004)

635 Citations

Software verification with BLAST

Thomas A. Henzinger;Ranjit Jhala;Rupak Majumdar;Grégoire Sutre.
international workshop on model checking software (2003)

635 Citations

Hybrid Concolic Testing

Rupak Majumdar;Koushik Sen.
international conference on software engineering (2007)

486 Citations

Software model checking

Ranjit Jhala;Rupak Majumdar.
ACM Computing Surveys (2009)

481 Citations

Generating tests from counterexamples

Dirk Beyer;Adam J. Chlipala;Thomas A. Henzinger;Ranjit Jhala.
international conference on software engineering (2004)

305 Citations

Cause clue clauses: error localization using maximum satisfiability

Manu Jose;Rupak Majumdar.
programming language design and implementation (2011)

269 Citations

Dynamic test input generation for database applications

Michael Emmi;Rupak Majumdar;Koushik Sen.
international symposium on software testing and analysis (2007)

268 Citations

If you think any of the details on this page are incorrect, let us know.

Contact us

Best Scientists Citing Rupak Majumdar

Krishnendu Chatterjee

Krishnendu Chatterjee

Institute of Science and Technology Austria

Publications: 124

Thomas A. Henzinger

Thomas A. Henzinger

Institute of Science and Technology Austria

Publications: 116

Daniel Kroening

Daniel Kroening

Amazon (United States)

Publications: 78

Dirk Beyer

Dirk Beyer

Ludwig-Maximilians-Universität München

Publications: 70

Viktor Kuncak

Viktor Kuncak

École Polytechnique Fédérale de Lausanne

Publications: 63

Andreas Podelski

Andreas Podelski

University of Freiburg

Publications: 57

Andrey Rybalchenko

Andrey Rybalchenko

Microsoft (United States)

Publications: 56

Edmund M. Clarke

Edmund M. Clarke

Carnegie Mellon University

Publications: 52

Thomas Reps

Thomas Reps

University of Wisconsin–Madison

Publications: 48

Axel Legay

Axel Legay

Université Catholique de Louvain

Publications: 47

Byron Cook

Byron Cook

Amazon (United States)

Publications: 44

Aarti Gupta

Aarti Gupta

Princeton University

Publications: 42

Shuvendu K. Lahiri

Shuvendu K. Lahiri

Microsoft (United States)

Publications: 42

Sriram K. Rajamani

Sriram K. Rajamani

Microsoft (United States)

Publications: 40

Marta Kwiatkowska

Marta Kwiatkowska

University of Oxford

Publications: 40

Jean-François Raskin

Jean-François Raskin

Université Libre de Bruxelles

Publications: 39

Something went wrong. Please try again later.