World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
40
Citations
6386
World Ranking
9341
National Ranking
3966

Overview

Shuvendu K. Lahiri is affiliated with Microsoft in the United States and has a prolific body of work within computer science, with a primary focus on software-related research. Their academic contributions cover a broad range of topics within software engineering, verification, and system reliability.

Their recent publications include:

  • Interactive Code Generation via Test-Driven User-Intent Formalization, 2022, arXiv (Cornell University)
  • LLM-Based Test-Driven Interactive Code Generation: User Study and Empirical Evaluation, 2024, IEEE Transactions on Software Engineering
  • TOGA, 2022, Proceedings of the 44th International Conference on Software Engineering
  • DeepMerge: Learning to Merge Programs, 2022, IEEE Transactions on Software Engineering
  • SolType: refinement types for arithmetic overflow in solidity, 2022, Proceedings of the ACM on Programming Languages

Frequent co-authors collaborating with Lahiri include:

  • Akash Lal
  • Saikat Chakraborty
  • Sarah Fakhoury
  • Narges Shadab
  • Pritam Gharat

Lahiri's research has consistently appeared in the following publication venues:

  • arXiv (Cornell University)
  • Zenodo (CERN European Organization for Nuclear Research)
  • Proceedings of the ACM on Programming Languages
  • IEEE Transactions on Software Engineering
  • Proceedings of the 44th International Conference on Software Engineering

The scientist has contributed to academic literature through a book publication titled Computer Aided Verification released by Springer Science+Business Media in 2020.

The key fields of study represented in their work are:

  • Computer Science

More specialized subfields within computer science in their research include:

  • Software
  • Information Systems
  • Artificial Intelligence
  • Computer Networks and Communications
  • Hardware and Architecture

Lahiri's main research topics focus on software testing, debugging, and engineering, including:

  • Software Testing and Debugging Techniques
  • Software Engineering Research
  • Software System Performance and Reliability
  • Software Reliability and Analysis Research
  • Security and Verification in Computing
  • Advanced Malware Detection Techniques
  • Parallel Computing and Optimization Techniques

Best Publications

  • Feedback-Directed Random Test Generation

    Carlos Pacheco;Shuvendu K. Lahiri;Michael D. Ernst;Thomas Ball

  • Modeling and verifying systems using a logic of Counter arithmetic with Lambda Expressions and Uninterpreted Functions

    Randal E. Bryant;Shuvendu K. Lahiri;Sanjit A. Seshia

  • SYMDIFF: a language-agnostic semantic diff tool for imperative programs

    Shuvendu K. Lahiri;Chris Hawblitzel;Ming Kawaguchi;Henrique Rebêlo

  • CodaMosa: Escaping Coverage Plateaus in Test Generation with Pre-trained Large Language Models

    Unknown

  • Back to the future: revisiting precise program verification using SMT solvers

    Shuvendu Lahiri;Shaz Qadeer

  • A solver for reachability modulo theories

    Akash Lal;Shaz Qadeer;Shuvendu K. Lahiri

  • SMT techniques for fast predicate abstraction

    Shuvendu K. Lahiri;Robert Nieuwenhuis;Albert Oliveras

  • A symbolic approach to predicate abstraction

    Shuvendu K. Lahiri;Randal E. Bryant;Byron Cook

  • Differential assertion checking

    Shuvendu K. Lahiri;Kenneth L. McMillan;Rahul Sharma;Chris Hawblitzel

  • Verifying properties of well-founded linked lists

    Shuvendu K. Lahiri;Shaz Qadeer

  • Finding errors in .net with feedback-directed random testing

    Carlos Pacheco;Shuvendu K. Lahiri;Thomas Ball

  • Modeling and Verification of Out-of-Order Microprocessors in UCLID

    Shuvendu K. Lahiri;Sanjit A. Seshia;Randal E. Bryant

  • Helping developers help themselves: automatic decomposition of code review changesets

    Mike Barnett;Christian Bird;Joao Brunet;Shuvendu K. Lahiri

  • Constructing Quantified Invariants via Predicate Abstraction

    Shuvendu K. Lahiri;Randal E. Bryant

  • A reachability predicate for analyzing low-level software

    Shaunak Chatterjee;Shuvendu K. Lahiri;Shaz Qadeer;Zvonimir Rakamaric

  • A hybrid SAT-based decision procedure for separation logic with uninterpreted functions

    Sanjit A. Seshia;Shuvendu K. Lahiri;Randal E. Bryant

  • Indexed Predicate Discovery for Unbounded System Verification

    Shuvendu K. Lahiri;Randal E. Bryant

  • The UCLID Decision Procedure

    Shuvendu K. Lahiri;Sanjit A. Seshia

  • Code vectors: understanding programs through embedded abstracted symbolic traces

    Jordan Henkel;Shuvendu K. Lahiri;Ben Liblit;Thomas Reps

  • An efficient decision procedure for UTVPI constraints

    Shuvendu K. Lahiri;Madanlal Musuvathi

  • Zapato: Automatic Theorem Proving for Predicate Abstraction Refinement

    Thomas Ball;Byron Cook;Shuvendu K. Lahiri;Lintao Zhang

  • Corral: A Solver for Reachability Modulo Theories

    Akash Lal;Shaz Qadeer;Shuvendu K. Lahiri

Frequent Co-Authors

Randal E. Bryant
Randal E. Bryant Carnegie Mellon University
Shaz Qadeer
Shaz Qadeer Microsoft (United States)
Thomas Ball
Thomas Ball Microsoft (United States)
Isil Dillig
Isil Dillig The University of Texas at Austin
Christian Bird
Christian Bird Microsoft (United States)
Thomas Reps
Thomas Reps University of Wisconsin–Madison
Madanlal Musuvathi
Madanlal Musuvathi Microsoft (United States)
Byron Cook
Byron Cook Amazon (United States)
Sanjit A. Seshia
Sanjit A. Seshia University of California, Berkeley
Chao Wang
Chao Wang University of Southern California

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

Exploring computer science in the USA opens up a wide range of pathways, from rapid certifications to advanced online degrees. For those looking to enter the workforce quickly, there are quick certifications that pay well in areas like IT support, networking, and cybersecurity. These can often be completed in a few months and serve as launching points for tech careers.

If you're considering more advanced credentials, you might explore the shortest masters degree programs online. Accelerated online master's degrees allow students to upskill or transition to new specialties in 12–18 months, ideal for working professionals.

Choosing the right graduate program is important. Research shows that which master's degree is most in demand in USA continues to include computer science, data science, and information technology—fields with strong job growth and salary potential.

Alternatively, those seeking a shorter college commitment can consider 2 year online degrees. Online associate degrees offer foundational knowledge and can lead to entry-level roles or serve as a step toward a bachelor’s.

Best Scientists Citing Shuvendu K. Lahiri

Trending Scientists

Recently Published Articles