( en | de | ru )

 

Disambiguation of "Lahiri, Shuvendu K."

Author of the publication

copydeleteadd this publication to your clipboard
Helping Developers Help Themselves: Automatic Decomposition of Code Review Changesets.

, , , and . ICSE (1), page 134-144. IEEE Computer Society, (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Kajori Lahiri

Ananda Lahiri

Claus Lahiri

Kishor Lahiri

Sunanda Lahiri

 

Other publications of authors with the same name

Finding Inductive Loop Invariants using Large Language Models., , , , , , , , and . CoRR, (2023)MergeBERT: Program Merge Conflict Resolution via Neural Transformers., , , , , , , and . CoRR, (2021)DeepMerge: Learning to Merge Programs., , , , , and . CoRR, (2021)Verified three-way program merge., , and . Proc. ACM Program. Lang., 2 (OOPSLA): 165:1-165:29 (2018)Formalizing Natural Language Intent into Program Specifications via Large Language Models., , , and . CoRR, (2023)Formal Specification and Verification of Smart Contracts for Azure Blockchain., , , and . CoRR, (2018)Constructing Quantified Invariants via Predicate Abstraction., and . VMCAI, volume 2937 of Lecture Notes in Computer Science, page 267-281. Springer, (2004)Static and Precise Detection of Concurrency Errors in Systems Code Using SMT Solvers., , and . CAV, volume 5643 of Lecture Notes in Computer Science, page 509-524. Springer, (2009)SYMDIFF: A Language-Agnostic Semantic Diff Tool for Imperative Programs., , , and . CAV, volume 7358 of Lecture Notes in Computer Science, page 712-717. Springer, (2012)A Solver for Reachability Modulo Theories., , and . CAV, volume 7358 of Lecture Notes in Computer Science, page 427-443. Springer, (2012)