Academic literature on the topic 'Halstead metrics'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Halstead metrics.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Halstead metrics"

1

Khan, Bilal, and Aamer Nadeem. "Evaluating the effectiveness of decomposed Halstead Metrics in software fault prediction." PeerJ Computer Science 9 (November 27, 2023): e1647. http://dx.doi.org/10.7717/peerj-cs.1647.

Full text
Abstract:
The occurrence of faults in software systems represents an inevitable predicament. Testing is the most common means to detect such faults; however, exhaustive testing is not feasible for any nontrivial system. Software fault prediction (SFP), which identifies software components that are more prone to errors, seeks to supplement the testing process. Thus, testing efforts can be focused on such modules. Various approaches exist for SFP, with machine learning (ML) emerging as the prevailing methodology. ML-based SFP relies on a wide range of metrics, ranging from file-level and class-level to method-level and even line-level metrics. More granularized metrics are expected to possess a higher degree of micro-level coverage of the code. The Halstead metric suite offers coverage at the line level and has been extensively employed across diverse domains such as fault prediction, quality assessment, and similarity approximation for the past three decades. In this article, we propose to decompose Halstead base metrics and evaluate their fault prediction capability. The Halstead base metrics consist of operators and operands. In the context of the Java language, we partition operators into five distinct categories, i.e., assignment operators, arithmetic operators, logical operators, relational operators, and all other types of operators. Similarly, operands are classified into two classes: constants and variables. For the purpose of empirical evaluation, two experiments were designed. In the first experiment, the Halstead base metrics were used along with McCabe, Lines of Code (LoC), and Halstead-derived metrics as predictors. In the second experiment, decomposed Halstead base metrics were used along with McCabe, LoC, and Halstead-derived metrics. Five public datasets were selected for the experiments. The ML classifiers used included logistic regression, naïve Bayes, decision tree, multilayer perceptron, random forest, and support vector machines. The ML classifiers’ effectiveness was assessed through metrics such as accuracy, F-measure, and AUC. Accuracy saw an enhancement from 0.82 to 0.97, while F-measure exhibited improvement from 0.81 to 0.99. Correspondingly, the AUC value advanced from 0.79 to 0.99. These findings highlight the superior performance of decomposed Halstead metrics, as opposed to the original Halstead base metrics, in predicting faults across all datasets.
APA, Harvard, Vancouver, ISO, and other styles
2

Horobets, Yuliia, and Marek Miłosz. "The concept, models and metrics of software quality – an overview." Journal of Computer Sciences Institute 4 (September 30, 2017): 92–98. http://dx.doi.org/10.35784/jcsi.600.

Full text
Abstract:
The article presents analysis of existing models and metrics measurement and software quality assessment. For comparison were chosen following models of software quality: McCall, Boehm, Boeing, FURPS, Dormey, ISO / IEC 9126, ISO / IEC 25000: 2005 and software metrics: SLOC, McCabe, Halstead.
APA, Harvard, Vancouver, ISO, and other styles
3

Bozó, István, Zoran Budimac, Smiljana Knežev, Gordana Rakić, and Melinda Tóth. "Evaluation of a recursion aware complexity metric." Annales Universitatis Scientiarum Budapestinensis de Rolando Eötvös Nominatae. Sectio computatorica 57 (2024): 201–18. https://doi.org/10.71352/ac.57.201.

Full text
Abstract:
Software metrics are heavily used to measure the complexity, readability, understandability, and maintainability of the source code. However, the accuracy of these metrics could be improved by considering different new aspects. In our previous research, we have introduced the Overall Path Complexity metric that takes into account recursion during the calculation of the metrics. The metric was integrated into the RefactorErl tool and evaluated for the functional programming language, Erlang. It was found that the OPC looked into new information that had not been evaluated before. In this paper, we look into how the Overall Path Complexity metric behaves in the context of an object-oriented language, Java. During the evaluation, we used the SSQSA platform. Observed results for Java examples were compared with other complexity metrics, such as Halstead (Volume, Effort, Difficulty) Metrics, Unique Complexity Metric, Maintainability Index and Cognitive Metric. The low correlation between the OPC and other complexity metrics showed that there is new information for Java projects that have not been evaluated by the other complexity metrics so far. This research shows that besides a functional programming language, the OPC metrics bring new information for an object-oriented language too.
APA, Harvard, Vancouver, ISO, and other styles
4

Balogun, Ghaniyyat Bolanle, Muhideen Abdulraheem, Peter Ogirima Sadiku, Olawale Debo Taofeek, and Adebisi Adewale. "Halstead’s Complexity Measure of a Merge sort and Modified Merge sort Algorithms." Jambura Journal of Informatics 5, no. 2 (2023): 141–51. http://dx.doi.org/10.37905/jji.v5i2.21995.

