Furnas G.: New Graphical Reasoning Models for Understanding Graphical Interfaces, Proc. of CHI'91, 71-78  Home/Search   Document Not in Database   Summary   Related Articles   Check

....letters, filling and indenting, are performed by checking whether a pattern is included in the current font table or not. Although VIEWPOINT never achieved programmability, it surprised many researchers that such a complex computation artifact could be built without hiding any information. BitPict[4] is bitmap based rewriting system that is programmable and achieves total visibility. Computations Yasunori Harada : NTT Communication Science Labs. E mail: hara acm.org and Richard Potter : Japan Science and Technology Corporation such as the adding of Roman numerals are possible with no hidden ....

George W. Furnas. New graphical reasoning models for understanding graphical interfaces. In Proceedings of ACM CHI'91 Conference on Human Factors in Computing Systems, pages 7178, 1991.

....their appearance, although they are all based on the same idea: match a picture or a part of a picture against the left hand side of a rewrite rule, and replace it by the rule s right hand side. Christensen s AMBIT languages [15, 16] operate on graph and on liststructures, Furnas BITPICT system [23] operates on pixel arrays, and Kahn and Saraswat s Pictorial Janus [35] rewrites closed contours. 1.2 Strengths of Visual Languages There are many arguments in favor of visual programming. Usually, these arguments center around the fact that humans are known to process pictures easier and faster ....

George W. Furnas. New Graphical Reasoning Models for Understanding Graphical Interfaces. In Proc. CHI '91, pages 71 -- 78, New Orleans, LA, 1991.

....University of Colorado, Boulder CO 80309 0430 (303) 492 1349, ralex cs.colorado.edu (303) 492 1503, ambach cs.colorado.edu Fax: 303) 492 2844 http: www.cs.colorado.edu ralex http: www.cs. colorado.edu ambach Abstract based on graphical rewrite rules, such as Agentsheets [2] BitPict [3], ChemTrains [4] KidSim [5] and Vampire [6] are effective end user programming approaches allowing users to define behavior by editing before and after pictures. These rule based, visual programming environments provide ease of use but are limited in their expressiveness. The question raised is ....

Furnas, G. W., "New Graphical Reasoning Models for Understanding Graphical Interfaces," Proceedings of CHI'91, New Orleans, LA, 1991, pp. 71-78.

....Early examples of visual graph rewriting languages are AMBIT G [22] and PLAN2D [28] Postponing the presentation of graph rewriting (transformation) languages to Section 3. 6, our history of visual rule based programming languages (VRPLs) starts some years later on with systems like BITPICT [42], ChemTrains [6] KidSim [100] Vampire [68] and PictorialJanus [58] All of them, except PictorialJanus, belong to the category of icon rewriting languages. Their underlying knowledge base is not a set of facts with a superimposed graphical representation, but a two dimensional picture, usually ....

....side (RHS) The whole execution process stops as soon as no more rules are applicable. Despite their common execution model, VRPLs differ from each other with respect to many aspects like the structure of their workspace, the details of the pattern matching process, and so on: ffl In BITPICT [42] workspaces as well as LHS and RHS of rules are simple pixel grids; a rule matches an area of the workspace which is identical to 3.2. VISUAL LANGUAGES AND ENVIRONMENTS 115 its LHS after geometric reflection and rotation operations. The system does not support modeling of higher level entities. ....

[Article contains additional citation context not shown here]

G. W. Furnas. New graphical reasoning models for understanding graphical interfaces. In Proc. of Conf. on Human Factors in Computer Systems - CHI'91, pages 71--78, New York, 1991. ACM Press.

....to introduce a transaction concept which allows to handle transient diagram states that temporarily do not have a feasible geometric interpretation. This can not be achieved with normal constraint based grammar models. Other recent work on the formal specification of diagram animation includes [GC96, UD95, UD97, KK91, TMMY94, Fur90, Fur91, Fur92, Bel92, BL93]. In [GC96] a specification of the execution of the visual programming language Pictorial Janus is given. However, the approach is only capable of specifying each single transitions between two diagram states seperately. Since the formal model does not include any notion of state or change, it ....

