Mohammad Mehdi Pourhashem Kallehbasti
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Mohammad Mehdi Pourhashem Kallehbasti has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Ali Ghanbari Sorkhi
Department of Electrical and Computer Engineering University of Science and Technology of Mazandaran Behshahr Iran
4 shared publications - Jamshid Pirgazi
Department of Electrical and Computer Engineering, University of Science and Technology of Mazandaran, Behshahr, Iran
4 shared publications - Ali Kermani
Electrical & Computer Engineering Department, University of Science & Technology of Mazandaran, Behshahr, Iran
2 shared publications - Matteo Rossi
Politecnico di Milano
2 shared publications - Arya Kavian
University of Science and Technology of Mazandaran, Iran
1 shared publication - Ehsan Firouzi
TU Clausthal, Germany
1 shared publication
Latest Publications
- Open Access
- 22 May 2026
- Published by Association for Computing Machinery (ACM) in Formal Aspects of Computing
- Vol. 38 (3) , 1-31
OLTL: An Optimization Extension of Linear Temporal Logic
Linear Temporal Logic (LTL) can be used for problem-solving when all problem constraints can be specified in this logic through the use of satisfiability checking techniques. In optimization problems such as scheduling with preferences, where constraints are primarily temporal, LTL is a desirable specification formalism. However, LTL cannot be used as a standalone formalism due to the fact that it is unable to specify soft constraints. This paper introduces Optimization LTL (OLTL), an optimization-oriented extension of LTL that can specify both hard and soft constraints in optimization problems. The syntax, semantics and basic formal properties of this logic are presented, along with an encoding based on bit-vector logic and Linear Real Arithmetic (LRA). Additionally, a tool called LiTeLLab ’ ( Li near Te mporal L ogic Lab oratory) is introduced to solve optimization problems specified by OLTL. The feasibility and scalability of using OLTL as a specification formalism is demonstrated through two case studies. These problems, with multiple optimization parameters, are specified in OLTL and LiTeLLab ’ successfully generates optimal solutions.
- 22 May 2026
- Published by Association for Computing Machinery (ACM) in Formal Aspects of Computing
- Vol. 38 (3) , 1-31
Open AccessOLTL: An Optimization Extension of Linear Temporal Logic
Linear Temporal Logic (LTL) can be used for problem-solving when all problem constraints can be specified in this logic through the use of satisfiability checking techniques. In optimization problems such as scheduling with preferences, where constraints are primarily temporal, LTL is a desirable specification formalism. However, LTL cannot be used as a standalone formalism due to the fact that it is unable to specify soft constraints. This paper introduces Optimization LTL (OLTL), an optimization-oriented extension of LTL that can specify both hard and soft constraints in optimization problems. The syntax, semantics and basic formal properties of this logic are presented, along with an encoding based on bit-vector logic and Linear Real Arithmetic (LRA). Additionally, a tool called LiTeLLab ’ ( Li near Te mporal L ogic Lab oratory) is introduced to solve optimization problems specified by OLTL. The feasibility and scalability of using OLTL as a specification formalism is demonstrated through two case studies. These problems, with multiple optimization parameters, are specified in OLTL and LiTeLLab ’ successfully generates optimal solutions.
- 3 May 2026
- Published by Wiley in Software: Practice and Experience
- Vol. 56 (7) , 944-957
An Adaptive Hybrid Recommender System for Requirements Reuse
Introduction: Requirements engineering plays a crucial role in the software development lifecycle, encompassing the elicitation, analysis, specification, and validation of requirements. Inefficiencies in any of these processes can lead to delays, budget overruns, and even project failure. This paper explores the integration of requirements reuse and recommender systems to enhance the elicitation process by leveraging historical project data and stakeholder interaction patterns. Methods: The proposed methodology incorporates a hybrid approach that combines collaborative filtering and content‐based filtering to recommend relevant requirements to stakeholders. A dynamic weighting framework adjusts the contributions of these two approaches based on the availability of data. In situations with insufficient qualified data, the approach relies more heavily on content‐based filtering to address challenges such as data sparsity and the cold‐start problem. To enhance the semantic similarity between requirements, the method aggregates GloVe word vectors with domain‐specific TF‐IDF scores to identify software engineering‐specific vocabulary. Results: Experimental evaluation using a benchmark dataset demonstrates that the proposed hybrid approach significantly improves the prediction accuracy of relevant requirements recommendations, compared to traditional methods. Conclusion: The integration of requirements reuse with a recommender system that combines collaborative and content‐based filtering offers an effective solution to streamline the elicitation process, mitigate risks of overlooking critical requirements, and save time during the evaluation and selection of requirements. The proposed method improves the efficiency and accuracy of requirements engineering, especially in contexts with limited data availability.
- 3 May 2026
- Published by Wiley in Software: Practice and Experience
- Vol. 56 (7) , 944-957
An Adaptive Hybrid Recommender System for Requirements Reuse
Introduction: Requirements engineering plays a crucial role in the software development lifecycle, encompassing the elicitation, analysis, specification, and validation of requirements. Inefficiencies in any of these processes can lead to delays, budget overruns, and even project failure. This paper explores the integration of requirements reuse and recommender systems to enhance the elicitation process by leveraging historical project data and stakeholder interaction patterns. Methods: The proposed methodology incorporates a hybrid approach that combines collaborative filtering and content‐based filtering to recommend relevant requirements to stakeholders. A dynamic weighting framework adjusts the contributions of these two approaches based on the availability of data. In situations with insufficient qualified data, the approach relies more heavily on content‐based filtering to address challenges such as data sparsity and the cold‐start problem. To enhance the semantic similarity between requirements, the method aggregates GloVe word vectors with domain‐specific TF‐IDF scores to identify software engineering‐specific vocabulary. Results: Experimental evaluation using a benchmark dataset demonstrates that the proposed hybrid approach significantly improves the prediction accuracy of relevant requirements recommendations, compared to traditional methods. Conclusion: The integration of requirements reuse with a recommender system that combines collaborative and content‐based filtering offers an effective solution to streamline the elicitation process, mitigate risks of overlooking critical requirements, and save time during the evaluation and selection of requirements. The proposed method improves the efficiency and accuracy of requirements engineering, especially in contexts with limited data availability.
- Open Access
- 1 October 2024
- Published by Maad Rayan Publishing Company in BioImpacts
- Vol. 15, 30340
An efficient hybrid filter-wrapper method based on improved Harris Hawks optimization for feature selection
Introduction: High-dimensional datasets often contain an abundance of features, many of which are irrelevant to the subject of interest. This issue is compounded by the frequently low number of samples and imbalanced class samples. These factors can negatively impact the performance of classification algorithms, necessitating feature selection before classification. The primary objective of feature selection algorithms is to identify a minimal subset of features that enables accurate classification. Methods: In this paper, we propose a two-stage hybrid method for the optimal selection of relevant features. In the first stage, a filter method is employed to assign weights to the features, facilitating the removal of redundant and irrelevant features and reducing the computational cost of classification algorithms. A subset of high-weight features is retained for further processing in the second stage. In this stage, an enhanced Harris Hawks Optimization algorithm and GRASP, augmented with crossover and mutation operators from genetic algorithms, are utilized based on the weights calculated in the first stage to identify the optimal feature set. Results: Experimental results demonstrate that the proposed algorithm successfully identifies the optimal subset of features. Conclusion: The two-stage hybrid method effectively selects the optimal subset of features, improving the performance of classification algorithms on high-dimensional datasets. This approach addresses the challenges posed by the abundance of features, low number of samples, and imbalanced class samples, demonstrating its potential for application in various fields.
- 1 October 2024
- Published by Maad Rayan Publishing Company in BioImpacts
- Vol. 15, 30340
Open AccessAn efficient hybrid filter-wrapper method based on improved Harris Hawks optimization for feature selection
Introduction: High-dimensional datasets often contain an abundance of features, many of which are irrelevant to the subject of interest. This issue is compounded by the frequently low number of samples and imbalanced class samples. These factors can negatively impact the performance of classification algorithms, necessitating feature selection before classification. The primary objective of feature selection algorithms is to identify a minimal subset of features that enables accurate classification. Methods: In this paper, we propose a two-stage hybrid method for the optimal selection of relevant features. In the first stage, a filter method is employed to assign weights to the features, facilitating the removal of redundant and irrelevant features and reducing the computational cost of classification algorithms. A subset of high-weight features is retained for further processing in the second stage. In this stage, an enhanced Harris Hawks Optimization algorithm and GRASP, augmented with crossover and mutation operators from genetic algorithms, are utilized based on the weights calculated in the first stage to identify the optimal feature set. Results: Experimental results demonstrate that the proposed algorithm successfully identifies the optimal subset of features. Conclusion: The two-stage hybrid method effectively selects the optimal subset of features, improving the performance of classification algorithms on high-dimensional datasets. This approach addresses the challenges posed by the abundance of features, low number of samples, and imbalanced class samples, demonstrating its potential for application in various fields.
- Open Access
- 18 June 2024
- Published by Association for Computing Machinery (ACM)
- p. 600-603
LLM Security Guard for Code
Many developers rely on Large Language Models (LLMs) to facilitate software development. Nevertheless, these models have exhibited limited capabilities in the security domain. We introduce LLMSecGuard, a framework to offer enhanced code security through the synergy between static code analyzers and LLMs. LLMSecGuard is open source and aims to equip developers with code solutions that are more secure than the code initially generated by LLMs. This framework also has a benchmarking feature, aimed at providing insights into the evolving security attributes of these models.
- 18 June 2024
- Published by Association for Computing Machinery (ACM)
- p. 600-603
Open AccessLLM Security Guard for Code
Many developers rely on Large Language Models (LLMs) to facilitate software development. Nevertheless, these models have exhibited limited capabilities in the security domain. We introduce LLMSecGuard, a framework to offer enhanced code security through the synergy between static code analyzers and LLMs. LLMSecGuard is open source and aims to equip developers with code solutions that are more secure than the code initially generated by LLMs. This framework also has a benchmarking feature, aimed at providing insights into the evolving security attributes of these models.
- 23 December 2023
- Published by Taylor & Francis in International Journal of Computers and Applications
- Vol. 46 (3) , 175-183
An efficient weighted partial MaxSAT encoding for scheduling in overloaded real-time systems
- 23 December 2023
- Published by Taylor & Francis in International Journal of Computers and Applications
- Vol. 46 (3) , 175-183
An efficient weighted partial MaxSAT encoding for scheduling in overloaded real-time systems
- Open Access
- 24 January 2022
- Published by Wiley in Wireless Communications and Mobile Computing
- Vol. 2022, 1-13
An End-to-End Deep Learning Approach for Plate Recognition in Intelligent Transportation Systems
Accurate and fast recognition of license plates is one of the most important challenges in the field of license plate recognition systems. Due to the high frame rate of surveillance cameras, old license plate recognition systems cannot be used in real-time applications. On the other hand, the presence of natural and artificial noise and different light and weather conditions make the detection and recognition process of these systems challenging. In this paper, an end-to-end method for efficiently detecting and recognizing plates is presented. In the proposed method, vehicles are first detected using a single-shot detector- (SSD-) based deep learning model in the video frames and the input images. This will increase the speed and accuracy in identifying the location of the plate in the given images. Then, the location of the plate is identified using the proposed architecture based on convolutional networks. Finally, using a deep convolutional network and long short-term memory (LSTM), the characters related to the plate are recognized. An advantage of our method is that the proposed deep network is trained using different images with different qualities that leads to high performance in detecting and recognizing plates. Also, considering that in the proposed method the vehicles are first detected and then the plate is detected in the vehicle image, there is no limit in the number of identified plates. Moreover, plate detection in the vehicle rectangle, instead of the whole frame, speeds up our method. The proposed method is evaluated using several databases. The first part of the evaluation focuses on robustness and recognition speed. The proposed method has the accuracy of 100% for vehicle detection, 100% for plate detection, and 99.37% for character recognition. In the second part of evaluation, the proposed method is evaluated in terms of overall speed. The experimental results witness that the proposed method is capable of processing 30 frames per second without losing any data and also outperforms several methods proposed in recent years, in terms of time and accuracy.
- 24 January 2022
- Published by Wiley in Wireless Communications and Mobile Computing
- Vol. 2022, 1-13
Open AccessAn End-to-End Deep Learning Approach for Plate Recognition in Intelligent Transportation Systems
Accurate and fast recognition of license plates is one of the most important challenges in the field of license plate recognition systems. Due to the high frame rate of surveillance cameras, old license plate recognition systems cannot be used in real-time applications. On the other hand, the presence of natural and artificial noise and different light and weather conditions make the detection and recognition process of these systems challenging. In this paper, an end-to-end method for efficiently detecting and recognizing plates is presented. In the proposed method, vehicles are first detected using a single-shot detector- (SSD-) based deep learning model in the video frames and the input images. This will increase the speed and accuracy in identifying the location of the plate in the given images. Then, the location of the plate is identified using the proposed architecture based on convolutional networks. Finally, using a deep convolutional network and long short-term memory (LSTM), the characters related to the plate are recognized. An advantage of our method is that the proposed deep network is trained using different images with different qualities that leads to high performance in detecting and recognizing plates. Also, considering that in the proposed method the vehicles are first detected and then the plate is detected in the vehicle image, there is no limit in the number of identified plates. Moreover, plate detection in the vehicle rectangle, instead of the whole frame, speeds up our method. The proposed method is evaluated using several databases. The first part of the evaluation focuses on robustness and recognition speed. The proposed method has the accuracy of 100% for vehicle detection, 100% for plate detection, and 99.37% for character recognition. In the second part of evaluation, the proposed method is evaluated in terms of overall speed. The experimental results witness that the proposed method is capable of processing 30 frames per second without losing any data and also outperforms several methods proposed in recent years, in terms of time and accuracy.
- Open Access
- 5 August 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. 48 (4) , 1154-1168
On How Bit-Vector Logic Can Help Verify LTL-Based Specifications
This paper studies how bit-vector logic (bv logic) can help improve the efficiency of verifying specifications expressed in Linear Temporal Logic (LTL). First, it exploits the notion of Bounded Satisfiability Checking to propose an improved encoding of LTL formulae into formulae of bv logic, which can be formally verified by means of Satisfiability Modulo Theories (SMT) solvers. To assess the gain in efficiency, we compare the proposed encoding, implemented in our tool Zot, against three well-known encodings available in the literature: the classic bounded encoding and the optimized, incremental one, as implemented in both NuSMV and nuXmv, and the encoding optimized for metric temporal logic, which was the “standard” implementation provided by Zot. We also compared the newly proposed solution against five additional efficient algorithms proposed by nuXmv, which is the state-of-the-art tool for verifying LTL specifications. The experiments show that the new encoding provides significant benefits with respect to existing tools. Since the first set of experiments only used Z3 as SMT solver, we also wanted to assess whether the benefits were induced by the specific solver or were more general. This is why we also embedded different SMT solvers in Zot. Besides Z3, we also carried out experiments with CVC4, Mathsat, Yices2, and Boolector, and compared the results against the first and second best solutions provided by either NuSMV or nuXmv. Obtained results witness that the benefits of the bv logic encoding are independent of the specific solver. Bv logic-based solutions are better than traditional ones with only a few exceptions. It is also true that there is no particular SMT solver that outperformed the others. Boolector is often the best as for memory usage, while Yices2 and Z3 are often the fastest ones.
- 5 August 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. 48 (4) , 1154-1168
Open AccessOn How Bit-Vector Logic Can Help Verify LTL-Based Specifications
This paper studies how bit-vector logic (bv logic) can help improve the efficiency of verifying specifications expressed in Linear Temporal Logic (LTL). First, it exploits the notion of Bounded Satisfiability Checking to propose an improved encoding of LTL formulae into formulae of bv logic, which can be formally verified by means of Satisfiability Modulo Theories (SMT) solvers. To assess the gain in efficiency, we compare the proposed encoding, implemented in our tool Zot, against three well-known encodings available in the literature: the classic bounded encoding and the optimized, incremental one, as implemented in both NuSMV and nuXmv, and the encoding optimized for metric temporal logic, which was the “standard” implementation provided by Zot. We also compared the newly proposed solution against five additional efficient algorithms proposed by nuXmv, which is the state-of-the-art tool for verifying LTL specifications. The experiments show that the new encoding provides significant benefits with respect to existing tools. Since the first set of experiments only used Z3 as SMT solver, we also wanted to assess whether the benefits were induced by the specific solver or were more general. This is why we also embedded different SMT solvers in Zot. Besides Z3, we also carried out experiments with CVC4, Mathsat, Yices2, and Boolector, and compared the results against the first and second best solutions provided by either NuSMV or nuXmv. Obtained results witness that the benefits of the bv logic encoding are independent of the specific solver. Bv logic-based solutions are better than traditional ones with only a few exceptions. It is also true that there is no particular SMT solver that outperformed the others. Boolector is often the best as for memory usage, while Yices2 and Z3 are often the fastest ones.