Nassi, I. and Shneiderman, B. (1973). Flowchart Techniques for Structured Programming. ACM SIGPLAN Notices, 8(8):12--26.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... and early 1960 s, Knuth and others made advances in the automatic generation of flowcharts from program source code [23] 33] Interest in the static visualization of source code continued in the 1970 s with the development of pretty printing [34] of source code, and Nassi Shneiderman charts [38]. Pretty printing makes source code easier to read with the standardizing of spacing and indentation, and sometimes the use of colors or different fonts for keywords. NassiShneiderman charts are more space efficient than traditiona l flow charts and can be easily understood. An example of a ....

Nassi, I. & Shneiderman, B. (1973). "Flowchart Technique for Structured Programming." ACM SIGPLAN Notices, 8(8): 12-26.

....LP has many proponents and continues to be used on both large and small projects [4, 10, 2, for example] in development and education. A good literate program is easy to recognise but, with current tools, difficult to write. This is reminiscent of such techniques as Nassi Shneiderman charts [13], used to represent control flow, which were essentially read only until CASE tool support became available in the 1980s. Nevertheless, we believe that LP has much to offer in the current software development context and, with appropriate extensions, can realise its potential more fully than ....

I. Nassi and B. Shneiderman. Flowchart techniques for structured programming. ACM SIGPLAN Notices, 8(8):12-- 26, 1973.

....textual program of an existing language syntax for execution. The program may be optimised during this stage with the aid of graphics. There are several widely used graph models for constructing programs, such as program dependence graphs [16] process graphs [17] and form based notations [18], to be discussed in Section 3. Many systems use more than one type of graph model, each of which may represent a different conceptual model of the problem. 2.3. Debugging Parallel programs may be debugged at both software and hardware levels. At the software level, debugger displays provide ....

....the information displayed for each process at any given time is limited. The concept of multiple threads communicating along a time line is not well suited to other parallel computation models, notably shared memory model. 3.4. Other Models We consider the Nassi Shneiderman type of diagrams [18] as form based notations as they are essentially forms with characteristic layouts filled with corresponding program 226 K. ZHANG et al. Figure 10. A form based notation showing non deterministic choices constructs. The original motivation of designing Nassi Shneiderman diagrams was to ....

I. Nassi & B. Shneiderman (1973) Flowchart techniques for structured programming. SIG-PLAN Notices 8, 12}26.

....syntax of many diagram languages. 4 Context free hypergraph grammars with embeddings are more expressive than context free ones. They additionally allow 4 Actually, the only diagram languages that we know about and which can be described by context free grammars are Nassi Shneiderman diagrams [15], syntax diagrams [16] and flowcharts as used in this paper. 13 a b a b a b a b a b a b a b a b a b a b a b a b : BlockSeq Block Conn BlockSeq Block Flowchart begin BlockSeq end Block condition Conn Conn BlockSeq BlockSeq statement condition ....

I. Nassi, B. Shneiderman, Flowchart techniques for structured programming, ACM SIGPLAN Notices 8 (8) (1973) 12--26. 24

....and use of Software Engineering tools. So, a number of tools were developed to support a wide range of Software Engineering methods including CCS [MIL89] CCS ATO [REI93] WOB93] Larch [GUT90] Larch ATO [MEL90] SADT [CON80] SADT ATO [RIB91] JSD [JAC75] and Nassi Schneiderman Diagrams [NAS73] NSD ATO [RAM87] as well the graphical formalisms proposed by the PROSOFT own paradigm (Class ATO [CAR93] Figure 1 presents a screenshot of the former Pascal PROSOFT system, showing menus and graphical representation available for NSD and Jackson objects. It is important to note that the ....

NASSI, I.; SCHNEIDERMAN, B. Flowchart techniques for structured programming. Sigplan Notices. New York, v. 8, n.8, p.12-26, ago. 1973.

....updated to ensure consistency with the underlying text based program. PECAN allowed the program to be expressed through several mechanisms, including conventional text based input, menu selections, and keyboard short cuts. Graphical editing of the program through Nassi Shneiderman diagrams [24] was planned for further work. FPL [5] combined textual and graphical means for program expression. In FPL, graphical mechanisms were used to express the control flow and logic of the program solution, and text was used to provide specific values. Users could not choose between alternative means ....

I Nassi and B Shneiderman. Flowchart techniques for structured programming. SIGPLAN Notices, 8(8):12--26, 1973.

....the Topological View. Although the representation does not follow the same rules, it has some elements in common with a projection along the levels axis. Yet another way of looking at this view from the conceptual rather than from the visual point of view is as a block structured diagram [Nassi and Shneiderman, 1973]. The hierarchical structure is identical to a program where sub routines are in lined, and the type of operator for a block is shown in the left part of the block, like in loops (even though most programming languages do not have such a rich set of different loop constructs) 5.2.1 Anatomy of a ....

Isaac Nassi and Ben Shneiderman (1973). Flowchart Techniques for Structured Programming. SIGPLAN Notices, 8(8):12--26.

....Order. In some cases, only the set of plans to be used is known, but not the order in which they will be performed. A way of depicting a plan has to be found where the order in which they are depicted does not necessarily correspond to the order in which they will be executed. Flow charts [4, 14] have been proposed for this purpose, but they do not cover parallel plans or sets of plans that can be performed in any order (the latter is possible 2 , but only with considerable e ort that leads to diagrams that are impossible to read) Additionally, ow charts scale very poorly, i.e. become ....

I. Nassi and B. Shneiderman. Flowchart techniques for structured programming. SIGPLAN Notices, 8(8):12-26, 1973.

....used for displaying the contents of file systems. This tree could also be understood as Topological View seen from a bird s eye view (not in the literal sense, but there are parallels) We use symbols to indicate different plan types (inspired by block structured diagrams used in programming, [8]) Each line of the tree view shows the name of one plan. This vertical partition is colored using the plan s color, and used for showing its time annotation glyph. 4. AsbruView vs. Gantt and PERT Charts The two views introduced above bear many similarities to Gantt (Figure 5) and PERT (Figure ....

I. Nassi and B. Shneiderman. Flowchart techniques for structured programming. SIGPLAN Notices, 8(8):12--26, 1973.

....seems to solve all our problems. But soon it will be obvious that the new definition raises further questions: Are languages like Cobol 73 [30] where the first 11 columns of a line are reserved for specific purposes, really visual programming languages Are Nassi Shneiderman diagrams [76], which simply offer another representation of a conventional program s flow of control, a visual programming language And what about all those commercial visual programming environments like VisualBasic from Microsoft Corp. 55] which are user interface programming extensions of textual ....

....depend on these restrictions. To motivate and illustrate the need for different graph grammar types we will use Nassi Shneiderman diagrams (NSDs) Message Sequence Charts (MSCs) and a specific kind of UML class diagrams as running examples. NSDs are a VL for representing structured programs [76] by attaching boxes to obtain rectangular diagrams. MSC is a language for the description of interaction between entities [57] A diagram in MSC describes which messages are interchanged between process instances, and what internal actions they perform. UML [82] offers a comprehensive VL for ....

I. Nassi and B. Shneiderman. Flowchart techniques for structured programming. SIGPLAN Notices, 8(8), 1973.

....(see Fig. 10) which is similar to tree views often used for displaying the contents of file systems. This tree could also be understood as Topological View seen from a bird s eye view. We use symbols to indicate different plan types (inspired by block structured diagrams used in programming, [23]) Each line of the tree view shows the name of one plan. This vertical partition is colored using the plan s color, and used for showing its time annotation glyph. 4.3 User Interaction Describing all the user interactions possible in the system is beyond the scope of this paper, but a short ....

I. Nassi and B. Shneiderman. Flowchart techniques for structured programming. SIGPLAN Notices, 8(8):12--26, 1973.

....######## ###### In some cases, only the set of plans to be used is known, but not the order in which they will be performed. A wayofdepicting a plan has to be found where the order in which they are depicted does not necessarily correspond to the order in which they will be executed. Flow charts [4, 14] have been proposed for this purpose, but they do not cover parallel plans or sets of plans that can be performed in any order (the latter is possible # , but only with considerable e ort that leads to diagrams that are impossible to read) Additionally, ow charts scale very poorly, i.e. become ....

I. Nassi and B. Shneiderman. Flowchart techniques for structured programming. SIGPLAN Notices, 8(8):12-26, 1973.

....fall into the categories described above, the most widely accepted notation for each category is illustrated and described in the following sections. The selected notations are as follows: Structured Programming Diagrams[4,5] as an example of a line only notation; Nassi Shneiderman diagrams [54] as an example of a box only notation; and Modelling Diagrams 21 . Flow charts as an example of a box and line notation. Algorithms are a collection of sequential, repetitive and selective constructs. Illustrations for each type of diagram will address these basic constructs, in an effort to ....

....E C C Module call Module is standardized Program call Program is standardized Macro call Macro is standardized Descriptor Block n Block 1.1 Block 1.2 edge Page 24 Graphical Presentation of Software Engineering Documents 3.2.3. 2 Nassi Shneiderman Diagrams Nassi Shneiderman diagrams [54] are an example of a box only notation. All information is contained in a box. The repetition and selection control constructs are shapes which enclose procedure parts or blocks. As for SPDs, sequence is indicated by ordering of blocks. The basic constructs in Nassi Shneiderman diagrams are shown ....

Nassi I., Shneiderman B. Flowchart techniques for structured programming. SIGPLAN Notices, 8(8), August 1973.

.... can be identified: those containing only lines, those containing only boxes, and those containing both boxes and lines [Tri88] When considering line only diagrams, we reviewed Structure Program Diagrams (SPDs) Aoy89] When considering box only diagrams, we reviewed Nassi Shneiderman diagrams [Nas73]. When considering box and line diagrams, we reviewed flow charts. Classification of Modelling Diagrams 7 3.2.2 Method Our example applies the review criteria to data flow diagrams. Data flow diagrams are unconnected compound graphs. Each decomposition is a directed multigraph that may or may ....

