Graph theory in the control flow analysis of the large time critical aplications - Las Vegas Nevada, USA, June 27-30, 2005

被引：0

作者：

Alekseev, S ^{[1
]}

Stiege, G ^{[1
]}

机构：

[1] Univ Oldenburg, Graphen & Netzwerke Dept, D-2900 Oldenburg, Germany

来源：

SERP '05: Proceedings of the 2005 International Conference on Software Engineering Research and Practice, Vols 1 and 2 | 2005年

关键词：

graph and networks; testing and debuging; time critical object oriented software;

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

In this paper we present the basics for the realization of online monitoring of large server applications written in object-oriented languages. The idea of the proposed solution is to instrument the application at significant points with event functions and to log these events asynchronously during execution. The selection of the monitoring points in the application is based on graph-theoretical algorithms which find an optimal set of places for event functions. This report deals with results from a joint research project between the Siemens AG, Berlin and the University of Oldenburg. In this project a prototype for analysing Java based applications was developed and succesfully applied to services for telecomunications systems.

引用

页码：253 / 259

页数：7