Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Mohammad Jafar Mashhadi

dblp:238/1198 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
1since 2021 · last 2022
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 4 · 3 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
2 papers
Program analysis · 77% Software testing · 23%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Program analysis › specification mining
behavioral model inference
1.022022
Deep State Inference: Toward Behavioral Model Inference of Black-Box Software Systems · IEEE Trans. Software Eng. 2022
Hybrid Deep Neural Networks to Infer State Models of Black-Box Systems · ASE 2020
Program analysis
dynamic analysis
0.412020
Hybrid Deep Neural Networks to Infer State Models of Black-Box Systems · ASE 2020
Software testing
model-based testing
0.412020
Hybrid Deep Neural Networks to Infer State Models of Black-Box Systems · ASE 2020

Methods — techniques the papers use, named apart from their topics

deep learning · 0.6time series change point detection · 0.4recurrent neural network · 0.4convolutional neural network · 0.4
YearPublicationVenuePosition
2022 Deep State Inference: Toward Behavioral Model Inference of Black-Box Software Systems
Foozhan Ataiefard, Mohammad Jafar Mashhadi, Hadi Hemmati, Neil Walkinshaw
IEEE Trans. Software Eng.2
2020 Hybrid Deep Neural Networks to Infer State Models of Black-Box Systems
abstract
Inferring behavior model of a running software system is quite useful for several automated software engineering tasks, such as program comprehension, anomaly detection, and testing. Most existing dynamic model inference techniques are white-box, i.e., they require source code to be instrumented to get run-time traces. However, in many systems, instrumenting the entire source code is not possible (e.g., when using black-box third-party libraries) or might be very costly. Unfortunately, most black-box techniques that detect states over time are either univariate, or make assumptions on the data distribution, or have limited power for learning over a long period of past behavior. To overcome the above issues, in this paper, we propose a hybrid deep neural network that accepts as input a set of time series, one per input/output signal of the system, and applies a set of convolutional and recurrent layers to learn the non-linear correlations between signals and the patterns, over time. We have applied our approach on a real UAV auto-pilot solution from our industry partner with half a million lines of C code. We ran 888 random recent system-level test cases and inferred states, over time. Our comparison with several traditional time series change point detection techniques showed that our approach improves their performance by up to 102%, in terms of finding state change points, measured by F1 score. We also showed that our state classification algorithm provides on average 90.45% F1 score, which improves traditional classification algorithms by up to 17%.
Mohammad Jafar Mashhadi, Hadi Hemmati
ASE1
2019 An empirical study on practicality of specification mining algorithms on a real-world application
abstract
Dynamic model inference techniques have been the center of many research projects recently. There are now multiple open source implementations of state-of-the-art algorithms, which provide basic abstraction and merging capabilities. Most of these tools and algorithms have been developed with one particular application in mind, which is program comprehension. The output models can abstract away the details of the program and represent the software behaviour in a concise and easy to understand form. However, one application context that is less studied is using such inferred models for debugging, where the behaviour to abstract is a faulty behaviour (e.g., a set of execution traces including a failed test case). We tried to apply some of the existing model inference techniques in a real-world industrial context to support program comprehension for debugging. Our initial experiments have shown many limitations both in terms of implementation as well as the algorithms. The paper will discuss the root cause of the failures and proposes ideas for future improvement.
Mohammad Jafar Mashhadi, Hadi Hemmati
ICPC1
2019 Interactive semi-automated specification mining for debugging: An experience report
Mohammad Jafar Mashhadi, Taha R. Siddiqui, Hadi Hemmati, Howard W. Loewen
Inf. Softw. Technol.1