Nassi I., Shneiderman B. Flowchart techniques for structured programming. SIGPLAN Notices, 8(8), August 1973.

....This section briefly describes these diagram classes. input x while x 1 x : 3x 1 x : x 2 ynx even Figure 1: A Nassi Shneiderman diagram. i1 i2 msc simple a m0 m1 Figure 2: A Message Sequence Chart. Nassi Shneiderman diagrams (NSDs) are used for representing structured programs (Nassi Shneiderman 1973). Each program statement is represented by a rectangle containing the statement. Sequences of statements are translated to stacks of corresponding rectangles. Loops are displayed as rectangles containing the loop control expression as well as the loop body. Moreover, particular graphical ....

Nassi, I., and Shneiderman, B. 1973. Flowchart techniques for structured programming. SIGPLAN Notices 8(8):12-- 26.

....emphasizing relevant aspects. Diagrams are used as tools for thought, aids to memory and a means of instruction [19] They play an important role whenever complex situations have to be represented. In computer science which is only one field of diagram applications Nassi Shneiderman Diagrams [16], Message Sequence Charts [9] and Entity Relationship Diagrams are only some examples. When used on computers, e.g. for editing and interactions, diagrams have to internally represented by a formal model which abstracts from diagrams redundant visual information and which makes informations ....

I. Nassi and B. Shneiderman. Flowchart techniques for structured programming. SIGPLAN Notices, 8(8):12--26, Aug. 1973.

....polygons, whereas horizontal alignment illustrates alternatives. The specific properties of each polygon are indicated by fragments of source code inside the polygons. Most of these box technique diagrams (e.g. Lindsey charts [11] 17] are derived from the familiar Nassi Shneiderman diagrams [15], 13] Box and Line Technique: This technique is mostly known as flowchart diagram. It utilizes a few expressive graphical symbols representing statements, loops, branches, and subprogram calls. Their sequence of execution is depicted by directed edges between the symbols [4] 17] Line ....

I. Nassi and B. Shneiderman. Flowchart Techniques for Structured Programming. ACM SIGPLAN Notices, (8), Aug. 1973.

