search for: jussivanhatalo

...sub-region is too complicated > to be represented and must be abstracted into a "black box". >From which algorithm? The program structure tree does not give this information, does it? >> My approach is comparable to this paper: >> The Refined Process Structure Tree by JussiVanhatalo, Hagen Völzer, >> Jana Koehler > > I was looking through some slides that described their algorithm. One case that > seems to be legal is this: > > | > Entry > / \ > R0 R1 > \ / > Exit > | > > With two frag...

On 01/13/10 00:56, Jan Sjodin wrote: > Why not use the "standard" algorithm for detecting SESE-regions and building a program structure tree? > It should handle everything you want. It also becomes much simpler to specify a connected SESE-region > by entry/exit edges, while a disconnected region is specified by entry/exit blocks. Only defining regions on > blocks is not

...s, but it helps to explain the problem that way. Might be possible. I did not reason about this too much, when I found a reasonable algorithm that did not requiere these blocks. >>>>> My approach is comparable to this paper: >>>>> The Refined Process Structure Tree by JussiVanhatalo, Hagen Völzer, >>>>> Jana Koehler >>>> >>>> I was looking through some slides that described their algorithm. One case that >>>> seems to be legal is this: >>>> >>>> | >>>> Entry >>>> /...