PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
Bertolino A., Marré M. Deriving path expressions recursively. In: IEEE 2nd Workshop on Program Comprehension. (Capri, Italy, 8 - 9 July 1993). Proceedings, pp. 177 - 185. IEEE, 1993.
 
 
Abstract
(English)
Program representation plays an important role in software engineering, because it is used by che tools supporting software life cycle activities. To represent a program's control structure, the dominator tree and the implied tree, derived from the program's ddgraph, can be profitably used. In fact, thanks to their recursive structure, these trees are especially suitable for designing very simple and efficient algorithms for program path analysis, which is widely used in measurement and testing activities. In particular, this paper presents a recursive algorithm PE for computing path expressions from the dominator and the dominator implied trees. The algorithm proposed is of interest to program comprehension for two reasons: representation of programs by path expressions is widely applied, e.g., to testing, data flow analysis and development of complexity metrics. More in general, an algorithm as PE, which computes path expressions from flowgraphs, can be used to solve many kinds of path problems.
Subject


Icona documento 1) Download Document PDF


Icona documento Open access Icona documento Restricted Icona documento Private

 


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional