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

Seyedeh Sepideh Emam

dblp:173/3843 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
1since 2021 · last 2022
0000-0002-6808-7128ORCID · reported

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

Software engineering, systems software and programming languages · 3 · 2 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 · 55% Software testing · 45%

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

TopicWeightPapersLastEvidence papers
Program analysis › specification mining
behavioral model inference
0.312018
Inferring Extended Probabilistic Finite-State Automaton Models from Software Executions · ACM Trans. Softw. Eng. Methodol. 2018
Software testing › regression testing
test case prioritization
0.212015
Test Case Prioritization Using Extended Digraphs · ACM Trans. Softw. Eng. Methodol. 2015
Program analysis
model inference
0.112018
Inferring Extended Probabilistic Finite-State Automaton Models from Software Executions · ACM Trans. Softw. Eng. Methodol. 2018
Software testing
model-based testing
0.112015
Test Case Prioritization Using Extended Digraphs · ACM Trans. Softw. Eng. Methodol. 2015
Software testing
regression testing
0.112015
Test Case Prioritization Using Extended Digraphs · ACM Trans. Softw. Eng. Methodol. 2015

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

reinforcement learning · 0.5hidden markov model · 0.5stochastic modeling · 0.3extended digraph · 0.2
YearPublicationVenuePosition
2022 Automatically inferring user behavior models in large-scale web applications
Saeedeh Sajjadi-Ghaem-Maghami, Seyedeh Sepideh Emam, James Miller 0001
Inf. Softw. Technol.2
2018 Inferring Extended Probabilistic Finite-State Automaton Models from Software Executions
abstract
Behavioral models are useful tools in understanding how programs work. Although several inference approaches have been introduced to generate extended finite-state automatons from software execution traces, they suffer from accuracy, flexibility, and decidability issues. In this article, we apply a hybrid technique to use both reinforcement learning and stochastic modeling to generate an extended probabilistic finite state automaton from software traces. Our approach—ReHMM (Reinforcement learning-based Hidden Markov Modelling)—is able to address the problems of inflexibility and un-decidability reported in other state-of-the-art approaches. Experimental results indicate that ReHMM outperforms other inference algorithms.
Seyedeh Sepideh Emam, James Miller 0001
ACM Trans. Softw. Eng. Methodol.1
2015 Test Case Prioritization Using Extended Digraphs
abstract
Although many test case prioritization techniques exist, their performance is far from perfect. Hence, we propose a new fault-based test case prioritization technique to promote fault-revealing test cases inmodel-based testing(MBT) procedures. We seek to improve the fault detection rate—a measure of how fast a test suite is able to detect faults during testing—in scenarios such as regression testing. We propose an extended digraph model as the basis of this new technique. The model is realized using a novelreinforcement-learning(RL)- and hidden-Markov-model (HMM)-based technique which is able to prioritize test cases for regression testing objectives. We present a method to initialize and train an HMM based upon RL concepts applied to an application's digraph model. The model prioritizes test cases based upon forward probabilities, a new test case prioritization approach. In addition, we also propose an alternative approach to prioritizing test cases according to the amount of change they cause in applications. To evaluate the effectiveness of the proposed techniques, we perform experiments ongraphical user interface(GUI)-based applications and compare the results with state-of-the-art test case prioritization approaches. The experimental results show that the proposed technique is able to detect faults early within test runs.
Seyedeh Sepideh Emam, James Miller 0001
ACM Trans. Softw. Eng. Methodol.1