Shibbir Ahmed
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
Shibbir Ahmed has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Hridesh Rajan
Tulane University, New Orleans, USA
3 shared publications - Ragib Shahariar Ayon
Department of Computer Science, Texas State University, San Marcos, Texas, USA
3 shared publications - Rodion Podorozhny
Department of Computer Science, Texas State University, San Marcos, TX, USA
2 shared publications - Ali Ghanbari
Auburn University, Department of Computer Science and Software Engineering, Auburn, USA
1 shared publication - Ben Greenman
University of Utah, Salt Lake City, USA
1 shared publication - Breno Dantas Cruz
Iowa State University, Ames, USA
1 shared publication
Latest Publications
- Open Access
- 1 October 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Software Engineering
- Vol. 3 (ISSTA) , 3683-3704
Provably Lossless Acceleration of DNN Mutation Testing via Memoization
Mutation analysis has recently reemerged in the context of deep neural networks (DNNs) as a promising, but notoriously costly, approach for assessing test dataset adequacy. Existing techniques speed up DNN mutation testing through lossy approximations that trade efficiency for mutation score accuracy. This paper introduces Mure, the first provably lossless framework for accelerating DNN mutation testing via memoization. Mure is based on the idea that DNN mutants and the original model share substantial redundant computation, so during mutation testing, it executes only the mutated suffixes of each mutant and reuses the common prefix from the original model, which is computed only once. We give a formal account of memoized mutation testing, and prove that Mure is sound, i.e., it produces results equivalent to exhaustive vanilla mutation testing, and identify basic conditions under which speed-up is guaranteed. We have implemented Mure and evaluated it on 15 DNN models of various architectures, complexities, and sizes ranging from a few thousands to millions of parameters. This provides empirical evidence that Mure reduces the computational cost of mutation testing by 44.54%, on average. We also observed that while state-of-the-art techniques tend to yield higher acceleration (up to 88.97%, on average), they come at the cost of some error in mutation score. We further analyze the effect of mutation generation selection ratio on the effectiveness of Mure and observed predictable reductions in memoization opportunities with increasing the percentage of mutated neurons. We observed that Mure offers more than 20% speed-up even when as high as 5% of the neurons are mutated.
- 1 October 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Software Engineering
- Vol. 3 (ISSTA) , 3683-3704
Open AccessProvably Lossless Acceleration of DNN Mutation Testing via Memoization
Mutation analysis has recently reemerged in the context of deep neural networks (DNNs) as a promising, but notoriously costly, approach for assessing test dataset adequacy. Existing techniques speed up DNN mutation testing through lossy approximations that trade efficiency for mutation score accuracy. This paper introduces Mure, the first provably lossless framework for accelerating DNN mutation testing via memoization. Mure is based on the idea that DNN mutants and the original model share substantial redundant computation, so during mutation testing, it executes only the mutated suffixes of each mutant and reuses the common prefix from the original model, which is computed only once. We give a formal account of memoized mutation testing, and prove that Mure is sound, i.e., it produces results equivalent to exhaustive vanilla mutation testing, and identify basic conditions under which speed-up is guaranteed. We have implemented Mure and evaluated it on 15 DNN models of various architectures, complexities, and sizes ranging from a few thousands to millions of parameters. This provides empirical evidence that Mure reduces the computational cost of mutation testing by 44.54%, on average. We also observed that while state-of-the-art techniques tend to yield higher acceleration (up to 88.97%, on average), they come at the cost of some error in mutation score. We further analyze the effect of mutation generation selection ratio on the effectiveness of Mure and observed predictable reductions in memoization opportunities with increasing the percentage of mutated neurons. We observed that Mure offers more than 20% speed-up even when as high as 5% of the neurons are mutated.
- Open Access
- 5 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1404-1405
Requirement-Guided Test-Driven Development for Modular Code Generation with Large Language Model
- 5 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1404-1405
Open AccessRequirement-Guided Test-Driven Development for Modular Code Generation with Large Language Model
- Open Access
- 5 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 237-241
SpecPylot: Python Specification Generation with Large Language Models
- 5 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 237-241
Open AccessSpecPylot: Python Specification Generation with Large Language Models
- Open Access
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 448-452
Precise LLM-based Semantic Slicing for Deadlock Detection in Concurrent Java Programs
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 448-452
Open AccessPrecise LLM-based Semantic Slicing for Deadlock Detection in Concurrent Java Programs
- Open Access
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 29-39
AutoReSpec: A Framework for Generating Specification using Large Language Models
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 29-39
Open AccessAutoReSpec: A Framework for Generating Specification using Large Language Models
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Pulse
- Vol. 17 (1) , 66-68
AutoJML: Generation and Verification of JML Specifications Using LLM Agents
Formal specifications such as Java Modeling Language (JML) are essential for program verification, but are complex and error-prone to write manually. Although recent large language model (LLM) based approaches automate specification generation, they often struggle with complex control flow and semantic completeness. We present AutoJML, an LLM agent that generates and refines JML specifications using iterative verification and mutation-based feedback. Evaluated on Java programs with diverse control flow patterns, AutoJML verifies more programs than a state-of-the-art baseline, particularly for multipath and nested loop programs.
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Pulse
- Vol. 17 (1) , 66-68
AutoJML: Generation and Verification of JML Specifications Using LLM Agents
Formal specifications such as Java Modeling Language (JML) are essential for program verification, but are complex and error-prone to write manually. Although recent large language model (LLM) based approaches automate specification generation, they often struggle with complex control flow and semantic completeness. We present AutoJML, an LLM agent that generates and refines JML specifications using iterative verification and mutation-based feedback. Evaluated on Java programs with diverse control flow patterns, AutoJML verifies more programs than a state-of-the-art baseline, particularly for multipath and nested loop programs.
- Open Access
- 6 February 2024
- Published by Association for Computing Machinery (ACM)
- p. 1-13
Inferring Data Preconditions from Deep Learning Models for Trustworthy Prediction in Deployment
- 6 February 2024
- Published by Association for Computing Machinery (ACM)
- p. 1-13
Open AccessInferring Data Preconditions from Deep Learning Models for Trustworthy Prediction in Deployment
- Open Access
- 30 November 2023
- Published by Association for Computing Machinery (ACM)
- p. 94-106
Design by Contract for Deep Learning APIs
Deep Learning (DL) techniques are increasingly being incorporated in critical software systems today. DL software is buggy too. Recent work in SE has characterized these bugs, studied fix patterns, and proposed detection and localization strategies. In this work, we introduce a preventative measure. We propose design by contract for DL libraries, DL Contract for short, to document the properties of DL libraries and provide developers with a mechanism to identify bugs during development. While DL Contract builds on the traditional design by contract techniques, we need to address unique challenges. In particular, we need to document properties of the training process that are not visible at the functional interface of the DL libraries. To solve these problems, we have introduced mechanisms that allow developers to specify properties of the model architecture, data, and training process. We have designed and implemented DL Contract for Python-based DL libraries and used it to document the properties of Keras, a well-known DL library. We evaluate DL Contract in terms of effectiveness, runtime overhead, and usability. To evaluate the utility of DL Contract, we have developed 15 sample contracts specifically for training problems and structural bugs. We have adopted four well-vetted benchmarks from prior works on DL bug detection and repair. For the effectiveness, DL Contract correctly detects 259 bugs in 272 real-world buggy programs, from well-vetted benchmarks provided in prior work on DL bug detection and repair. We found that the DL Contract overhead is fairly minimal for the used benchmarks. Lastly, to evaluate the usability, we conducted a survey of twenty participants who have used DL Contract to find and fix bugs. The results reveal that DL Contract can be very helpful to DL application developers when debugging their code.
- 30 November 2023
- Published by Association for Computing Machinery (ACM)
- p. 94-106
Open AccessDesign by Contract for Deep Learning APIs
Deep Learning (DL) techniques are increasingly being incorporated in critical software systems today. DL software is buggy too. Recent work in SE has characterized these bugs, studied fix patterns, and proposed detection and localization strategies. In this work, we introduce a preventative measure. We propose design by contract for DL libraries, DL Contract for short, to document the properties of DL libraries and provide developers with a mechanism to identify bugs during development. While DL Contract builds on the traditional design by contract techniques, we need to address unique challenges. In particular, we need to document properties of the training process that are not visible at the functional interface of the DL libraries. To solve these problems, we have introduced mechanisms that allow developers to specify properties of the model architecture, data, and training process. We have designed and implemented DL Contract for Python-based DL libraries and used it to document the properties of Keras, a well-known DL library. We evaluate DL Contract in terms of effectiveness, runtime overhead, and usability. To evaluate the utility of DL Contract, we have developed 15 sample contracts specifically for training problems and structural bugs. We have adopted four well-vetted benchmarks from prior works on DL bug detection and repair. For the effectiveness, DL Contract correctly detects 259 bugs in 272 real-world buggy programs, from well-vetted benchmarks provided in prior work on DL bug detection and repair. We found that the DL Contract overhead is fairly minimal for the used benchmarks. Lastly, to evaluate the usability, we conducted a survey of twenty participants who have used DL Contract to find and fix bugs. The results reveal that DL Contract can be very helpful to DL application developers when debugging their code.
- Open Access
- 30 November 2021
- Published by Association for Computing Machinery (ACM) in ACM/IMS Transactions on Data Science
- Vol. 2 (4) , 1-25
Semantics and Anomaly Preserving Sampling Strategy for Large-Scale Time Series Data
We propose PASS , a O ( n ) algorithm for data reduction that is specifically aimed at preserving the semantics of time series data visualization in the form of line chart. Visualization of large trend line data is a challenge and current sampling approaches do produce reduction but result in loss of semantics and anomalous behavior. We have evaluated PASS using seven large and well-vetted datasets (Taxi, Temperature, DEBS challenge 2012-2014 dataset, New York Stock Exchange data, and Integrated Surface Data) and found that it has several benefits when compared to existing state-of-the-art time series data reduction techniques. First, it can preserve the semantics of the trend. Second, the visualization quality using the reduced data from PASS is very close to the original visualization. Third, the anomalous behavior is preserved and can be well observed from the visualizations created using the reduced data. We have conducted two user surveys collecting 3,000+ users’ responses for visual preference as well as perceptual effectiveness and found that the users prefer PASS over other techniques for different datasets. We also compare PASS using visualization metrics where it outperforms other techniques in five out of the seven datasets.
- 30 November 2021
- Published by Association for Computing Machinery (ACM) in ACM/IMS Transactions on Data Science
- Vol. 2 (4) , 1-25
Open AccessSemantics and Anomaly Preserving Sampling Strategy for Large-Scale Time Series Data
We propose PASS , a O ( n ) algorithm for data reduction that is specifically aimed at preserving the semantics of time series data visualization in the form of line chart. Visualization of large trend line data is a challenge and current sampling approaches do produce reduction but result in loss of semantics and anomalous behavior. We have evaluated PASS using seven large and well-vetted datasets (Taxi, Temperature, DEBS challenge 2012-2014 dataset, New York Stock Exchange data, and Integrated Surface Data) and found that it has several benefits when compared to existing state-of-the-art time series data reduction techniques. First, it can preserve the semantics of the trend. Second, the visualization quality using the reduced data from PASS is very close to the original visualization. Third, the anomalous behavior is preserved and can be well observed from the visualizations created using the reduced data. We have conducted two user surveys collecting 3,000+ users’ responses for visual preference as well as perceptual effectiveness and found that the users prefer PASS over other techniques for different datasets. We also compare PASS using visualization metrics where it outperforms other techniques in five out of the seven datasets.