loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Istvan Gergely Czibula ; Zsuzsanna Oneţ-Marian and Robert-Francisc Vida

Affiliation: Department of Computer Science, Babeş-Bolyai University, M. Kogalniceanu Street, Cluj-Napoca and Romania

Keyword(s): Algorithmic Complexity, Dynamic Program Analysis.

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.

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 3.15.193.45

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
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 - ICSOFT; ISBN 978-989-758-379-7; ISSN 2184-2833, SciTePress, pages 186-193. DOI: 10.5220/0007831801860193

@conference{icsoft19,
author={Istvan Gergely 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 - ICSOFT},
year={2019},
pages={186-193},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0007831801860193},
isbn={978-989-758-379-7},
issn={2184-2833},
}

TY - CONF

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

- Science and Technology Publications, Lda.
RESOURCES

Proceedings

Papers

Authors

Ontology

CONTACTS

Science and Technology Publications, Lda
Avenida de S. Francisco Xavier, Lote 7 Cv. C,
2900-616 Setúbal, Portugal.

Phone: +351 265 520 185 (National fixed network call)
Fax: +351 265 520 186
Email: info@scitepress.org

EXTERNAL LINKS

PRIMORIS

INSTICC

SCITEVENTS

CROSSREF

PROCEEDINGS SUBMITTED FOR INDEXATION BY:

dblp

Ei Compendex

SCOPUS

Semantic Scholar

Google Scholar

Microsoft Academic