default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMohammad Mehdi Pourhashem Kallehbasti
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j5]Mohammad Reza Rezvan
, Ali Ghanbari Sorkhi, Jamshid Pirgazi, Mohammad Mehdi Pourhashem Kallehbasti:
AdvanceSplice: Integrating N-gram one-hot encoding and ensemble modeling for enhanced accuracy. Biomed. Signal Process. Control. 92: 106017 (2024)- [c6]Arya Kavian, Mohammad Mehdi Pourhashem Kallehbasti, Sajjad Kazemi, Ehsan Firouzi, Mohammad Ghafari:
LLM Security Guard for Code. EASE 2024: 600-603 - [i3]Arya Kavian, Mohammad Mehdi Pourhashem Kallehbasti, Sajjad Kazemi, Ehsan Firouzi, Mohammad Ghafari:
LLM Security Guard for Code. CoRR abs/2405.01103 (2024) - 2023
- [c5]Mohammad Mehdi Pourhashem Kallehbasti, Mohammad Ghafari:
Naturalistic Static Program Analysis. SANER 2023: 743-747 - [i2]Mohammad Mehdi Pourhashem Kallehbasti, Mohammad Ghafari:
Naturalistic Static Program Analysis. CoRR abs/2301.04862 (2023) - 2022
- [j4]Mohammad Mehdi Pourhashem Kallehbasti, Matteo Rossi, Luciano Baresi:
On How Bit-Vector Logic Can Help Verify LTL-Based Specifications. IEEE Trans. Software Eng. 48(4): 1154-1168 (2022) - [i1]Mohammad Ghafari, Konstantin Rubinov, Mohammad Mehdi Pourhashem Kallehbasti:
Mining unit test cases to synthesize API usage examples. CoRR abs/2208.00264 (2022) - 2021
- [j3]Jamshid Pirgazi, Ali Ghanbari Sorkhi, Mohammad Mehdi Pourhashem Kallehbasti:
An efficient robust method for accurate and real-time vehicle plate recognition. J. Real Time Image Process. 18(5): 1759-1772 (2021)
2010 – 2019
- 2017
- [j2]Mohammad Ghafari, Konstantin Rubinov, Mohammad Mehdi Pourhashem Kallehbasti:
Mining unit test cases to synthesize API usage examples. J. Softw. Evol. Process. 29(12) (2017) - [j1]Luciano Baresi, Angelo Morzenti, Alfredo Motta, Mohammad Mehdi Pourhashem Kallehbasti, Matteo Rossi:
A Logic-Based Approach for the Verification of UML Timed Models. ACM Trans. Softw. Eng. Methodol. 26(2): 7:1-7:47 (2017) - 2016
- [c4]Luciano Baresi, Mohammad Mehdi Pourhashem Kallehbasti, Matteo Rossi:
How bit-vector logic can help improve the verification of LTL specifications over infinite domains. SAC 2016: 1666-1673 - 2015
- [b1]Mohammad Mehdi Pourhashem Kallehbasti:
Scalable formal verification of UML models. Polytechnic University of Milan, Italy, 2015 - [c3]Luciano Baresi, Mohammad Mehdi Pourhashem Kallehbasti, Matteo Rossi:
Efficient Scalable Verification of LTL Specifications. ICSE (1) 2015: 711-721 - [c2]Mohammad Mehdi Pourhashem Kallehbasti:
Scalable Formal Verification of UML Models. ICSE (2) 2015: 847-850 - 2014
- [c1]Luciano Baresi, Mohammad Mehdi Pourhashem Kallehbasti, Matteo Rossi:
Flexible modular formalization of UML sequence diagrams. FormaliSE 2014: 10-16
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
