Automatic Algorithmic Complexity Determination Using Dynamic Program Analysis

Istvan Czibula, Zsuzsanna Oneţ-Marian, Robert-Francisc Vida

2019

Abstract

Algorithm complexity is an important concept in computer science concerned with the efficiency of algorithms. Understanding and improving the performance of a software system is a major concern through the lifetime of the system especially in the maintenance and evolution phase of any software. Identifying certain performance related issues before they actually affect the deployed system is desirable and possible if developers know the algorithmic complexity of the methods from the software system. In many software projects, information related to algorithmic complexity is missing, thus it is hard for a developer to reason about the performance of the system for different input data sizes. The goal of this paper is to propose a novel method for automatically determining algorithmic complexity based on runtime measurements. We evaluate the proposed approach on synthetic data and actual runtime measurements of several algorithms in order to assess its potential and weaknesses.

Paper Citation

in Harvard Style

Czibula I., Oneţ-Marian Z. and Vida R. (2019). Automatic Algorithmic Complexity Determination Using Dynamic Program Analysis.In Proceedings of the 14th International Conference on Software Technologies - Volume 1: ICSOFT, ISBN 978-989-758-379-7, pages 186-193. DOI: 10.5220/0007831801860193

in Bibtex Style

@conference{icsoft19,
author={Istvan Czibula and Zsuzsanna Oneţ-Marian and Robert-Francisc Vida},
title={Automatic Algorithmic Complexity Determination Using Dynamic Program Analysis},
booktitle={Proceedings of the 14th International Conference on Software Technologies - Volume 1: ICSOFT,},
year={2019},
pages={186-193},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0007831801860193},
isbn={978-989-758-379-7},
}

in EndNote Style

TY - CONF

JO - Proceedings of the 14th International Conference on Software Technologies - Volume 1: ICSOFT,
TI - Automatic Algorithmic Complexity Determination Using Dynamic Program Analysis
SN - 978-989-758-379-7
AU - Czibula I.
AU - Oneţ-Marian Z.
AU - Vida R.
PY - 2019
SP - 186
EP - 193
DO - 10.5220/0007831801860193