Search Results

Documents authored by Roychoudhury, Abhik

Document
DOI: 10.4230/DagRep.14.10.39
Automated Programming and Program Repair (Dagstuhl Seminar 24431)

Authors: Claire Le Goues, Michael Pradel, Abhik Roychoudhury, and Shin Hwei Tan

Published in: Dagstuhl Reports, Volume 14, Issue 10 (2025)

Abstract
The Dagstuhl Seminar 24431 on "Automated Programming and Program Repair" brought together 33 researchers from academia and industry to explore the intersection of automated code generation and program repair. Over five days (October 21–25, 2024), participants discussed advances in large language models (LLMs) for code generation, the role of automated program repair in improving generated code, and challenges in deploying these technologies in real-world software development. The seminar featured over 20 talks and three panel discussions on topics such as benchmarks for LLM-generated code, trust in automated programming, and the broader applications of LLMs beyond coding assistance. Key outcomes included identifying critical challenges in benchmarking, evaluation criteria, and developer adoption of automated repair techniques, fostering future collaborations and actionable research directions in the field.
Cite as

Claire Le Goues, Michael Pradel, Abhik Roychoudhury, and Shin Hwei Tan. Automated Programming and Program Repair (Dagstuhl Seminar 24431). In Dagstuhl Reports, Volume 14, Issue 10, pp. 39-57, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)

Copy BibTex To Clipboard

@Article{legoues_et_al:DagRep.14.10.39,
  author =	{Le Goues, Claire and Pradel, Michael and Roychoudhury, Abhik and Tan, Shin Hwei},
  title =	{{Automated Programming and Program Repair (Dagstuhl Seminar 24431)}},
  pages =	{39--57},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2025},
  volume =	{14},
  number =	{10},
  editor =	{Le Goues, Claire and Pradel, Michael and Roychoudhury, Abhik and Tan, Shin Hwei},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.14.10.39},
  URN =		{urn:nbn:de:0030-drops-230235},
  doi =		{10.4230/DagRep.14.10.39},
  annote =	{Keywords: Auto-coding, Large Language Models, Automated Program Repair, Program Synthesis, Trustworthy Software}
}
Document
DOI: 10.4230/DagRep.7.1.19
Automated Program Repair (Dagstuhl Seminar 17022)

Authors: Sunghun Kim, Claire Le Goues, Michael Pradel, and Abhik Roychoudhury

Published in: Dagstuhl Reports, Volume 7, Issue 1 (2017)

Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 17022 "Automated Program Repair". The seminar participants presented and discussed their research through formal and informal presentations. In particular, the seminar covered work related to search-based program repair, semantic program repair, and repair of non-functional properties. As a result of the seminar, several participants plan to launch various follow-up activities, such as a program repair competition, which would help to further establish and guide this young field of research.
Cite as

Sunghun Kim, Claire Le Goues, Michael Pradel, and Abhik Roychoudhury. Automated Program Repair (Dagstuhl Seminar 17022). In Dagstuhl Reports, Volume 7, Issue 1, pp. 19-31, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)

Copy BibTex To Clipboard

@Article{kim_et_al:DagRep.7.1.19,
  author =	{Kim, Sunghun and Le Goues, Claire and Pradel, Michael and Roychoudhury, Abhik},
  title =	{{Automated Program Repair (Dagstuhl Seminar 17022)}},
  pages =	{19--31},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2017},
  volume =	{7},
  number =	{1},
  editor =	{Kim, Sunghun and Le Goues, Claire and Pradel, Michael and Roychoudhury, Abhik},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.7.1.19},
  URN =		{urn:nbn:de:0030-drops-71767},
  doi =		{10.4230/DagRep.7.1.19},
  annote =	{Keywords: Program repair, program analysis, software engineering}
}
Document
DOI: 10.4230/OASIcs.WCET.2007.1192
Timing Analysis of Body Area Network Applications

Authors: Liang Yun, Abhik Roychoudhury, and Tulika Mitra

Published in: OASIcs, Volume 6, 7th International Workshop on Worst-Case Execution Time Analysis (WCET'07) (2007)

Abstract
Body area network (BAN) applications have stringent timing requirements. The timing behavior of a BAN application is determined not only by the software complexity, inputs, and architecture, but also by the timing behavior of the peripherals. This paper presents systematic timing analysis of such applications, deployed for health-care monitoring of patients staying at home. This monitoring is used to achieve prompt notification of the hospital when a patient shows abnormal vital signs. Due to the safetycritical nature of these applications,worst-case execution time (WCET) analysis is extremely important.
Cite as

Liang Yun, Abhik Roychoudhury, and Tulika Mitra. Timing Analysis of Body Area Network Applications. In 7th International Workshop on Worst-Case Execution Time Analysis (WCET'07). Open Access Series in Informatics (OASIcs), Volume 6, pp. 1-6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)

Copy BibTex To Clipboard

@InProceedings{yun_et_al:OASIcs.WCET.2007.1192,
  author =	{Yun, Liang and Roychoudhury, Abhik and Mitra, Tulika},
  title =	{{Timing Analysis of Body Area Network Applications}},
  booktitle =	{7th International Workshop on Worst-Case Execution Time Analysis (WCET'07)},
  pages =	{1--6},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-05-7},
  ISSN =	{2190-6807},
  year =	{2007},
  volume =	{6},
  editor =	{Rochange, Christine},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.WCET.2007.1192},
  URN =		{urn:nbn:de:0030-drops-11924},
  doi =		{10.4230/OASIcs.WCET.2007.1192},
  annote =	{Keywords: WCET analysis of Peripherals, Body Area Network applications}
}
Document
DOI: 10.4230/OASIcs.WCET.2005.816
Exploiting Branch Constraints without Exhaustive Path Enumeration

Authors: Ting Chen, Tulika Mitra, Abhik Roychoudhury, and Vivy Suhendra

Published in: OASIcs, Volume 1, 5th International Workshop on Worst-Case Execution Time Analysis (WCET'05) (2007)

Abstract
Statically estimating the worst case execution time (WCET) of a program is important for real-time software. This is difficult even in the programming language level due to the inherent difficulty in detecting and exploiting infeasible paths in a program’s control flow graph. In this paper, we propose an efficient method to exploit infeasible path information for WCET estimation of a loop without resorting to exhaustive path enumeration. The ef- ficiency of our approach is demonstrated with a real-life control-intensive program.
Cite as

Ting Chen, Tulika Mitra, Abhik Roychoudhury, and Vivy Suhendra. Exploiting Branch Constraints without Exhaustive Path Enumeration. In 5th International Workshop on Worst-Case Execution Time Analysis (WCET'05). Open Access Series in Informatics (OASIcs), Volume 1, pp. 46-49, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)

Copy BibTex To Clipboard

@InProceedings{chen_et_al:OASIcs.WCET.2005.816,
  author =	{Chen, Ting and Mitra, Tulika and Roychoudhury, Abhik and Suhendra, Vivy},
  title =	{{Exploiting Branch Constraints without Exhaustive Path Enumeration}},
  booktitle =	{5th International Workshop on Worst-Case Execution Time Analysis (WCET'05)},
  pages =	{46--49},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-24-8},
  ISSN =	{2190-6807},
  year =	{2007},
  volume =	{1},
  editor =	{Wilhelm, Reinhard},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.WCET.2005.816},
  URN =		{urn:nbn:de:0030-drops-8163},
  doi =		{10.4230/OASIcs.WCET.2005.816},
  annote =	{Keywords: WCET, infeasible path, branch constraints}
}
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact