Saeed Parsa

dblp:25/2982 · DBLP profile ↗
← Back
50ranked-venue papers
15as first author
18since 2021 · last 2025
0000-0003-4381-2773ORCID · corroborated

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

Software engineering, systems software and programming languages · 16 · 2 first-author · 8 since 2021Systems, architecture and hardware · 12 · 6 first-author · 1 since 2021Artificial intelligence and machine learning · 7 · 7 since 2021Applied, interdisciplinary, general and emerging computing · 6 · 3 first-authorDatabases, data management, data science and information retrieval · 3 · 2 since 2021Computer networks · 2Security and privacy · 2 · 1 since 2021Human-computer interaction and ubiquitous computing · 2 · 2 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 1 since 2021Theory of computation · 1 · 1 first-author
YearPublicationVenuePosition
2025 A systematic literature review on transformation for testability techniques in software systems
Fateme Bagheri-Galle, Saeed Parsa, Morteza Zakeri Nasrabadi
Inf. Softw. Technol.2
2025 Enhancing logic-based testing with EvoDomain: A search-based domain-oriented test suite generation approach
Akram Kalaee, Saeed Parsa, Zahra Mansouri
Inf. Softw. Technol.2
2025 SBFL fault localization considering fault-proneness
Reza Torkashvan, Saeed Parsa, Babak Vaziri
J. Syst. Softw.2
2025 Metamorphic testing of deep neural network-based autonomous driving systems using behavioural domain adequacy
Akram Kalaee, Saeed Parsa
Neural Comput. Appl.2
2025 Efficient path coverage-based test data generation using an enhanced pelican algorithm
Mojtaba Salehi, Saeed Parsa, Saba Joudaki, Hoshang Kolivand
J. Supercomput.2
2024 Supporting single responsibility through automated extract method refactoring
Alireza Ardalani, Saeed Parsa, Morteza Zakeri Nasrabadi, Alexander Chatzigeorgiou
Empir. Softw. Eng.2
2024 Measuring and improving software testability at the design level
Morteza Zakeri Nasrabadi, Saeed Parsa, Sadegh Jafari
Inf. Softw. Technol.2
2024 Grading the severity of diabetic retinopathy using an ensemble of self-supervised pre-trained convolutional neural networks: ESSP-CNNs
Saeed Parsa, Toktam Khatibi
Multim. Tools Appl.1
2024 Natural language requirements testability measurement based on requirement smells
Morteza Zakeri Nasrabadi, Saeed Parsa
Neural Comput. Appl.2
2024 Dynamic domain testing with multi-agent Markov chain Monte Carlo method
Roshan Golmohammadi, Saeed Parsa, Morteza Zakeri Nasrabadi
Soft Comput.2
2023 COSMOS: A comprehensive framework for automatically generating domain-oriented test suite
Akram Kalaee, Saeed Parsa, Negar Fathi
Inf. Softw. Technol.2
2023 Sober: Explores for invasive behaviour of malware
Mohammad Hadi Alaeiyan, Saeed Parsa, P. Vinod 0001
J. Inf. Secur. Appl.2
2023 A systematic literature review on source code similarity measurement and clone detection: Techniques, applications, and challenges
Morteza Zakeri Nasrabadi, Saeed Parsa, Mohammad Ramezani, Chanchal Kumar Roy, Masoud Ekhtiarzadeh
J. Syst. Softw.2
2022 Front Cover: International Journal of Intelligent Systems, Volume 37 Issue 8 August 2022
abstract
Front Cover Caption: The cover image is based on the Research Article Learning to predict test effectiveness by Morteza Zakeri-Nasrabadi and Saeed Parsa https://doi.org/10.1002/int.22722.
Morteza Zakeri Nasrabadi, Saeed Parsa
Int. J. Intell. Syst.2
2022 Learning to predict test effectiveness
abstract
The high cost of the test can be dramatically reduced, provided that the coverability as an inherent feature of the code under test is predictable. This article offers a machine learning model to predict the extent to which the test could cover a class in terms of a new metric called Coverageability. The prediction model consists of an ensemble of four regression models. The learning samples consist of feature vectors, where features are source code metrics computed for a class. The samples are labeled by the Coverageability values computed for their corresponding classes. We offer a mathematical model to evaluate test effectiveness in terms of size and coverage of the test suite generated automatically for each class. We extend the size of the feature space by introducing a new approach to define submetrics in terms of existing source code metrics. Using feature importance analysis on the learned prediction models, we sort sources code metrics in the order of their impact on the test effectiveness. As a result of which we found the class strict cyclomatic complexity as the most influential source code metric. Our experiments with our prediction models on a large corpus of Java projects containing about 23,000 classes demonstrate the Mean Absolute Error (MAE) of 0.032, Mean-Squared Error (MSE) of 0.004, and an R2 score of 0.855. Compared with the state-of-the-art coverage prediction models, our models improve MAE, MSE, and an R2 score by 5.78%, 2.84%, and 20.71%, respectively.
Morteza Zakeri Nasrabadi, Saeed Parsa
Int. J. Intell. Syst.2
2022 A New Semi-Automated Method for Service Identification
abstract
Service identification plays a key role in the design of service-oriented systems. There are non-model-based and model-based methods for extracting services from business processes. These methods suggest a set of mostly descriptive solutions that do not pay sufficient attention to service design guidelines and the conceptual relations between tasks. The challenge is to develop an algorithm to automatically identify services from business processes to simplify the analysis and reduce the gap between information technology and business needs. In this paper, we develop a semi-automated service identification method that addresses this gap. This method incorporates the Goal, Data, and Business Process Models (BPM) to identify services based on related tasks, shared data, and business requirements. It advances previous methods by simultaneously considering both semantic and structural relations between tasks which permits better and more accurate identification of services. Moreover, the proposed method considers the principles of service design such as internal cohesion of service methods, loose coupling of services, and reusability of the identified services.
Shahrzad Hekmat, Saeed Parsa, Babak Vaziri
J. Web Eng.2
2021 Format-aware learn&fuzz: deep test data generation for efficient fuzzing
Morteza Zakeri Nasrabadi, Saeed Parsa, Akram Kalaee
Neural Comput. Appl.2
2021 Heat transfer relation-based optimization algorithm (HTOA)
Foad Asef, Vahid Majidnezhad, Mohammad-Reza Feizi-Derakhshi, Saeed Parsa
Soft Comput.4
2020 Detection of algorithmically-generated domains: An adversarial machine learning approach
Mohammad Hadi Alaeiyan, Saeed Parsa, P. Vinod 0001, Mauro Conti
Comput. Commun.2
2020 SMBFL: slice-based cost reduction of mutation-based fault localization
Nazanin Bayati Chaleshtari, Saeed Parsa
Empir. Softw. Eng.2
2020 Detecting botnet by using particle swarm optimization algorithm based on voting system
Mehdi Asadi, Mohammad Ali Jabraeil Jamali, Saeed Parsa, Vahid Majidnezhad
Future Gener. Comput. Syst.3
2020 FCCI: A fuzzy expert system for identifying coincidental correct test cases
Arash Sabbaghi, Mohammad Reza Keyvanpour, Saeed Parsa
J. Syst. Softw.3
2020 Improving dynamic domain reduction test data generation method by Euler/Venn reasoning system
Esmaeel Nikravan, Saeed Parsa
Softw. Qual. J.2
2020 A Multilabel Fuzzy Relevance Clustering System for Malware Attack Attribution in the Edge Layer of Cyber-Physical Networks
abstract
The rapid increase in the number of malicious programs has made malware forensics a daunting task and caused users’ systems to become in danger. Timely identification of malware characteristics including its origin and the malware sample family would significantly limit the potential damage of malware. This is a more profound risk in Cyber-Physical Systems (CPSs), where a malware attack may cause significant physical damage to the infrastructure. Due to limited on-device available memory and processing power in CPS devices, most of the efforts for protecting CPS networks are focused on the edge layer, where the majority of security mechanisms are deployed. Since the majority of advanced and sophisticated malware programs are combining features from different families, these malicious programs are not similar enough to any existing malware family and easily evade binary classifier detection. Therefore, in this article, we propose a novel multilabel fuzzy clustering system for malware attack attribution. Our system is deployed on the edge layer to provide insight into applicable malware threats to the CPS network. We leverage static analysis by utilizing Opcode frequencies as the feature space to classify malware families. We observed that a multilabel classifier does not classify a part of samples. We named this problem the instance coverage problem. To overcome this problem, we developed an ensemble-based multilabel fuzzy classification method to suggest the relevance of a malware instance to the stricken families. This classifier identified samples of VirusShare, RansomwareTracker, and BIG2015 with an accuracy of 94.66%, 94.26%, and 97.56%, respectively.
Mohammad Hadi Alaeiyan, Ali Dehghantanha, Tooska Dargahi, Mauro Conti, Saeed Parsa
ACM Trans. Cyber Phys. Syst.5
2019 Analysis and classification of context-based malware behavior
Mohammad Hadi Alaeiyan, Saeed Parsa, Mauro Conti
Comput. Commun.2
2019 Inforence: effective fault localization based on information-theoretic analysis and statistical causal inference
Farid Feyzi, Saeed Parsa
Frontiers Comput. Sci.2
2019 Automatic test cases generation from business process models
Arezoo Yazdani Seqerloo, Mohammad Javad Amiri, Saeed Parsa, Mahnaz Koupaee
Requir. Eng.3
2019 A reasoning-based approach to dynamic domain reduction in test data generation
Esmaeel Nikravan, Saeed Parsa
Int. J. Softw. Tools Technol. Transf.2
2018 Mining malicious behavioural patterns
abstract
Most malware producers bypass signature‐based detections through obfuscation techniques. Therefore, in order to provide proactive and real‐time protection, the researchers have begun to develop strategies for behaviour‐based detection. Despite of being a popular and promising non‐deterministic solution to detect various forms of malware families, behavioural modelling techniques suffer from relatively high false positive rate in malware detection. To overcome this problem, the authors shall seek for identifying patterns, representing malicious intent in all instances of a malware family. In this study, they propose a new technique based on discriminative graph mining techniques to identify discriminative subgraphs. The subgraphs represent behavioural patterns in each malware family. Their evaluation results demonstrate an average of 91% accuracy in detection of malicious programme behaviours, with no false positive.
Hassan Seifi, Saeed Parsa
IET Inf. Secur.2
2018 FPA-FL: Incorporating static fault-proneness analysis into statistical fault localization
Farid Feyzi, Saeed Parsa
J. Syst. Softw.2
2017 QABPEM: Quality-Aware Business Process Engineering Method
abstract
In this paper, a novel business process engineering method based on quality assessment is proposed. In the proposed method, a goal model is used to estimate the operational costs of business processes. Goals scenarios in the goal model of desired information systems are applied as a basis for estimating the design cost. Qualities of business requirements models and business process models are also estimated. Based on the quality metrics, the process of business process modeling is examined. Then, using XOR operator in the goal model, a simple and direct mapping of the goal model to the business process model is introduced. Common activities in the business process model are further factored and summarized using pre- and post-factoring operations. The proposed business process modeling method is language-independent. An ICT office in Mazandaran Power Distribution Company is used as a case study to exemplify QABPEM. Our evaluation results demonstrates the capability of the proposed method compared with the existing ones.
Majid Aboutalebi, Saeed Parsa
Int. J. Cooperative Inf. Syst.2
2015 A Hybrid Syntactic and Semantic Approach to Service Identification in Collaborative Networks
Ehsan Alirezaei, Saeed Parsa
PRO-VE2
2015 Modeling flow information of loops using compositional condition of controls
Saeed Parsa, Mehdi Sakhaei-nia
J. Supercomput.1
2014 Hierarchy-Debug: a scalable statistical technique for fault localization
Saeed Parsa, Mojtaba Vahidi-Asl, Maryam Asadi-Aghbolaghi
Softw. Qual. J.1
2013 Task graph pre-scheduling, using Nash equilibrium in game theory
Marjan Abdeyazdan, Saeed Parsa, Amir Masoud Rahmani
J. Supercomput.2
2012 Data locality optimization of interference graphs based on polyhedral computations
Hassan Motallebi, Saeed Parsa
J. Supercomput.2
2012 Task dispatching approach to reduce the number of waiting tasks in grid environments
Saeed Parsa, Reza Entezari-Maleki
J. Supercomput.1
2011 Software Fault Localization via Mining Execution Graphs
Saeed Parsa, Somaye Arabi Naree, Neda Ebrahimi Koopaei
ICCSA (2)1
2011 Fuzzy Clustering the Backward Dynamic Slices of Programs to Identify the Origins of Failure
Saeed Parsa, Farzaneh Zareie, Mojtaba Vahidi-Asl
SEA1
2009 Semi-automatic Transformation of Sequential Code to Distributed Code Using Model Driven Architecture Approach
abstract
In this paper, a Model Driven Architecture (MDA) approach is applied to Semi-automatically translate sequential programs into corresponding distributed code. The novelty of our work is the use of MDA in the process of translating serial into distributed code. The transformation comprises automatic generation of platform independent and then platform specific models from the sequential code. In order to generate the PIM, a meta-model defining the overall architecture of the resultant distributed code is developed. The meta-model is used as a basis for the development of platform independent models (PIM) for the resultant distributed code. A set of transformation rules are defined to transform the resulted PIM into a corresponding platform-specific model. These transformation rules can be modified by the user, depending on the details of the underlying middle-ware applied for the distribution. The platform independent model provides a better understanding of the distributed code and helps the programmer to modify the code more easily.
Siamak Najjar Karimi, Saeed Parsa
ISPA2
2009 Parallel loop generation and scheduling
Shahriar Lotfi, Saeed Parsa
J. Supercomput.2
2007 Seamless Secure Development of Systems: From Modeling to Enforcement of Access Control Policies
abstract
Despite the emphasis on removing gap between software models and implementation code, there has been made little effort to apply software tools to enforce access control models directly into program code. In this paper the design and implementation of an access control policy enforcement environment is described. Within this environment, view-based access control policies defined in XML Metadata Interchange format are translated into view policy language. The view policy language primitives are then easily translated into Java primitives. At last, these primitives are enforced into Java program code to be secured. Two major benefits of applying the proposed approach for modeling and enforcement of access control policies are rapid development of view-based customized applications and secure enforcement of ordered chain of methods' executions.
Saeed Parsa, Morteza Damanafshan
AICCSA1
2007 Formal Specification and Implementation of an Environment for Automatic Distribution
Saeed Parsa, Omid Bushehrian
GPC1
2007 Credibility Assignment in Knowledge Grid Environment
Saeed Parsa, Fereshteh-Azadi Parand
GPC1
2007 A Comparison of Grid Computing systems and Globus by the application of auditing
abstract
Doing changes and adding new requirement to existing software systems, turns their primary architecture and force a huge expenditure. It is time and cost consummating. Today for preventing this problem, the method of reengineering is used. One of most known and common kind of reengineering is comparing current architecture with primary architecture or another known suitable sample. The described method in this paper is comparing Globus software architecture with implemented systems under grid. This comparison first reveals the developed software systems weaknesses and then explains incorrect usage of Globus pieces. Finally using the offered implemented sample in this paper, success level of reverse engineering to find problems in developed systems is identified and the offered method will be tested as well.
Saeed Parsa, Najmeh Torabian
SERA1
2007 Cooperative decision making in a knowledge grid environment
Saeed Parsa, Fereshteh-Azadi Parand
Future Gener. Comput. Syst.1
2006 Automatic Distribution of Sequential Code Using JavaSymphony Middleware
Saeed Parsa, Vahid Khalilpoor
SOFSEM1
2006 A New Approach to Parallelization of Serial Nested Loops Using Genetic Algorithms
Saeed Parsa, Shahriar Lotfi
J. Supercomput.1
2006 A New Genetic Algorithm for Loop Tiling
Saeed Parsa, Shahriar Lotfi
J. Supercomput.1
2005 The Design and Implementation of a Framework for Automatic Modularization of Software Systems
Saeed Parsa, Omid Bushehrian
J. Supercomput.1