2019
DOI: 10.20944/preprints201912.0063.v1
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

A Comparitive Analysis Between Open Source And Closed Source Software in Terms of Complexity and Quality Factors

Abstract: The complexity of software is increasing day by day due to the increase in the size of the projects being developed. For better planning and management of large software projects, estimation of software quality is important. During the development processes, complexity metrics are used for the indication of the attributes/characteristics of the quality software. There are many studies about the effect of the complexity of the software on the cost and quality. In this study, we discussed the effects of software… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
2
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 13 publications
(14 reference statements)
0
2
0
Order By: Relevance
“…โ€ข Closed Source Software (CSS): CSS is implemented by specific developers or companies, so its source code is changed only by the company or the developer who developed the software and cannot be publicly available to the intended users [6].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…โ€ข Closed Source Software (CSS): CSS is implemented by specific developers or companies, so its source code is changed only by the company or the developer who developed the software and cannot be publicly available to the intended users [6].…”
Section: Introductionmentioning
confidence: 99%
“…For example, the Shooman decomposition model represents the implementation of the software program using structured programming, which consists of different independent paths. The following equation used to calculate the complete number of failures in N tests: (5) and the system fails probability on each run of case i calculated by: ๐’’๐’Š = ๐ฅ๐ข๐ฆ ๐’โ†’โˆž ๐’๐’‡ ๐‘ต (6) where N is test cases' numbers, k is paths' number, qi is probability of errors of each run of case i, fi is selection probability of case i, and nf is total failures' number in N test.…”
mentioning
confidence: 99%