THIS PROPOSAL GIVES WHAT MAY BE THE FIRST EXAMPLES OF NONPLANAR FLOW DIAGRAMS, I.

THIS PROPOSAL GIVES WHAT MAY BE THE FIRST EXAMPLES OF NONPLANAR FLOW DIAGRAMS, I.E. FLOW DIAGRAMS DESCRIBING CODE WHICH IS INTRINSICALLY INCAPABLE OF HAVING ALL UNCONDITIONAL BRANCHES REMOVED. SOME REFLECTION OF THE SIGNIFICANCE OF THESE EXAMPLES LEADS TO A REALIZATION THAT A VARIETY OF DESIRABLE GOALS IN SOFTWARE ENGINEERING ARE NOW BOTH DESIRABLE AND WITHIN REACH. IT IS PROPOSED TO SEEK TO ATTAIN SEVERAL GOALS INCLUDING: DEVELOPING AN ALGORITHM WHICH TAKES PURELY LOCAL INFORMATION ON RELATIONSHIPS BETWEEN PARTS OF A PROGRAM AND PRODUCES A GLOBAL FLOW DIAGRAM; DEVELOPING AN ALGORITHM FOR DETERMINING WHETHER THIS DIAGRAM IS PLANAR IN THE GRAPH-THEORETIC SENSE; DEBELOPING AN ALGORITHM WHICH TAKES THE SOLELY LOCAL INFORMATION IN A DIAGRAM KNOWN, ON MATHEMATICAL GROUNDS, TO BE PLANAR AND PRODUCES A PLANE DRAWING OF IT WITHOUT CROSSOVERS; DEVELOPING AN ALGORITHM WHICH TAKES THE SOLELY LOCAL INFORMATION IN A DEMONSTRABLY NONPLANAR DIAGRAM AND PRODUCES A PLANE DRAWING OF IT WHICH HAS A (PROVABLY) MINIMAL NUMBER OF CROSSOVERS; DEVELOPING ALGORITHMS FOR MOVING FROM LOCAL INFORMATION TO DRAWINGS WHICH ARE EXTREMELY INFORMATIVE IN REGARD TO SOME CHOSEN ASPECT OF A PROPOSED PROGRAM; ELABORATING A THEORY OR 'NONPLANAR' PROGRAMS COMPARABLE IN POWER, AND COMPLEMENTARY IN SCOPE, TO STRUCTURED PROGRAMMING AS A THEORY OF PLANAR PROGRAMS; BUILDING HIGH PERFORMANCE NONPLANAR ALGORITHMS WHICH, BEING SUBJECT TO FEWER RESTRICTIONS, OUTPERFORM STRUCTURED PROGRAMS.