World's Best Scientists 2026 revealed!
Award Badge
Computer Science
Germany
2025

D-Index & Metrics

Computer Science

D-Index
66
Citations
18367
World Ranking
2315
National Ranking
96

Research.com Recognitions

  • 2025 - Research.com Computer Science in Germany Leader Award
  • 2023 - Research.com Computer Science in Germany Leader Award
  • 2022 - Research.com Computer Science in Germany Leader Award
  • 2010 - Fellow of Alfred P. Sloan Foundation

Overview

Rupak Majumdar is affiliated with the Max Planck Institute for Software Systems in Germany. Their research spans primarily the domain of computer science, with a strong focus on formal methods, logic, and distributed systems.

Their work predominantly addresses several fields of study including:

  • Artificial Intelligence
  • Computational Theory and Mathematics
  • Computer Networks and Communications
  • Software
  • Management Science and Operations Research

Key research topics covered in their publications are:

  • Formal Methods in Verification
  • Logic, programming, and type systems
  • Distributed systems and fault tolerance
  • Logic, Reasoning, and Knowledge
  • Software Testing and Debugging Techniques
  • Software Reliability and Analysis Research
  • Machine Learning and Algorithms

Some recent papers authored or co-authored include:

  • "Joint Inference of Reward Machines and Policies for Reinforcement Learning," 2020, Proceedings of the International Conference on Automated Planning and Scheduling
  • "Assume-Guarantee Distributed Synthesis," 2020, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
  • "Interactive synthesis of temporal specifications from examples and natural language," 2020, Proceedings of the ACM on Programming Languages
  • "Symbolic Qualitative Control for Stochastic Systems via Finite Parity Games," 2021, IFAC-PapersOnLine
  • "Generating High-Precision Feedback for Programming Syntax Errors using Large Language Models," 2023, arXiv (Cornell University)

Frequent co-authors collaborating with Rupak Majumdar include:

  • Sadegh Soudjani
  • Georg Zetzsche
  • Anne-Kathrin Schmuck
  • Ramanathan S. Thinniyam
  • Mahmoud Salamati

Their work is published in several prominent venues, such as:

  • arXiv (Cornell University)
  • Proceedings of the ACM on Programming Languages
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • Proceedings of the AAAI Conference on Artificial Intelligence
  • Zenodo (CERN European Organization for Nuclear Research)

Rupak Majumdar has also contributed to academic books, including a publication titled Networked Systems in 2021 by Springer Science+Business Media.

Among their recognitions, Rupak Majumdar has been awarded a Fellowship from the Alfred P. Sloan Foundation in 2010.

Best Publications

  • Lazy abstraction

    Thomas A. Henzinger;Ranjit Jhala;Rupak Majumdar;Grégoire Sutre

  • Automatic predicate abstraction of C programs

    Thomas Ball;Rupak Majumdar;Todd Millstein;Sriram K. Rajamani

  • The software model checker B last : Applications to software engineering

    Dirk Beyer;Thomas A. Henzinger;Ranjit Jhala;Rupak Majumdar

  • Software verification with BLAST

    Thomas A. Henzinger;Ranjit Jhala;Rupak Majumdar;Grégoire Sutre

  • Abstractions from proofs

    Thomas A. Henzinger;Ranjit Jhala;Rupak Majumdar;Kenneth L. McMillan

  • Software model checking

    Ranjit Jhala;Rupak Majumdar

  • Hybrid Concolic Testing

    Rupak Majumdar;Koushik Sen

  • Abstractions from proofs

    Unknown

  • Generating tests from counterexamples

    Dirk Beyer;Adam J. Chlipala;Thomas A. Henzinger;Ranjit Jhala

  • Cause clue clauses: error localization using maximum satisfiability

    Manu Jose;Rupak Majumdar

  • Dynamic test input generation for database applications

    Michael Emmi;Rupak Majumdar;Koushik Sen

  • Path invariants

    Dirk Beyer;Thomas A. Henzinger;Rupak Majumdar;Andrey Rybalchenko

  • Temporal-Safety Proofs for Systems Code

    Thomas A. Henzinger;Ranjit Jhala;Rupak Majumdar;George C. Necula

  • Race checking by context inference

    Thomas A. Henzinger;Ranjit Jhala;Rupak Majumdar

  • Beyond HYTECH: Hybrid Systems Analysis Using Interval Numerical Methods

    Thomas A. Henzinger;Benjamin Horowitz;Rupak Majumdar;Howard Wong-Toi

  • Proving non-termination

    Ashutosh Gupta;Thomas A. Henzinger;Rupak Majumdar;Andrey Rybalchenko

  • Directed test generation using symbolic grammars

    Rupak Majumdar;Ru-Gang Xu

  • Discounting the future in systems theory

    Luca de Alfaro;Thomas A. Henzinger;Rupak Majumdar

  • Thread-modular abstraction refinement

    Thomas A. Henzinger;Ranjit Jhala;Rupak Majumdar;Shaz Qadeer

  • Quantitative solution of omega-regular games

    Luca de Alfaro;Rupak Majumdar

  • Temporal-safety proofs for systems code

    Thomas A. Henzinger;George C. Necula;Ranjit Jhala;Gregoire Sutre

  • Automatic predicate abstraction of C programs

    Unknown

Frequent Co-Authors

Thomas A. Henzinger
Thomas A. Henzinger Institute of Science and Technology Austria
Ranjit Jhala
Ranjit Jhala University of California, San Diego
Krishnendu Chatterjee
Krishnendu Chatterjee Institute of Science and Technology Austria
Luca de Alfaro
Luca de Alfaro University of California, Santa Cruz
Javier Esparza
Javier Esparza Technical University of Munich
Dirk Beyer
Dirk Beyer Ludwig-Maximilians-Universität München
Paulo Tabuada
Paulo Tabuada University of California, Los Angeles
Lei He
Lei He University of California, Los Angeles
Andrey Rybalchenko
Andrey Rybalchenko Microsoft (United States)
Todd Millstein
Todd Millstein University of California, Los Angeles

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

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Online education has made it easier than ever to start or advance a career in computer science. Many universities now offer affordable online courses in computer science, letting students learn flexibly and save on tuition costs. These programs can help you acquire industry-relevant skills without a large financial burden.

For those concerned about past academic performance, there are online graduate schools with low gpa requirements. This enables a wider group of students to pursue advanced degrees and improve their career prospects, regardless of their undergraduate GPA.

Computer science graduates are qualified for a range of lucrative positions, and interdisciplinary career paths are also available. For example, with the rise of sustainability and technology, there are high-paying jobs with environmental science degree that combine computing skills with environmental expertise.

If you’re eager to fast-track your career, look for the accelerated cs degree options online. These intensive programs allow you to earn your degree faster, helping you enter the job market or advance to higher roles in less time.

Best Scientists Citing Rupak Majumdar

Trending Scientists

Recently Published Articles