T. R. G. Green, M. Petre & R. K. E, Bellamy (1991) Comprehensibility of visual and textual programs: a test of superlativism against the `Match--Mismatch' conjecture. Empirical Studies of Programmers: 4th Workshop, Ablex, Norwood, NJ, pp. 121--146.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....of programming than flowcharts, which have long been known to be helpful aids in program understanding, could be easier to understand and generate for novice programmers. However, experiments which compared the comprehensibility of textual with visual programs failed to give support to such claims (Green et al. 1991; Moher et al. 1993) The choice of graphical notations and diagramming techniques is rarely empirically justified. Both graphical programming and visual programming languages use arrows, lines or juxtaposition to express order or sequence. Again, there is not enough empirical evidence to justify ....

Green, T.R.G., Petre, M., and Bellamy, R.K.E. (1991), Comprehensibility of visual and textual programs: A test of superlativism against the `match-mismatch' conjecture. In J. KoenemannBelliveau, T.G. Moher, and S.P. Robertson (Eds.), Empirical Studies of Programmers: Fourth Workshop, Ablex Publishing Corp.

....method to apply both in analyzing the individual diagrams as well as in designing the 10 integrated process. First, the perceptual explicitness arising from decomposition is expected to provide effective visual cues that trigger the recognition of relevant information from different diagrams (Green, Petre and Bellamy, 1991). For example, as can be seen in Figure 1, the entity John can be more easily recognized in Figure 1b than in Figure 1a. Therefore, if a diagram has a reference to the entity John , it would be more easily recognized when information decomposition is supported than when not supported. Once such ....

....provide a wide variety of different diagrams that represent the same information in a diagrammatically different form and organization. The systems analysts the users who work with these diagrams will be able to select particular diagrammatic representations based on the task at hand (Green, Petre and Bellamy, 1991; Good, 1996) Some tasks may be easier to perform or less error prone with a particular diagrammatic representation. Therefore the possibility of selecting an appropriate diagrammatic representation will be of great assistance. Furthermore, the results of this study may be applied in designing ....

Green, T. R. G., Petre, M. and Bellamy, R. K. E. (1991). Comprehensibility of Visual and Textual Programs: A Test of Superlativism Against the `Match-Mismatch' Conjecture, In J. Koenemann-Belliveau, T.

....the method to apply both in analyzing the individual diagrams as well as in designing the integrated process. 9 First, the perceptual explicitness arising from decomposition is expected to provide effective visual cues that trigger the recognition of relevant information from different diagrams (Green, Petre and Bellamy, 1991). For example, as can be seen in Figure 1, the entity John can be more easily recognized in Figure 1b than in Figure 1a. Therefore, if a diagram has a reference to the entity John , it would be more easily recognized when information decomposition is supported than when not supported. Once ....

....provide a wide variety of different diagrams that represent the same information in a diagrammatically different form and organization. The systems analysts the users who work with these diagrams will be able to select particular diagrammatic representations based on the task at hand (Green, Petre and Bellamy, 1991; Good, 1996) Some tasks may be easier to perform or less error prone with a particular diagrammatic representation. Therefore the possibility of selecting an appropriate diagrammatic representation will be of great assistance. Furthermore, the results of this study may be applied in designing ....

Green, T. R. G., Petre, M. and Bellamy, R. K. E. (1991). Comprehensibility of Visual and Textual Programs: A Test of Superlativism Against the `Match-Mismatch' Conjecture, In J. Koenemann-Belliveau, T.

.... and in HyperCard, which shows that users spend considerable time debugging and that they have difficulty succeeding at it (Brown Gould, 1987; Nardi Miller, 1991; Eisenstadt, 1993) There have been several studies of other aspects of visual programming languages (Cunniff Taylor, 1987; Green, Petre, Bellamy, 1991; Moher, Mak, Blumenthal, Leventhal, 1993; Pandey Burnett, 1993; Petre, 1995; Modugno, Corbett, Myers, 1996; Whitley, 1997) but the effects of liveness on debugging (or on any other task) in these languages were not studied. Our evidence connecting liveness to engagement in enhancing the ....

Green, T., Petre, M., & Bellamy, R. (1991). Comprehensibility of Visual and Textual Programs: A Test of Superlativism Against the `Match-Mismatch' Conjecture. In J. Koenemann-Belliveau, T. Moher, S. Robertson (Eds.), Empirical Studies of Programmers: Fourth Workshop. Norwood, NJ: Ablex.

....with respect to their task demands some require straightforward read off from ERs, some don t require the use of an ER and some require the re construction of an ER. The computational efficiency of an ER varies with the task requirement (e.g. Larkin 37 Simon, 1987; Vessey, 1991; Day, 1988; Green, Petre Bellamy, 1991). For example, the data in a spreadsheet contains precise values but is difficult to search. A bar chart generated from the spreadsheet is much more useful for comparing sets of data because our perceptual subsystems make visual comparison seem effortless. One representation is suited to one task ....

Green, T.R.G., Petre, M. & Bellamy, R.K.E. [1991] Comprehensibility of visual and textual programs: A test of superlativism against the `matchmismatch ' conjecture. In J. Koermann-Bellivega, T.G. Moher & S.P. Robertson (Eds.) Empirical studies of programmers, Ablex.

....expressions as a means of communication, there is no need to learn computer specific concepts beforehand, resulting in a friendly computing environment which enables immediate access to computers even for computer non specialists who pursue application domains of their own. 18] Green et al. [14] and Moher et al. 25] summarise claims such this as the superlativist position; i.e. graphical representations are inherently superior to textual representations. Both the Green and Moher groups argue that this claim is not supported by the available experimental evidence. Further, they argue ....

