Add to ORKGA metric for concurrent software is proposed based on an abstract model (Petri nets) as an extension of T.J. McCabe's (1976) cyclomatic number. As such, its focus is on the complexity of control flow. This metric is applied to the assessment of Ada programs, and an automatic method for its direct computation based on the inspection of Ada code is provided. It is pointed out, however, that wider experimentation is needed in order to better assess its effectiveness
Abstract – Cyclomatic complexity (or conditional complexity) is a software metric (measurement). It ...
This paper presents a compact Petri net representation for concurrent programs with explicit tasking...
Spurious results are an inherent problem of most static analysis methods. These methods, in an effor...
A metric for concurrent software is proposed based on an abstract model (Petri nets) as an extension...
The behavior of concurrent Ada programs is very difficult to understand because of the complexity in...
Abstract: Object-oriented software complexity is difficult to assess due to its mani-fold influences...
Specifications play a crucial role in the development of many types of software systems. Formal spec...
The research in software science has so far been concentrated on three measures of program complexit...
The purpose of this study was to perform metric comparisons of programs written in Ada 95 with progr...
Aiming at developing reliable concurrent software, the engineering practice uses appropriate metrics...
International audienceAiming at developing reliable concurrent software, the engineering practice us...
Focussing on the "McCabe family" of measures for the decision/logic structure of a program, leads to...
The introduction of concurrency into programs has added to the complexity of the software design pro...
A review of published measures of control flow complexity in programs reveals three major deficienci...
Petri Nets have developed over the years into a suitable model for representing and studying concurr...
Abstract – Cyclomatic complexity (or conditional complexity) is a software metric (measurement). It ...
This paper presents a compact Petri net representation for concurrent programs with explicit tasking...
Spurious results are an inherent problem of most static analysis methods. These methods, in an effor...
A metric for concurrent software is proposed based on an abstract model (Petri nets) as an extension...
The behavior of concurrent Ada programs is very difficult to understand because of the complexity in...
Abstract: Object-oriented software complexity is difficult to assess due to its mani-fold influences...
Specifications play a crucial role in the development of many types of software systems. Formal spec...
The research in software science has so far been concentrated on three measures of program complexit...
The purpose of this study was to perform metric comparisons of programs written in Ada 95 with progr...
Aiming at developing reliable concurrent software, the engineering practice uses appropriate metrics...
International audienceAiming at developing reliable concurrent software, the engineering practice us...
Focussing on the "McCabe family" of measures for the decision/logic structure of a program, leads to...
The introduction of concurrency into programs has added to the complexity of the software design pro...
A review of published measures of control flow complexity in programs reveals three major deficienci...
Petri Nets have developed over the years into a suitable model for representing and studying concurr...
Abstract – Cyclomatic complexity (or conditional complexity) is a software metric (measurement). It ...
This paper presents a compact Petri net representation for concurrent programs with explicit tasking...
Spurious results are an inherent problem of most static analysis methods. These methods, in an effor...