....execution or animation on it. The approach to dynamic diagram specification presented in [UD95, UD97] is based on rewrite specifications, too, but is directly targeted for interactive languages, for example the specification of diagram editors. Other work on the specification of diagram animation [KK91, TMMY94, Fur90, Fur91, Fur92, Bel92, BL93] considers the execution or animation of diagrams as a separate problem from their syntactic and semantic specification. In contrast we are aiming at integrating both aspects of diagram specification by extending well known and proven methods for the visual syntax specification to the realm of ....

G.W. Furnas. New graphical reasoning models for understanding graphical interfaces. In Human Factors in Computing Systems ACM CHI 91, pages 71--78, New Orleans, 1991.

....2.6.2. Programming with Graphical Rewrite Rules The graphical rewrite rule approach (illustrated in the The Agentsheets System In Use section of this Chapter) of programming allows the definition of simple behavior by manipulating pictures. Rewrite rules 73 have been explored before by Furnas [37] in the BitPict system, and by Bell [4 6] in ChemTrains. The BitPict system is limited to graphically reason about pixels. ChemTrains can deal with more complex objects such as boxes, circles, and entire bitmaps. Both BitPict and ChemTrains have no included abilities to augment graphical rules ....

Furnas, G. W., "New Graphical Reasoning Models for Understanding Graphical Interfaces," Proceedings CHI'91, New Orleans, Louisiana, 1991, pp. 71-78.

....applet and published on the web. The goal of this work is to support more directly the requirements of programming in social settings where programming is no longer considered a solitaire activity. In contrast to the original before and after graphical rules based language [Bell and Lewis 1993, Furnas 1991, Kirsch 1964] used in AgentSheets [Repenning 1994] and KidSim Cocoa [Smith, et al. 1994] the new Visual AgenTalk language was designed with web based collaboration in mind [Repenning and Ambach 1996] This kind of support requires that computational artifacts can be easily shared [MacLean, et al. ....

Furnas, G. W., 1991. New Graphical Reasoning Models for Understanding Graphical Interfaces. InProceedings CHI'91 (New Orleans, LA). ACM Press, 71-78.

.... moved beyond basic Logo by providing an integrated programming environment combining programming language with content material [5] Others have scaffolded programming visually either by using iconic languages [30] or by combining graphical rewrite rules with flavors of programming by example [1, 10, 14, 17, 22, 27 29]. Guzdial added interactive scaffolding machinery to programming environments [12] to help users to understand programming related problem solving. The scaffolding principles presented in this paper are concerned with language design issues combining textual and iconic representations to increase ....

Furnas, G. W., "New Graphical Reasoning Models for Understanding Graphical Interfaces," Proceedings CHI'91, New Orleans, LA, ACM Press, 1991, pp. 7178.

....Rewrite Rules, Proceeding of Visual Languages, Darmstadt, Germany, 1995, pp. 226 233. kinds of spatial relationships objects are involved in. Simple objects are not suggestive for complex interpretations. Kirsch used abstract character symbols such as V, H, and L in his rules. In BitPict [4], objects are simple black or white pixels. However, in rewrite rules featured in ChemTrains [2] Vampire [7] Agentsheets [10] and KidSim [15] objects can be much more complex and realistic looking. The rule depicted in Figure 1 is likely to be interpreted as a situation in which a car on a road ....

....rule model with reflection and rotation. Furnas included these 232 Repenning, A. Bending the Rules: Steps toward Semantically enriched Graphical Rewrite Rules, Proceeding of Visual Languages, Darmstadt, Germany, 1995, pp. 226 233. transformations as attributes to rewrite rules in his BitPict [4] system. The application of these transformation to entire situations consisting of complex objects is less obvious. If the situations to be transformed consist of orientation free objects, such as pixels, then the transformation of individual objects is irrelevant. However, if objects have their ....

Furnas, G. W., "New Graphical Reasoning Models for Understanding Graphical Interfaces," Proceedings CHI'91, New Orleans, LA, 1991, pp. 71-78.

....also to react to user events (for example, a user clicking at an agent) Furthermore, the state of an agent is visualized by an entire bitmap instead by a single pixel on the screen. Furnas BITPICT system employs graphical, two dimensional rewriting rules to augment human spatial problem solving [5]. Like CAs, BITPICT operates on the pixel level. Figure 2. Agentsheets Application: Circuits The consistency between a real world situation and a domain oriented spatio temporal metaphor is controlled by the person creating the application domain tailored visual programming system. The Circuits ....

. G. W. Furnas, "New Graphical Reasoning Models for Understanding Graphical Interfaces," Proceedings CHI'91, New Orleans, Louisiana, 1991, pp. 71-78.

....finergrained control of resources than the conventional models. Keywords visual language, distributed system, network application 1 Introduction A figure rewriting language works by rewriting figures on a display according to rewriting rules, which may also be depicted on the display( 7] 1][3][4] ChemTrains [1] successively finds and rewrites the figure that matches the rewriting rules. Vispatch s [4] rewriting process is driven by events issued by the user and the system itself. This event driven mechanism enables the language to be interactive. Moreover, it improves the rewriting ....

