Sudipto Ghosh
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Sudipto Ghosh has a total of 64 co-authors. Here are the top co-authors by number of shared publications:
- Marcia Moraes
Colorado State University, Fort Collins, CO, USA
5 shared publications - Walter Cazzola
Department of Computer Science, Universit degli Studi di Milano, Milan, Italy
4 shared publications - Albert Lionelle
Khoury College of Computer Sciences, Northeastern University, Boston, MA, USA
2 shared publications - Bianca Trinkenreich
Colorado State University, Fort Collins, Colorado, USA
2 shared publications - Indrakshi Ray
Colorado State University
2 shared publications - James Eric Folkestad
School of Education, Colorado State University, Fort Collins, USA
2 shared publications
Latest Publications
- Open Access
- 5 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1112-1122
How Do Students Perceive Their Teammates? A Qualitative Study of Peer Evaluation in SE Course Projects
- 5 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1112-1122
Open AccessHow Do Students Perceive Their Teammates? A Qualitative Study of Peer Evaluation in SE Course Projects
- Open Access
- 23 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 749-759
Analyzing the Communication Patterns of Different Teammate Types in a Software Engineering Course Project
- 23 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 749-759
Open AccessAnalyzing the Communication Patterns of Different Teammate Types in a Software Engineering Course Project
- 27 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. 51 (5) , 1487-1499
BabelRTS: Polyglot Regression Test Selection
Regression test selection (RTS) approaches reduce the number of regression tests. Current RTS approaches are typically monoglot, i.e., their implementations target a specific language. However, many subjects under test (SUT) are polyglot, i.e., they use multiple languages. Running multiple monoglot RTS approaches separately on a polyglot SUT is unsafe because tests that involve inter-language dependencies can be missed. Moreover, a new language may require completely reimplementing an RTS approach, especially if the original implementation relies on language and runtime features that are not available in the new language. We propose a new static approach called BabelRTS, which is multilingual (supports multiple languages out of the box), polyglot (analyzes SUTs written in multiple languages), and extensible (allows adding support for new languages). A key contribution is the idea of encapsulating the language-specific aspects of RTS by using patterns and actions. A pattern specifies programming language constructs used in each file that indicate dependencies to other files written in the same or a different language. An action specifies how to identify these files in the codebase. Patterns and actions can be customized to support new languages without modifying the test selection algorithm. BabelRTS is not tied to a specific language run-time system or paradigm. BabelRTS currently supports 12 languages and 5 language combinations. We evaluated BabelRTS on 142 open-source monoglot and polyglot SUTs, analyzing a total of more than two billion LOC. The performance of BabelRTS was similar to the state-of-the-art monoglot approaches on monoglot SUTs. On polyglot SUTs, BabelRTS was safer in polyglot mode and selected more tests for 60% of the commits than in monoglot mode, which missed inter-language dependencies.
- 27 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. 51 (5) , 1487-1499
BabelRTS: Polyglot Regression Test Selection
Regression test selection (RTS) approaches reduce the number of regression tests. Current RTS approaches are typically monoglot, i.e., their implementations target a specific language. However, many subjects under test (SUT) are polyglot, i.e., they use multiple languages. Running multiple monoglot RTS approaches separately on a polyglot SUT is unsafe because tests that involve inter-language dependencies can be missed. Moreover, a new language may require completely reimplementing an RTS approach, especially if the original implementation relies on language and runtime features that are not available in the new language. We propose a new static approach called BabelRTS, which is multilingual (supports multiple languages out of the box), polyglot (analyzes SUTs written in multiple languages), and extensible (allows adding support for new languages). A key contribution is the idea of encapsulating the language-specific aspects of RTS by using patterns and actions. A pattern specifies programming language constructs used in each file that indicate dependencies to other files written in the same or a different language. An action specifies how to identify these files in the codebase. Patterns and actions can be customized to support new languages without modifying the test selection algorithm. BabelRTS is not tied to a specific language run-time system or paradigm. BabelRTS currently supports 12 languages and 5 language combinations. We evaluated BabelRTS on 142 open-source monoglot and polyglot SUTs, analyzing a total of more than two billion LOC. The performance of BabelRTS was similar to the state-of-the-art monoglot approaches on monoglot SUTs. On polyglot SUTs, BabelRTS was safer in polyglot mode and selected more tests for 60% of the commits than in monoglot mode, which missed inter-language dependencies.
- 2 November 2024
- Published by Springer Nature
- p. 18-30
OnDiscuss: An Epistemic Network Analysis Learning Analytics Visualization Tool for Evaluating Asynchronous Online Discussions
- 2 November 2024
- Published by Springer Nature
- p. 18-30
OnDiscuss: An Epistemic Network Analysis Learning Analytics Visualization Tool for Evaluating Asynchronous Online Discussions
- Open Access
Impact of White-Box Adversarial Attacks on Convolutional Neural Networks
Autonomous vehicle navigation and healthcare diagnostics are among the many fields where the reliability and security of machine learning models for image data are critical. We conduct a comprehensive investigation into the susceptibility of Convolutional Neural Networks (CNNs), which are widely used for image data, to white-box adversarial attacks. We investigate the effects of various sophisticated attacks -- Fast Gradient Sign Method, Basic Iterative Method, Jacobian-based Saliency Map Attack, Carlini & Wagner, Projected Gradient Descent, and DeepFool -- on CNN performance metrics, (e.g., loss, accuracy), the differential efficacy of adversarial techniques in increasing error rates, the relationship between perceived image quality metrics (e.g., ERGAS, PSNR, SSIM, and SAM) and classification performance, and the comparative effectiveness of iterative versus single-step attacks. Using the MNIST, CIFAR-10, CIFAR-100, and Fashio_MNIST datasets, we explore the effect of different attacks on the CNNs performance metrics by varying the hyperparameters of CNNs. Our study provides insights into the robustness of CNNs against adversarial threats, pinpoints vulnerabilities, and underscores the urgent need for developing robust defense mechanisms to protect CNNs and ensuring their trustworthy deployment in real-world scenarios.
Open AccessImpact of White-Box Adversarial Attacks on Convolutional Neural Networks
Autonomous vehicle navigation and healthcare diagnostics are among the many fields where the reliability and security of machine learning models for image data are critical. We conduct a comprehensive investigation into the susceptibility of Convolutional Neural Networks (CNNs), which are widely used for image data, to white-box adversarial attacks. We investigate the effects of various sophisticated attacks -- Fast Gradient Sign Method, Basic Iterative Method, Jacobian-based Saliency Map Attack, Carlini & Wagner, Projected Gradient Descent, and DeepFool -- on CNN performance metrics, (e.g., loss, accuracy), the differential efficacy of adversarial techniques in increasing error rates, the relationship between perceived image quality metrics (e.g., ERGAS, PSNR, SSIM, and SAM) and classification performance, and the comparative effectiveness of iterative versus single-step attacks. Using the MNIST, CIFAR-10, CIFAR-100, and Fashio_MNIST datasets, we explore the effect of different attacks on the CNNs performance metrics by varying the hyperparameters of CNNs. Our study provides insights into the robustness of CNNs against adversarial threats, pinpoints vulnerabilities, and underscores the urgent need for developing robust defense mechanisms to protect CNNs and ensuring their trustworthy deployment in real-world scenarios.
- Open Access
- 4 December 2023
- Published by Association for Computing Machinery (ACM)
- p. 1-11
A Framework for Profiling Spatial Variability in the Performance of Classification Models
- 4 December 2023
- Published by Association for Computing Machinery (ACM)
- p. 1-11
Open AccessA Framework for Profiling Spatial Variability in the Performance of Classification Models
- Open Access
- 26 September 2023
- Published by Association for Computing Machinery (ACM)
- Vol. 26, 409-415
Teach Students to Study Using Quizzes, Study Behavior Visualization, and Reflection: A Case Study in an Introduction to Programming Course
Due to a long history of using rote memorization and rereading as the primary means to study, students are coming to the University with misconceptions about study strategies that are beneficial for their performance and long-term learning. Techniques such as spaced retrieval practice, interleaving, and metacognition are proven by cognitive and educational researchers as strategies that greatly improve learning. They focus on helping students to own responsibility for their learning and retention of information. Considering their benefits, quizzes were re-branded to be formative low-stakes retrieval practice activities (RPAs) in an Introduction to Programming Course (CS1), meaning that students would use the quizzes as learning tools, testing themselves in a spaced and interleaved manner as many times as they want during the semester. Additionally, the U-Behavior learning and teaching method was used. This method applies visualizations of student's study habits and self-reflections to help students to be aware of their study practices, reflect on them, and change their study routine to improve performance and long-term learning. Study behaviors were analyzed and the final Canvas exam, final coding exam, and final course grades were compared for students who spaced and interleaved their practice with students who did not. Results showed a statistically significant increase in all grades evaluated for students who practiced using this novel combination of spacing and interleaving integrated with U-Behavior visualizations and RPA reflection activities for learning.
- 26 September 2023
- Published by Association for Computing Machinery (ACM)
- Vol. 26, 409-415
Open AccessTeach Students to Study Using Quizzes, Study Behavior Visualization, and Reflection: A Case Study in an Introduction to Programming Course
Due to a long history of using rote memorization and rereading as the primary means to study, students are coming to the University with misconceptions about study strategies that are beneficial for their performance and long-term learning. Techniques such as spaced retrieval practice, interleaving, and metacognition are proven by cognitive and educational researchers as strategies that greatly improve learning. They focus on helping students to own responsibility for their learning and retention of information. Considering their benefits, quizzes were re-branded to be formative low-stakes retrieval practice activities (RPAs) in an Introduction to Programming Course (CS1), meaning that students would use the quizzes as learning tools, testing themselves in a spaced and interleaved manner as many times as they want during the semester. Additionally, the U-Behavior learning and teaching method was used. This method applies visualizations of student's study habits and self-reflections to help students to be aware of their study practices, reflect on them, and change their study routine to improve performance and long-term learning. Study behaviors were analyzed and the final Canvas exam, final coding exam, and final course grades were compared for students who spaced and interleaved their practice with students who did not. Results showed a statistically significant increase in all grades evaluated for students who practiced using this novel combination of spacing and interleaving integrated with U-Behavior visualizations and RPA reflection activities for learning.
- Open Access
- 2 March 2023
- Published by Association for Computing Machinery (ACM)
- p. 624-630
A Flexible Formative/Summative Grading System for Large Courses
Students in entry level CS courses come from diverse backgrounds and are learning study and time management skills. Our belief for their success is that they must master a growth mindset and that the final grade should represent their final mastery of topics in the course. Traditional grading systems tend to be too restrictive and hinder a growth mindset. They require strict deadlines that fail to easily account for student accommodations and learning differences. Furthermore, they run into averaging and scaling issues with 59% of a score counting as failing, making it difficult for students to redeem grades even if they later demonstrate mastery of topics. We designed a formative/summative grading system in our CS0 and CS1 classes for both on-campus and online students to support a structured growth mindset. Students can redo formative assignments and are provided flexible deadlines. They demonstrate their mastery in summative assignments. While being inspired by other grading systems, our system works seamlessly with auto-grading tools used in large, structured courses. Despite the flexibility, the courses provided a level of rigor before allowing students to continue onto the next course. Overall, 65% of students resubmitted assignments increasing their scores, participated in ungraded assignments, and used formative assignments for additional practice without a distinction between race or gender. These students went to the traditional follow-on CS2 course and 94% passed compared with 71% who took CS1 with a traditional grading system.
- 2 March 2023
- Published by Association for Computing Machinery (ACM)
- p. 624-630
Open AccessA Flexible Formative/Summative Grading System for Large Courses
Students in entry level CS courses come from diverse backgrounds and are learning study and time management skills. Our belief for their success is that they must master a growth mindset and that the final grade should represent their final mastery of topics in the course. Traditional grading systems tend to be too restrictive and hinder a growth mindset. They require strict deadlines that fail to easily account for student accommodations and learning differences. Furthermore, they run into averaging and scaling issues with 59% of a score counting as failing, making it difficult for students to redeem grades even if they later demonstrate mastery of topics. We designed a formative/summative grading system in our CS0 and CS1 classes for both on-campus and online students to support a structured growth mindset. Students can redo formative assignments and are provided flexible deadlines. They demonstrate their mastery in summative assignments. While being inspired by other grading systems, our system works seamlessly with auto-grading tools used in large, structured courses. Despite the flexibility, the courses provided a level of rigor before allowing students to continue onto the next course. Overall, 65% of students resubmitted assignments increasing their scores, participated in ungraded assignments, and used formative assignments for additional practice without a distinction between race or gender. These students went to the traditional follow-on CS2 course and 94% passed compared with 71% who took CS1 with a traditional grading system.
- Open Access
- 30 May 2022
- Published by Association for Computing Machinery (ACM)
- Vol. 21, 27-38
Detecting Secure Memory Deallocation Violations with CBMC
Scrubbing sensitive data before releasing memory is a widely accepted but often ignored programming practice for developing secure software. Consequently, confidential data such as cryptographic keys, passwords, and personal data, can remain in memory indefinitely, thereby increasing the risk of exposure to hackers who can retrieve the data using memory dumps or exploit vulnerabilities such as Heartbleed and Etherleak. We propose an approach for detecting a specific memory safety bug called Improper Clearing of Heap Memory Before Release, also known as Common Weakness Enumeration 244, in C programs. The CWE-244 bug in a program allows the leakage of confidential information when a variable is not wiped before heap memory is freed. Our approach combines taint analysis and model checking to detect this weakness. We have three main phases: (1) perform a coarse flow-insensitive inter-procedural static analysis on the program to construct a set of pointer variables that could point to sensitive data; (2) instrument the program with required dynamic variable tracking, and assertion logic for memory wiping before deallocation; and (3) invoke a model checker, the C-Bounded Model Checker (CBMC) in our case, to detect assertion violation in the instrumented program. We develop a tool, \toolname, implementing our instrumentation based algorithm, and we provide experimental validation on the Juliet Test Suite --- the tool is able to detect all the CWE-244 instances present in the test suite. To the best of our knowledge, this is the first work which presents a solution to the problem of detecting unscrubbed secure memory deallocation violations in programs.
- 30 May 2022
- Published by Association for Computing Machinery (ACM)
- Vol. 21, 27-38
Open AccessDetecting Secure Memory Deallocation Violations with CBMC
Scrubbing sensitive data before releasing memory is a widely accepted but often ignored programming practice for developing secure software. Consequently, confidential data such as cryptographic keys, passwords, and personal data, can remain in memory indefinitely, thereby increasing the risk of exposure to hackers who can retrieve the data using memory dumps or exploit vulnerabilities such as Heartbleed and Etherleak. We propose an approach for detecting a specific memory safety bug called Improper Clearing of Heap Memory Before Release, also known as Common Weakness Enumeration 244, in C programs. The CWE-244 bug in a program allows the leakage of confidential information when a variable is not wiped before heap memory is freed. Our approach combines taint analysis and model checking to detect this weakness. We have three main phases: (1) perform a coarse flow-insensitive inter-procedural static analysis on the program to construct a set of pointer variables that could point to sensitive data; (2) instrument the program with required dynamic variable tracking, and assertion logic for memory wiping before deallocation; and (3) invoke a model checker, the C-Bounded Model Checker (CBMC) in our case, to detect assertion violation in the instrumented program. We develop a tool, \toolname, implementing our instrumentation based algorithm, and we provide experimental validation on the Juliet Test Suite --- the tool is able to detect all the CWE-244 instances present in the test suite. To the best of our knowledge, this is the first work which presents a solution to the problem of detecting unscrubbed secure memory deallocation violations in programs.
- 1 April 2022
- Published by Elsevier in Journal of Systems and Software
- Vol. 186
An empirical comparison of four Java-based regression test selection techniques
- 1 April 2022
- Published by Elsevier in Journal of Systems and Software
- Vol. 186
An empirical comparison of four Java-based regression test selection techniques