Complexity measures for software engineering

Authors:
M. Burgin;N. Debnath
Affiliations:
Department of Mathematics, University of California, Los Angeles, Los Angeles, CA 90095, USA;Department of Computer Science, Winona State University, Winona, MN 55987, USA
Venue:
Journal of Computational Methods in Sciences and Engineering - Selected papers from the International Conference on Computer Science,Software Engineering, Information Technology, e-Business, and Applications, 2003
Year:
2005

Citing 13
Cited 1

Software engineering metrics and models

Software engineering metrics and models
Software engineering (3rd ed.): a practitioner's approach

Software engineering (3rd ed.): a practitioner's approach
An introduction to Kolmogorov complexity and its applications

An introduction to Kolmogorov complexity and its applications
A Machine-Independent Theory of the Complexity of Recursive Functions

Journal of the ACM (JACM)
Concurrent Processes and Their Syntax

Journal of the ACM (JACM)
The Vienna Definition Language

ACM Computing Surveys (CSUR)
Software Metrics: A Rigorous Approach

Software Metrics: A Rigorous Approach
Elements of Software Science (Operating and programming systems series)

Elements of Software Science (Operating and programming systems series)
Definition of Programming Languages

Definition of Programming Languages
Graphs and Hypergraphs

Graphs and Hypergraphs
The Cost of Developing Large-Scale Software

IEEE Transactions on Computers
A Complexity Measure

IEEE Transactions on Software Engineering
Applying Software Complexity Metrics to Program Maintenance

Computer

Complexity measures in 4GL environment

ICCSA'11 Proceedings of the 2011 international conference on Computational science and Its applications - Volume Part V

Quantified Score

Hi-index	0.00

Visualization

Abstract

The aim of this paper is further development of the mathematical theory of algorithmic complexity measures for evaluation of the computer software design and utilization. We consider some basic concepts and constructions from the theory of algorithmic complexity and develop a system structure in the theory of algorithmic complexity. The paper contains main concepts from the axiomatic complexity theory, which are fundamental for the whole theory of algorithmic complexity. Important classes of dual complexity measures are studied. The research is oriented at the development of software engineering and, in particular, creation of more efficient software metrics.