scientific article; zbMATH DE number 1533817

From MaRDI portal
Publication:4517030





Some algorithms for the construction of various theory-graph forms of an intermediate presentation of programs, such as the dependence graph of a program, hierarchical task graph, ideograph, etc., are considered. A comparison of such presentations is presented. For the entire collection see [Zbl 0944.00028].











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4517030)