DEVELOPING METHOD FOR ASSESSING FUNCTIONAL COMPLEXITY OF SOFTWARE INFORMATION SYSTEM

Andrey Solodovnikov

Abstract


Solution of problems for improvement of methods and technologies of software configuration remains important and requires the development of the existing information technology to provide customization of software in terms of changing the end user requirements. Changing requirements stipulate the use of iterative software lifecycle. As part of the life cycle, it is necessary use additional methods to simplify of software architecture and obtaining software with a minimum of functional complexity. This is necessary in order to avoid increasing the time and labor costs for design, development and support of software.

To address the disadvantages of existing methods it is proposed to use a method of assessing the functional complexity of the software information system, which is based on the existing graph multilevel model of software architecture. The method is based on FP-metrics calculation for each architectural element and a corresponding level of the graph model. Metrics values allow choosing software modules with a minimum of functional complexity in configuring the software architecture to satisfy the functional requirements of the end user.

Keywords


graph model; functional complexity; function points; software configuration; multilevel form

Full Text:

PDF

References


Smart, J. F. (2015). BDD in Action: Behavior-driven development for the whole software lifecycle. NY: Manning Publications, Shelter Island, , 384.

Lavryshcheva, E. (2013). Software Engineering kompiuternykh system. Paradyhmy, tekhnolohyy i CASE-sredstva prohrammyrovanyia. Kyiv: Naukova Dumka, 283.

Levukin, V., Evlanov, M. (2013). Model architecturnogo freimvorka uskorennoy razrabotki informatsionnoy sistemy. Novi Technologii, 1-2 (39-40), 51–57.

Detlef, P. (2012). The Design of GP 2. In Proc. International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2011), Electronic Proceedings in Theoretical Computer Science, 82, 1–16.

Poskitt, C. M., Plump, D. (2014). Verifying Monadic Second-Order Properties of Graph Programs. Lecture Notes in Computer Science, 33–48. doi: 10.1007/978-3-319-09108-2_3

Kääriäinen, Ju., Pussinen, P., Matinmikko, T., Oikarinen, T. (2012). Lifecycle Management of Open-Source Software in the Public Sector. A Model for Community-Based Application Evolution. ARPN Journal of Systems and Software, 11 (2), 279–288.

Chainikov, S., Solodovnikov, A. (2016). Information Technology of Software Architecture Structural Synthesis of Information System. EUREKA: Physical Science and Engineering, 4 (5), 25–32. doi: 10.21303/2461-4262.2016.00125

Sedjvik, R. (2002). Fundamentalnie algoritmy na C++. Part 5. Algoritmy na graphah. Moscow: DiaSoftUP, 496.

Orlov, S. A. Tsilker, B. Ya. (2012). Technologii razrabotki programmnogo obespechenia. Saint Petersburg: Piter, 608.

Albrecht A. J. (1979). Measuring Application Development Productivity. Proc. IBM Application Development Symposium, 83–92.




DOI: http://dx.doi.org/10.21303/2461-4262.2016.00157

Refbacks

  • There are currently no refbacks.


Bookmark and Share


Copyright (c) 2016 Andrey Solodovnikov

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.

ISSN 2461-4262 (Online), ISSN 2461-4254 (Print)