....NaN Time F NaN Computation or Idle m Communication Legend: Figure 3: Two communicating parallel nodes 2.2 A parallel software design model (PSDM) Our parallel software design model (PSDM) is a variation of the Gantt chart. In PSDM, a node is represented by a rectangle, called node symbol [12], with timing flow on the vertical axis (see Figure 2) The height of the symbol denotes the execution time while the width carries no information. Two communicating nodes are represented in Figure 3 in which the arrow indicates the direction of message passing. Message flow is aligned between ....

Nassi, I. and Shneiderman, B. "Flowchart techniques for Structured Programming", SIGPLAN Notices, pp. 12-26, August 1973.

....seems to solve all our problems. But soon it will be obvious that the new definition raises further questions: Are languages like Cobol 73 [13] where the first 11 columns of a line are reserved for specific purposes, really visual programming languages Are Nassi Shneiderman diagrams [14], which simply offer another representation of a conventional program s flow of control, a visual programming language And what about all those commercial visual programming environments like VisualBasic from Microsoft Corp. 15] which are user interface programming extensions of textual ....

....depend on these restrictions. To motivate and illustrate the need for different graph grammar types we will use Nassi Shneiderman diagrams (NSDs) Message Sequence Charts (MSCs) and a specific kind of UML class diagrams as running examples. NSDs are a VL for representing structured programs [14] by attaching boxes to obtain rectangular diagrams. MSC is a language for the description of interaction between entities [60] A diagram in MSC describes which messages are interchanged between process instances, and what internal actions they perform. UML [29] offers a comprehensive VL for ....

I. Nassi and B. Shneiderman. Flowchart techniques for structured programming. SIGPLAN Notices, 8(8), 1973.

....divided into a number of different aspects: unparsing, state machines, command procedures, events and other user interface components. These different aspects will be illustrated using the example editing mechanism shown in Figure 3, which represents a program as a Nassi Schneiderman style diagram[12]. This example demonstrates a direct manipulation technique for exchanging the statements of the true and false branches of a conditional statement, which might be one of a number of editing mechanisms present in an editor for these diagrams. Figure 3(a) shows the editor at some point in editing a ....

I. Nassi and B. Schneiderman, "Flowchart Techniques for Structured Programming", SIGPLAN Notices, 8(8), August 1973, pp. 12-26.

....why the introduction of the new language serves to increase the usability of the system: 1. VRDL is easier to comprehend than the original textual language. The language design is inspired by Nassi Shneiderman diagrams, which are quite popular when teaching programming to novice programmers [8]. Although results from reallife experiments are still missing, we expect non programmers to be able to easily use our visual language. 2. Using an automatic diagram editor generator [7] we have built a graphical editor dedicated to syntactic editing in VRDL. This way, the user gets maximal ....

....programming languages, and Prograph, a visual programming language and environment currently used for moderately sized software projects [6] This success with casual and inexperienced programmers was the motivation for our design of VRDL. We used a Nassi Shneiderman diagram representation [8], which is not (as far as we know) incorporated in prominent software products, but which successfully serves as a visualization aid in teaching novice programmers. 6.0 Conclusions We have briefly introduced VRDL, a visual language describing how to build Web information repositories from large ....

[Article contains additional citation context not shown here]

I. Nassi and B. Shneiderman. Flowchart techniques for structured programming. ACM SIGPLAN Notices, 8(8):12-26, Aug. 1973.

No context found.

Nassi, I. and Shneiderman, B. (1973). Flowchart Techniques for Structured Programming. ACM SIGPLAN Notices, 8(8):12--26.

No context found.

Nassi I, Shneiderman B, `Flowchart techniques for structured programming', ACM SIGPLAN Notices, 8(8):12-26, 1973

No context found.

Nassi I, Shneiderman B, `Flowchart techniques for structured programming', ACM SIGPLAN Notices, 8(8):12-26, 1973

No context found.

Nassi, I., Shneiderman, B.: Flowchart Techniques for Structured Programming. Sigplan Notices, 8 (8), 1973.

First 50 documents

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC