![](/sites/wilga.ise.pw.edu.pl/files/bannery/Final_2.jpg)
![](/sites/wilga.ise.pw.edu.pl/files/bannery/Final_1.jpg)
![](/sites/wilga.ise.pw.edu.pl/files/bannery/Final_21.jpg)
![](/sites/wilga.ise.pw.edu.pl/files/bannery/Final_8.jpg)
![](/sites/wilga.ise.pw.edu.pl/files/bannery/Final_20.jpg)
![](/sites/wilga.ise.pw.edu.pl/files/bannery/Final_7.jpg)
![](/sites/wilga.ise.pw.edu.pl/files/bannery/Final_3.jpg)
![](/sites/wilga.ise.pw.edu.pl/files/bannery/Final_22.jpg)
![](/sites/wilga.ise.pw.edu.pl/files/bannery/Final_9.jpg)
![](/sites/wilga.ise.pw.edu.pl/files/bannery/Final_17.jpg)
![](/sites/wilga.ise.pw.edu.pl/files/bannery/Final_16.jpg)
![](/sites/wilga.ise.pw.edu.pl/files/bannery/Final_15.jpg)
Discovering of Execution Patterns of Subprograms in Execution Traces
This article describes an approach to work with and analyse logs of historical debuggers (execution traces), which
are tools that provide insight into the history of a program’s execution. Author focuses on finding execution
patterns of subprograms in these logs in efficient way and on visualising them. Execution patterns are a form of
automatically generated specification/documentation of software which shows usage of subprograms. In order
to discover them in execution traces author modified algorithm1 which is based on suffix arrays and which
finds so called operational profiles in text application logs in the linear time with the respect to the length of a
log. In order to visualise found execution patterns author introduced extended call graphs which contain more
information in comparison to standard call graphs.