....techniques are useful for different stages of the design process. Other researchers explore the different circumstances under which certain types of visual expressions are useful: Gerstendorfer Rohr [9] hereafter, GR) Moher et al. 25] hereafter, the Moher group) and Green et al. [14] (hereafter, the Green group) The GR work distinguishes between visual, verbal, and formal tasks: ffl A GR visual task is inherently structural; e.g. laying out a table so that related utensils are near each other. GR visual tasks are best specified and executed using diagrams. ffl A GR verbal ....

T.R.G. Green, M. Petre, and R.K.E. Bellamy. Comprehensibility of Visual and Textual Programs: The Test of Superlativism Against the "Match-Mismatch" Conjecture. In Empirical Studies of Programmers: Fourth Workshop, pages 121--146, 1991.

....with respect to their task demands some require straightforward read off from ERs, some don t require the use of an ER and some require the re construction of an ER. The computational efficiency of an ER varies with the task requirement (e.g. Larkin Simon, 1987; Vessey, 1991; Day, 1988; Green, Petre Bellamy, 1991). For example, the data in a spreadsheet contains precise values but is difficult to search. A bar chart generated from the spreadsheet is much more useful for comparing sets of data because our perceptual subsystems make visual comparison seem effortless. One representation is suited to one task ....

Green, T.R.G., Petre, M. & Bellamy, R.K.E. [1991] Comprehensibility of visual and textual programs: A test of superlativism against the `match-mismatch' conjecture. In J. Koermann-Bellivega, T.G. Moher & S.P. Robertson (Eds.) Empirical studies of programmers, Ablex.

....expressions as a means of communication, there is no need to learn computer specific concepts beforehand, resulting in a friendly computing environment which enables immediate access to computers even for computer non specialists who pursue application domains of their own. 20] Green et al. [17] and Moher et al. 33] summarise claims such this as the superlativist position; i.e. graphical representations are inherently superior to textual representations. Both the Green and Moher groups argue that this claim is not supported by the available experimental evidence. Further, they argue ....

T.R.G. Green, M. Petre, and R.K.E. Bellamy. Comprehensibility of Visual and Textual Programs: The Test of Superlativism Against the "Match-Mismatch" Conjecture. In Empirical Studies of Programmers: Fourth Workshop, pages 121--146, 1991.

....program representations to determine whether different representations might prove useful for different audiences and different situation. Some have found visual representations to be better than textual representations (e.g. Cunniff and Taylor, 1987) some have found them to be worse (e.g. Green, Petre and Bellamy, 1991), and some have found them to be the same (e.g. Moher, et al. 1993) What we can conclude from these studies is that neither text nor graphics is in itself inherently superior; rather, the extent to which a particular notation supports users in their tasks depends on the context in which the ....

....as a firm result. They merely indicate that further investigation is required. be easier to locate than their corresponding textual counterparts in the text based language. We hope to further explore this hypothesis by performing an additional within subject study, similar to the one found in Green, Petre, and Bellamy, 1991, to see if differences in the micro structures of the two languages do indeed affect users speed of comprehension. In addition, the graphical aspects of the comic strip language may make it easier to see the scope of control constructs. This may make various parts of a program easier to ....

Green, T., Petre, M., and Bellamy, R. (1991). Comprehensibility of Visual and Textual Programs: A Test of Superlativism Against the `Match-Mismatch' Conjecture. In Empirical Studies of Programmers: Fourth Workshop. Ablex Publishing Corporation.

....with the basics of 208 N. STANKOVIC et al. message passing parallel programming that were taught during the first part of the semester, and in related courses they might have attended before. The study consisted of a presentation, two case studies, a questionnaire, and a same different test [13]. Two hypotheses were under investigation: z PCG helps program development by highlighting control flow and data flow information in parallel programs. z Using the same (or similar) formalism throughout the whole software lifecycle facilitates comprehension. Due to the nature of PCG ....

T. R. G. Green, M. Petre & R. K. E, Bellamy (1991) Comprehensibility of visual and textual programs: a test of superlativism against the `Match--Mismatch' conjecture. Empirical Studies of Programmers: 4th Workshop, Ablex, Norwood, NJ, pp. 121--146.

No context found.

Green, T.R.G., Petre, M. & Bellamy, R.K.E. (1991). Comprehensibility of visual and textual programs: A test of superlativism against the `match-mismatch' conjecture. In J. KoenemannBelliveau, T.G. Moher & S.P. Robertson (Eds.): Empirical Studies of Programmers: Fourth Workshop Norwood, NJ: Ablex, pp. 121-146.

....project. The subjects were given one week to perform the task. The students had been gradually prepared for this task during the term. Throughout the course, they had been reading papers about VPLs, writing programs in a variety of e See, for example, the study of the VPL LabView (5 subjects) [32], the study of the VPL ChemTrains (6 subjects) 15] and the study of a generic Petri net language (12 subjects) 33] REPRESENTATION DESIGN BENCHMARKS 591 VPLs and discussing the research problems associated with VPLs, including static representation. Just before they were asked to perform the ....

T. Green, M. Petre & R. Bellamy (1991) Comprehensibility of visual and textual programs: a test of superlativism against the `match---mismatch' conjecture. In: Empirical Studies of Programmers: Fourth Workshop ( J. Koenemann-Belliveau, T. Moher & S. Robertson, eds). Ablex Publishing, Norwood, NJ.

No context found.

T.R.G. Green, M. Petre, and R.K.E. Bellamy (1991). Comprehensibility of Visual and Textual Programs: A Test of Superlativism Against the `Match-Mismatch' Conjecture. In Empirical Studies of Programmers: Fourth Workshop.

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