....language DVispatch, which was created by extending our existing visual language running on a single host. The approach, Distributed Tiling, proposed here for extending the runtime environment is so general that most figure rewriting visual languages, such as Vampire[7] ChemTrains[1] and BitPict[3], can be extended by it. With Distributed Tiling, the resulting language naturally satisfies the principle of distributed visibility, a network version of visibility. Several sample programs including a simple multi user application and a distributed algorithm has been presented. An advantage of ....

Furnas, G. W., New Graphical Reasoning Models for Understanding Graphical Interfaces, Proc.CHI95 .

....for UNIX takes about 1.1 seconds to move invaders by one dot. 6 Related Work Visulan is a rule based visual programming language. Executing the first matching rule in a list of test action rules comes from production systems [1] Graphical rewrite rules to change bitmap pictures are from BITPICT [2]. BITPICT is simple and easy to understand, however it is powerless. Many graphical rewrite rule based systems have been proposed in the last several years in order to be more powerful than BITPICT. ChemTrains [3] uses the topology rather than the geometry of a pattern. Mondrian [4] attaches ....

G.Furnas, New graphical reasoning models for understanding graphical interfaces, Proc. CHI, pp.71-78, 1991.

....these languages, a program consists of a set of before after pairs of diagrams. State consists of a set of graphical entities and their relationships. If the before part of a before after pair matches part of the state, the state is transformed to conform to the after part of the pair. BitPict [7] is one of the simplest of such languages, in that its before after pairs are simple pixel patterns. ChemTrains [1] and Vampire [12] allow more complex visual entities and relations, and also permit variables in the transformation rules. Completely visual languages of both types have the advantage ....

....function at four different steps in its execution. The four snapshots are labeled with the corresponding statement number from int a[100] n; 1] void BubbleSort(void) int hold, j, pass, exch; 2] pass = n; 3] do [4] exch = 0; 5] for (j=0; j (pass 1) j ) 6] if (a[j] a[j 1] [7] hold = a[j] 8] a[j] a[j 1] 9] a[j 1] hold; 10] exch = 1; 11] pass ; 12] while (exch) Figure 11: Vipr Bubble Sort Function Figure 11. In the interest of space and simplicity, some text labels have been omitted, and areas that are too crowded are shaded, indicating that there is ....

[Article contains additional citation context not shown here]

G. W. Furnas. New graphical reasoning models for understanding graphical interfaces. In Proceedings of CHI'91, pages 71--78, Anaheim, CA, April 1981. ACM Press.

....Early examples of visual graph rewriting languages are AMBIT G [20] and PLAN2D [21] Postponing the presentation of graph rewriting (transformation) languages to Section 1. 6, our history of visual rule based programming languages (VRPLs) starts some years later on with systems like BITPICT [48], ChemTrains [49] KidSim [50] Vampire [51] and PictorialJanus [52] All of them, except PictorialJanus, belong to the category of icon rewriting languages. Their underlying knowledge base is not a set of facts with a superimposed graphical representation, but a two dimensional picture, usually ....

....side (RHS) The whole execution process stops as soon as no more rules are applicable. Despite their common execution model, VRPLs differ from each other with respect to many aspects like the structure of their workspace, the details of the pattern matching process, and so on: ffl In BITPICT [48] workspaces as well as LHS and RHS of rules are simple pixel grids; a rule matches an area of the workspace which is identical to its LHS after geometric reflection and rotation operations. The system does not support modeling of higher level entities. ffl KidSim [50] uses different types of ....

[Article contains additional citation context not shown here]

G. W. Furnas. New graphical reasoning models for understanding graphical interfaces. In Proc. of Conf. on Human Factors in Computer Systems - CHI'91, pages 71--78, New York, 1991. ACM Press.

....and assignments are represented textually in this paper. Likewise, the representation of data, data types, the environment, and the store are textual. 2 Related Work Completely Visual Programming Languages One of the earliest languages based on graphical transformation rules was BitPict [8], in which a program is a set of rules used to transform patterns of pixels on a grid. If a pattern of pixels on part of BitPict s grid matches the precondition pattern of one of the rules, that pattern is altered to conform to the postcondition pattern of the rule. A number of fairly ....

....is unchanged. Similarly, objects associated with variables R and R are unchanged, and the arrows connecting them are also unchanged. One interesting aspect or our semantic technique is that it represents the previously mentioned class of graphical transformation languages exemplified by BitPict [8], ChemTrains [2] and Vampire [11] Unlike VIPR, where a snapshot of an executing program contains both program state and all the remaining 10 instructions, these languages provide for a graphical configuration representing the program state and a separate set of graphical rules representing the ....

G. W. Furnas (1991) New graphical reasoning models for understanding graphical interfaces. In: Human Factors in Computer Systems: CHI `91 Conference Proceedings New Orleans, 71-78.

....language GOOD [17] It offers additional means for defining derived data and for nondeterministic programming. Taking into account that PROGRES is a graphical and executable specification language, it might be useful to have a final look onto visual rule oriented languages like BITPICT [15] and ChemTrains [3] Their deficiencies come from the following sources: They have their main focus on manipulation of data structures and data definition sublanguages are not provided. Even a language like VAMPIRE with its class hierarchies and icon rewriting rules [29] comes without a rigid type ....

Furnas G.: New Graphical Reasoning Models for Understanding Graphical Interfaces, Proc. of CHI'91, 71-78

....the user to construct terms over the language which can be executed by the term rewriter. The additional complexity of visual representations (in comparison to text) suggests that, adopting a similar approach in defining visual language semantics would be even more effective. Furnas BITPICT [6] and McIntyre s VAMPIRE [15] also use picture rewriting for defining semantics of iconic languages. 6.2 Visual Language Specification To specify visual languages we need a specification formalism. Following the ASF SDF approach, we propose two formalisms: one for the syntax and the other for the ....

G. W. Furnas. New graphical reasoning models for understanding graphical interfaces. In Proc. CHI '91, pages 71--78, April 1991.

....languages, a program consists of a set of before after pairs of diagrams. State consists of a set of graphical entities and their relationships. If the before part of a before after pair matches part of the state, the state is transformed to conform to the after part of the pair. BITPICT [11] is one of the simplest of such languages, in that its before after pairs are simple pixel patterns. ChemTrains [1] and Vampire [16] allow more complex visual entities and relations, and also permit variables in the transformation rules. Completely visual languages of both types have the advantage ....

G. W. Furnas. New graphical reasoning models for understanding graphical interfaces. In Proceedings of CHI'91, pages 71--78, Anaheim, CA, April 1981. ACM Press.

No context found.

Furnas G.: New Graphical Reasoning Models for Understanding Graphical Interfaces, Proc. of CHI'91, 71-78

No context found.

G. W. Furnas, New graphical reasoning models for understanding graphical interfaces, Proc. CHI '91, April 1991, pp. 71--78.

No context found.

George W. Furnas, #1991#. New Graphical Reasoning Models for Understanding Graphical Interfaces. In Proceedings of CHI '91, pages 71#78.

No context found.

George W. Furnas, (1991). New Graphical Reasoning Models for Understanding Graphical Interfaces.

No context found.

George W. Furnas (1991). New Graphical Reasoning Models for Understanding Graphical Interfaces.

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