| 1. |
- Antinyan, Vard, 1984, et al.
(författare)
-
Monitoring Evolution of Code Complexity and Magnitude of Changes
- 2014
-
Ingår i: Acta Cybernetica. - 0324-721X. ; 21:3, s. 367-382
-
Tidskriftsartikel (refereegranskat)abstract
- Background: Complexity management has become a crucial activity in continuous software development. While the overall perceived complexity of a product grows rather insignificantly, the small units, such as functions and files, can have noticeable complexity growth with every increment of product features. This kind of evolution triggers risks of escalating fault-proneness and deteriorating maintainability. Goal: The goal of this research was to develop a measurement system which enables effective monitoring of complexity evolution. Method: An action research has been conducted in two large software development organiza-tions. We have measured three complexity and two change properties of code for two large industrial products. The complexity growth has been measured for five consecutive releases of products. Different patterns of growth have been identified and evaluated with software engi-neers in industry. Results: The results show that monitoring cyclomatic complexity evolution of functions and number of revisions of files focuses the attention of designers to potentially problematic files and functions for manual assessment and improvement. A measurement system was developed at Ericsson to support the monitoring process.
|
|
| 2. |
- Antinyan, Vard, et al.
(författare)
-
Monitoring evolution of code complexity and magnitude of changes
- 2014
-
Ingår i: Acta Cybernetica. - : University of Szeged, Institute of Informatics. - 0324-721X. ; 21:3, s. 367-382
-
Tidskriftsartikel (refereegranskat)abstract
- Complexity management has become a crucial activity in continuous software development. While the overall perceived complexity of a product grows rather insignificantly, the small units, such as functions and files, can have noticeable complexity growth with every increment of product features. This kind of evolution triggers risks of escalating fault-proneness and deteriorating maintainability. The goal of this research was to develop a measurement system which enables effective monitoring of complexity evolution. An action research has been conducted in two large software development organizations. We have measured three complexity and two change properties of code for two large industrial products. The complexity growth has been measured for five consecutive releases of the products. Different patterns of growth have been identified and evaluated with software engineers in industry. The results show that monitoring cyclomatic complexity evolution of functions and number of revisions of files focuses the attention of designers to potentially problematic files and functions for manual assessment and improvement. A measurement system was developed at Ericsson to support the monitoring process.
|
|
| 3. |
- Drewes, Frank, et al.
(författare)
-
Context-Free Tree Grammars are as Powerful as Context-Free Jungle Grammars
- 2015
-
Ingår i: Acta Cybernetica. - : University of Szeged. - 0324-721X. ; 22:2, s. 373-392
-
Tidskriftsartikel (refereegranskat)abstract
- Jungles generalize trees by sharing subtrees and allowing garbage. It is shown that IO context-free tree grammars generate the same jungle languages as context-free jungle grammars. Also, they define the same subsets of any algebra.
|
|
| 4. |
|
|
| 5. |
- Moggi, E., et al.
(författare)
-
Sound over-approximation of probabilities
- 2020
-
Ingår i: Acta Cybernetica. - Szeged : University of Szeged, Institute of Informatics. - 0324-721X. ; 24:3, s. 269-285
-
Tidskriftsartikel (refereegranskat)abstract
- Safety analysis of high confidence systems requires guaranteed bounds on the probabilities of events of interest. Establishing the correctness of algorithms that aim to compute such bounds is challenging. We address this problem in three steps. First, we use monadic transition systems (MTS) in the category of sets as a framework for modeling discrete time systems. MTS can capture different types of system behaviors, but we focus on a combination of non-deterministic and probabilistic behaviors that often arises when modeling complex systems. Second, we use the category of posets and monotonic maps as a setting to define and compare approximations. In particular, for the MTS of interest, we consider approximations of their configurations based on complete lattices. Third, by restricting to finite lattices, we obtain algorithms that compute over-approximations, i.e., bounds from above within some partial order of approximants, of the system configuration after n steps. Interestingly, finite lattices of “interval probabilities” may fail to accurately approximate configurations that are both non-deterministic and probabilistic, even for deterministic (and continuous) system dynamics. However, better choices of finite lattices are available. © 2020 University of Szeged, Institute of Informatics. All rights reserved.
|
|