Full text
Abstract:
Complexity measuring tools in computer science are deployed to measure and compare different characteristics of algorithms in order to find the best one in solving a particular problem or that suits a particular situation. In view of this, Halstead’s complexity metrics is deployed to compare the efficiency of two external sorting methods; the Merge sort and the Modified Merge sort algorithms. The methodology used in achieving this, lies in the extraction of operators and operands from the C_sharp (C#) implemented program of the two algorithms. Six Halstead metrics are evaluated using these operators and operands as parameters. The results shows that the Modified Merge sort algorithm is much more efficient than the conventional Merge sort as it has a lower Program Volume, lower Program difficulty and a lower Program Effort even though the advantage of a higher Intelligence content goes to the Merge sort algorithm.
APA, Harvard, Vancouver, ISO, and other styles
5

Krishna, K. V., and K. V. Ganesh. "An Assessment of Halstead Metrics on Health Management Software." Sun International Journal of Engineering and Basic Sciences 02, no. 03 (2019): 24–28. http://dx.doi.org/10.30558/ijebs.20190203001.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Naveed, Muhammad Shumail. "Comparison of C++ and Java in Implementing Introductory Programming Algorithms." Quaid-e-Awam University Research Journal of Engineering Science & Technology 19, no. 1 (2021): 95–103. http://dx.doi.org/10.52584/qrj.1901.14.

Full text
Abstract:
Computer programming is the heart of computer science and C++ and Java are the most popular and widely used languages. The performance of C++ and Java programming languages has been benchmarked using robotics, numerical, genetic and evolutionary algorithms, but not using introductory programming algorithms. This article examined C++ and Java by analysing the implementation of novice algorithms of introductory programming courses by evaluating the difficulty, effort, time and delivered bugs of programs with Halstead software metrics. The study identified that Java is more difficult than C++ in the implementation of selected algorithms. Similarly, the efforts required to translate the novice algorithms in Java are higher than C++. The time involved in translating selected algorithms in C++ is lower than Java. Similarly, the number of delivered bugs in C++ is lower than Java. The study suggests that C++ is more suitable than Java for the implementation of introductory programming algorithms and reasonably more suitable for introductory programming courses. The study emboldens the programming linguists to do further analyses in contemplating other programming languages with Halstead software metrics and other kinds of algorithms.
APA, Harvard, Vancouver, ISO, and other styles
7

Maina, Nevy Kimani, Geoffrey Muchiri Muketha, and Geoffrey Mariga Wambugu. "A Literature Survey of Complexity Metrics for Object-Oriented Programs." International Journal of Science and Engineering Applications 11, no. 05 (2022): 66–71. http://dx.doi.org/10.7753/ijsea1105.1003.

Full text
Abstract:
Software complexity refers to the factors that determine the complexity level of a software project. High complexity is caused by the many attributes used in the system and the complex logic relationships among these attributes and features. The increased complexity of software is undesirable and affects maintenance. Over the years, Software Engineering scholars recommended several metrics like Halstead metric, cyclomatic complexity, and line of code metrics to deal with the complexity. With the complexity increasing as time goes by, there is a need for better metrics that can evaluate software more effectively. This research aims to develop a metrics model to determine the features that cause high complexity in software design architectures and to implement the multi-language complexity evaluation model for software architectures. Although this is the case, the literature on complexity metrics that implement diagram-centric complexity measures are inadequate. This study presents the outcomes obtained from our survey on metrics utilized in object-oriented environments. The survey comprises a small set of the most common and frequently implemented software metrics, which could be adopted to a group of object-oriented metrics and object-oriented programming. After reviewing the literature, Findings indicate that metrics that employ diagram-centric complexity measures are lacking.
APA, Harvard, Vancouver, ISO, and other styles
8

Korznikov, Artem O., and Natalya N. Datsun. "Program Realization for Code Metrics Calculation in Object-Oriented Programming Language." Вестник Пермского университета. Математика. Механика. Информатика, no. 3 (62) (2023): 76–84. http://dx.doi.org/10.17072/1993-0550-2023-3-76-84.

Full text
Abstract:
All groups of software product lifecycle processes executed by developers are complicated to implement. The code generation possibility and a requirement of evaluation for each participant contri-bution in case of teamwork also should be considered. A quantitative estimation for various aspects of software is proposed by code metrics calculation. The work purpose is development of a program for calculating the metrics of a software product for various object-oriented programming languages. The tasks are development of metrics exploitation approaches for evaluating and comparing code and imple-mentation of the metric calculation program. The description for subsets of the languages C#, C++ and Java was created. A values gradation Halstead metrics and the approaches for analyzing dynamic changes of a software product and comparison of different programs solving the same problem are pro-posed and first allowed calculated metrics values interpretation. “Metrics Observer” program was devel-oped. It calculates 11 metrics values for programs in object-oriented language and 16 metrics values that do not depend on the paradigm. Practical significance is to prepare solutions for comparing different implementations of the same task, identifying code modules for refactoring, estimating dynamic code quality changes during the development / refactoring process and individual contributions of developers to a project.
APA, Harvard, Vancouver, ISO, and other styles
9

Arnould, Arthur, Rita Hendricusdottir, and Jeroen Bergmann. "The Complexity of Medical Device Regulations Has Increased, as Assessed through Data-Driven Techniques." Prosthesis 3, no. 4 (2021): 314–30. http://dx.doi.org/10.3390/prosthesis3040029.

Full text
Abstract:
Medical device regulations are dynamic, as they need to cover an ever changing landscape. In Europe this has led to a new set of regulations (both for Medical Devices and In Vitro Diagnostics), which replaced the old rules. This study is interested in how the complexity of these medical regulations changed over time and if additional time-based metrics can be associated with any of the complexity metrics. Complexity is defined in terms of readability of the text and it is computed using established linguistic measures, as well as Halstead complexity scores. It was shown that the regulatory complexity of new EU medical device regulations was higher than their predecessors, especially when Halstead complexity measures were considered. The complexity metrics obtained for the new regulations were subsequently associated with the time it took to consider these regulations. Only very weak Pearson’s correlation coefficients were found between the complexity scores and the obtained response times for the new regulations. This could indicate that there are issues with how complexity is perceived by those that need to apply these regulations. Taking the complexity of regulations into account can greatly help with the development of more user friendly regulations. The results from the data-driven methods that are applied in this research indicate that governments could benefit from focusing on making regulations more accessible and utilitarian. This would improve the stakeholder adherence and facilitate effective implementation. This work also highlighted the need to develop more suitable methods to analyse regulatory text to further inform the wider research community.
APA, Harvard, Vancouver, ISO, and other styles
10

Adhav, Asst Prof Pratik. "Comparative Study of Java and Python Languages with Reference to Data Science." INTERANTIONAL JOURNAL OF SCIENTIFIC RESEARCH IN ENGINEERING AND MANAGEMENT 08, no. 10 (2024): 1–5. http://dx.doi.org/10.55041/ijsrem38298.

Full text
Abstract:
This research provides a comprehensive comparison & analysis between Java and Python, focusing on their application in data science. Key aspects such as encapsulation, AI capabilities, software complexity metrics (Halstead), data statistics, and algorithmic performance (Bubble Sort) are analyzed. This study aims to guide developers in choosing the appropriate language for their data science projects by evaluating performance, memory management, multithreading, and ecosystem richness. The findings are supported by empirical data, benchmarks, and detailed analysis, emphasizing when and how each language excels.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Halstead metrics"

1

Herzig, Paul M. "AdaMeasure: an implementation of the Halstead and Henry metrics." Thesis, 1987. http://hdl.handle.net/10945/22594.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Halstead metrics"

1

Herzig, Paul M. AdaMeasure: An implementation of the Halstead and Henry metrics. 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Series, Michigan Historical Reprint. Metrical geometry. An elementary treatise on mensuration, by George Bruce Halsted. Scholarly Publishing Office, University of Michigan Library, 2005.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Halstead metrics"

1

Sehgal, Rajni, Deepti Mehrotra, and Renuka Nagpal. "Early Reliability Prediction Model Integrating Halstead’s Metrics and Fuzzy Usage." In Services and Business Process Reengineering. Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-2455-4_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Tóth, Zoltán. "Applying and Evaluating Halstead’s Complexity Metrics and Maintainability Index for RPG." In Computational Science and Its Applications – ICCSA 2017. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-62404-4_43.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Bowen, Paul L., Fiona H. Rohde, and Jay Basford. "Ex Ante Evaluations of Alternate Data Structures for End User Queries." In End-User Computing. IGI Global, 2008. http://dx.doi.org/10.4018/978-1-59904-945-8.ch142.

Full text
Abstract:
The data structure of an information system can significantly impact the ability of end users to efficiently and effectively retrieve the information they need. This research develops a methodology for evaluating, ex ante, the relative desirability of alternative data structures for end user queries. This research theorizes that the data structure that yields the lowest weighted average complexity for a representative sample of information requests is the most desirable data structure for end user queries. The theory was tested in an experiment that compared queries from two different relational database schemas. As theorized, end users querying the data structure associated with the less complex queries performed better. Complexity was measured using three different Halstead metrics. Each of the three metrics provided excellent predictions of end user performance. This research supplies strong evidence that organizations can use complexity metrics to evaluate, ex ante, the desirability of alternate data structures. Organizations can use these evaluations to enhance the efficient and effective retrieval of information by creating data structures that minimize end user query complexity.
APA, Harvard, Vancouver, ISO, and other styles
4

Laidler, Keith J. "Promises And Problems." In Derivation and Validation of Software Metrics. Oxford University PressOxford, 1993. http://dx.doi.org/10.1093/oso/9780198538424.003.0003.

Full text
Abstract:
Abstract This chapter examines the metrics of the Software Science model, cyclamate complexity, and information flow in more detail. These are selected on the basis of their popularity within the software engineering literature, and the significance of the claims made by their progenitors. Claimed benefits are summarized. Each metric is then made the subject of an in–depth critique and all are found wanting. The important point made by this chapter is that this is not due to mischance, but is indicative of deeper problems of methodology employed in the field of software metrics. The preceding chapter has provided an introduction to the area of software metrics and has, at the same time, outlined some of the major problems of the subject. The aim of this chapter is to look at three widely used metrics and use them as examples to illustrate more fully these problems. The first metric – or rather family of metrics – is that derived from Halstead’s Software Science which is almost certainly the widest studied and ‘validated’ metric. Of the three metrics examined in this chapter this has, over the last ten years, been the recipient of most criticism; we summarize these criticisms here.
APA, Harvard, Vancouver, ISO, and other styles
5

"Halstead's Metrics: Analysis of Their Designs." In Software Metrics and Software Metrology. John Wiley & Sons, Inc., 2010. http://dx.doi.org/10.1002/9780470606834.ch7.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Halstead metrics"

1

Binanto, Iwan, Harco Leslie Hendric Spits Warnars, Bahtiar Saleh Abbas, and Nesti Fronika Sianipar. "Automation Processing Halstead Metrics Application's Results." In 2018 Indonesian Association for Pattern Recognition International Conference (INAPR). IEEE, 2018. http://dx.doi.org/10.1109/inapr.2018.8627001.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Hariprasad, T., G. Vidhyagaran, K. Seenu, and Chandrasegar Thirumalai. "Software complexity analysis using halstead metrics." In 2017 International Conference on Trends in Electronics and Informatics (ICOEI). IEEE, 2017. http://dx.doi.org/10.1109/icoei.2017.8300883.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Chang, Zhong, RongGang Song, and Yan Sun. "Validating Halstead Metrics for Scratch Program Using Process Data." In 2018 IEEE International Conference on Consumer Electronics-Taiwan (ICCE-TW). IEEE, 2018. http://dx.doi.org/10.1109/icce-china.2018.8448607.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Madhan, M., I. Dhivakar, T. Anbuarasan, and Chandrasegar Thirumalai. "Analyzing complexity nature inspired optimization algorithms using halstead metrics." In 2017 International Conference on Trends in Electronics and Informatics (ICOEI). IEEE, 2017. http://dx.doi.org/10.1109/icoei.2017.8300875.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Alfadel, Mahmoud, Armin Kobilica, and Jameleddine Hassine. "Evaluation of Halstead and Cyclomatic Complexity Metrics in Measuring Defect Density." In 2017 9th IEEE-GCC Conference and Exhibition (GCCCE). IEEE, 2017. http://dx.doi.org/10.1109/ieeegcc.2017.8447959.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Faé, Leonardo Gibrowski, and Dalvan Griebler. "An internal domain-specific language for expressing linear pipelines: a proof-of-concept with MPI in Rust." In Simpósio Brasileiro de Linguagens de Programação. Sociedade Brasileira de Computação, 2024. http://dx.doi.org/10.5753/sblp.2024.3691.

Full text
Abstract:
Parallel computation is necessary in order to process massive volumes of data in a timely manner. There are many parallel programming interfaces and environments, each with their own idiosyncrasies. This, alongside non-deterministic errors, make parallel programs notoriously challenging to write. Great effort has been put forth to make parallel programming for several environments easier. In this work, we propose a DSL for Rust, using the language’s source-to-source transformation facilities, that allows for automatic code generation for distributed environments that support the Message Passing Interface (MPI). Our DSL simplifies MPI’s quirks, allowing the programmer to focus almost exclusively on the computation at hand. Performance experiments show nearly or no runtime difference between our abstraction and manually written MPI code while resulting in less than half the lines of code. More elaborate code complexity metrics (Halstead) estimate from 4.5 to 14.7 times lower effort for expressing parallelism.
APA, Harvard, Vancouver, ISO, and other styles
7

Binanto, Iwan, Harco Leslie Hendric Spits Warnars, Bahtiar Saleh Abbas, and Nesti Fronika Sianipar. "Halstead Metric for Quality Measurement of Various Version of Statcato." In 2018 5th International Conference on Information Technology, Computer, and Electrical Engineering (ICITACEE). IEEE, 2018. http://dx.doi.org/10.1109/icitacee.2018.8576972.

Full text
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!