VLDB 2026 Research / reviewers in the wild / expert
Arash Mazidi
dblp:262/8150
· DBLP profile ↗
4ranked-venue papers
3as first author
3since 2021 · last 2024
0000-0002-0417-5655ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 3 · 2 first-author · 2 since 2021Systems, architecture and hardware · 1 · 1 first-author · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Mining REST APIs for Potential Mass Assignment VulnerabilitiesabstractREST APIs have a pivotal role in accessing protected resources. Despite the availability of security testing tools, mass assignment vulnerabilities are common in REST APIs, leading to unauthorized manipulation of sensitive data. We propose a lightweight approach to mine the REST API specifications and identify operations and attributes that are prone to mass assignment. We conducted a preliminary study on 100 APIs and found 25 prone to this vulnerability. We confirmed nine real vulnerable operations in six APIs. Arash Mazidi, Davide Corradini, Mohammad Ghafari |
EASE | 1 |
| 2023 | Wasmizer: Curating WebAssembly-driven Projects on GitHubabstractWebAssembly has attracted great attention as a portable compilation target for programming languages. To facilitate in-depth studies about this technology, we have deployed Wasmizer, a tool that regularly mines GitHub projects and makes an up-to-date dataset of WebAssembly sources and their binaries publicly available. Presently, we have collected 2540 C and C++ projects that are highly-related to WebAssembly, and built a dataset of 8915 binaries that are linked to their source projects. To demonstrate an application of this dataset, we have investigated the presence of eight WebAssembly compilation smells in the wild. Alexander Nicholson, Quentin Stiévenart, Arash Mazidi, Mohammad Ghafari |
MSR | 3 |
| 2021 | An autonomic decision tree-based and deadline-constraint resource provisioning in cloud applicationsabstractAbstract Cloud computing provides a set of resources and services for customers on the Internet on demand and based on a pay as you go model. Cloud providers are looking to decrease costs and increase profits. Therefore, resource management and provisioning are very important for cloud providers. Automated scaling can be used to provide resources for user requests. Auto‐scaling can decrease the total operational costs for providers, although it does have its own cost and time overheads. In this paper, a new solution is presented for resource provisioning on multi‐layered cloud applications based on MAPE‐K loop. A weighted ensemble prediction model is proposed to estimate the resources utilization in each cloud layer. In addition, accuracy of the model and a regularization technique are used to regulate the weights of the models in the proposed hybrid prediction model. Furthermore, a decision tree‐based algorithm is presented to analyze status of the resources to make scaling decision. In addition, we propose a resource allocation algorithm that is based on Virtual Machine priority and request deadline in order to allocate requests on suitable resources. The experimental results indicate that the proposed algorithm has the best performance among its counterparts. Arash Mazidi, Mehregan Mahdavi, Fahimeh Roshanfar |
Concurr. Comput. Pract. Exp. | 1 |
| 2020 | Autonomic resource provisioning for multilayer cloud applications with K-nearest neighbor resource scaling and priority-based resource allocationabstractSummary Providing a pool of various resources and services to customers on the Internet in exchanging money has made cloud computing as one of the most popular technologies. Management of the provided resources and services at the lowest cost and maximum profit is a crucial issue for cloud providers. Thus, cloud providers proceed to auto‐scale the computing resources according to the users' requests in order to minimize the operational costs. Therefore, the required time and costs to scale‐up and down computing resources are considered as one of the major limits of scaling which has made this issue an important challenge in cloud computing. In this paper, a new approach is proposed based on MAPE‐K loop to auto‐scale the resources for multilayered cloud applications. K‐nearest neighbor (K‐NN) algorithm is used to analyze and label virtual machines and statistical methods are used to make scaling decision. In addition, a resource allocation algorithm is proposed to allocate requests on the resources. Results of the simulation revealed that the proposed approach results in operational costs reduction, as well as improving the resource utilization, response time, and profit. Arash Mazidi, Mehdi Golsorkhtabaramiri, Meisam Yadollahzadeh Tabari |
Softw. Pract. Exp. | 1 |