François Taïani

From stack traces to call-trees: outline of a proof

Lancaster (UK), January, number COMP-010-2009, 2009 (11p.)

Abstract
This report outlines a proof of the theorem described in COSMOPEN: Dynamic reverse engineering on a budget on the construction of a minimal call-trees from stack traces. Please refer to original publication for details regarding the context of the work, the notation used, and definitions. We repeat below the pseudo-code of the call-tree construction algorithm, and present some key definitions in more detail. We then outline a proof of the characterisation of the call-tree constructed by the algorithm.

complete document

bibtex



[Maison.png]Back to Home

 
Last generated on 9 Nov 2017       francois.taiani@irisa.fr     Valid HTML 4.0!