In order to ensure information security in modern software systems, control of the absence of software undeclared capabilities is claimed to be the topical issue. The certification process for information security products involves execution route determination for the functional objects and their branches. The execution route is a directed graph. The paper deals with the problem of software complex development that gives the possibility to visualize execution routes for the functional objects and software branches of information security products.
certification, graph, visualization, software, information protection
1. Rukovodyaschiy dokument. Zaschita ot nesankcionirovannogo dostupa k informacii. Ch. 1: Programmnoe obespechenie sredstv zaschity informacii. Klassifikaciya po urovnyu kontrolya otsutstviya nedeklarirovannyh vozmozhnostey (vved. s 4 iyunya 1999 g.). M.: Izd-vo standartov, 1999. 9 s.
2. Graph Drawing // Graph Drawing Symposium. URL: http://www.graphdrawing.org/ (data obrascheniya: 11.07.2017).
3. Gephi Features // Gephi.org. URL: https://gephi.github.io/features/ (data obrascheniya: 11.07.2017).
4. Cytoscape.js // Cytoscape Consortium. URL: http://js.cytoscape.org/ (data obrascheniya: 11.07.2017).
5. D3.js - Data Driven Documents // D3.js. URL: http://d3js.org/ (data obrascheniya: 11.07.2017).
6. NetworkX Documentation // NetworkX Developers. URL: http://networkx. github.io/documentation/networkx-1.9.1/ (data obrascheniya: 11.07.2017).
7. Sugiyama K., Tagawa S., Toda M. Methods for visual understanding of hierarchical system structures // IEEE Transactions on Systems, Man and Cybernetics. SMC-11: 1981.
8. Apanovich Z.V. Metody vizualizacii informacii pri pomoschi grafov. Ch. 2: Metody vizualizacii orientirovannyh i neorientirovannyh grafov // Elektronnaya obrazovatel'naya sreda NGU. URL: http://193.124.209.204/?db=book_apanovich2&int =VIEW&class=ROOT&templ=VIEW (data obrascheniya: 11.07.2017).
9. Eades P., Lin X., Smyth W.F. A fast and effective heuristic for the feedback arc set problem // Information Processing Letters. 1993. P. 47.
10. Berger B., Shor P.W. Approximation algorithms for the maximum acyclic subgraph problem // Proc. 1st Annual ACM-SIAM Symposium on Discrete Algorithms, ACM-SIAM, 1990. P. 236-243.
11. Nachmanson L. Notes on an Implementation of Sugiyama’s Scheme // Graph Drawing - Springer. 2010. № 10. 10 p.
12. Shabbeer A., Ozcaglar C., Bennett K.P. Crossing Minimization within Graph Embeddings. Cornell University, 2012.
13. bdcht/grandalf // GitHub. URL: https://github.com/bdcht/grandalf (data obrascheniya: 11.07.2017).
14. igraph/igraph // GitHub. URL: https://github.com/igraph/igraph (data obrascheniya: 11.07.2017).
15. SVG vs canvas: how to choose // Microsoft Developer Network. URL: https://msdn.microsoft.com/en-us/library/gg193983(v=vs.85).aspx (data obrascheniya: 11.07.2017).
16. Rukovodyashchij dokument. Zashchita ot nesankcionirovannogo dostupa k informacii. CH. 1: Programmnoe obespechenie sredstv zashchity informacii. Klassifikaciya po urovnyu kontrolya otsutstviya nedeklarirovannyh vozmozhnostej (vved. s 4 iyunya 1999 g.). M.: Izd-vo standartov, 1999. 9 s.
17. Graph Drawing // Graph Drawing Symposium. URL: http://www.graphdrawing.org/ (data obrashcheniya: 11.07.2017).
18. Gephi Features // Gephi.org. URL: https://gephi.github.io/features/ (data obrashcheniya: 11.07.2017).
19. Cytoscape.js // Cytoscape Consortium. URL: http://js.cytoscape.org/ (data obrashcheniya: 11.07.2017).
20. D3.js - Data Driven Documents // D3.js. URL: http://d3js.org/ (data obrashcheniya: 11.07.2017).
21. NetworkX Documentation // NetworkX Developers. URL: http://networkx. github.io/documentation/networkx-1.9.1/ (data obrashcheniya: 11.07.2017).
22. Sugiyama K., Tagawa S., Toda M. Methods for visual understanding of hierarchical system structures // IEEE Transactions on Systems, Man and Cybernetics. SMC-11: 1981.
23. Apanovich Z.V. Metody vizualizacii informacii pri pomoshchi grafov. CH. 2: Metody vizualizacii orientirovannyh i neorientirovannyh grafov // EHlektronnaya obrazovatel'naya sreda NGU. URL: http://193.124.209.204/?db=book_apanovich2&int=VIEW&class=ROOT&templ =VIEW (data obrashcheniya: 11.07.2017).
24. Eades P., Lin X., Smyth W.F. A fast and effective heuristic for the feedback arc set problem // Information Processing Letters. 1993. P. 47.
25. Berger B., Shor P.W. Approximation algorithms for the maximum acyclic subgraph problem // Proc. 1st Annual ACM-SIAM Symposium on Discrete Algorithms, ACM-SIAM, 1990. P. 236-243.
26. Nachmanson L. Notes on an Implementation of Sugiyama’s Scheme // Graph Drawing - Springer. 2010. № 10. 10 p.
27. Shabbeer A., Ozcaglar C., Bennett K.P. Crossing Minimization within Graph Embeddings. Cornell University, 2012.
28. bdcht/grandalf // GitHub. URL: https://github.com/bdcht/grandalf (data obrashcheniya: 11.07.2017).
29. igraph/igraph // GitHub. URL: https://github.com/igraph/igraph (data obrashcheniya: 11.07.2017).
30. SVG vs canvas: how to choose // Microsoft Developer Network. URL: https://msdn.microsoft.com/en-us/library/gg193983(v=vs.85).aspx (data obrashcheniya: 11.07.2017).
