S. Coote, J. Gallagher, J. Mariani, T. Rodden, A. Scott, D. Shepherd
{"title":"Graphical and iconic programming languages for distributed process control: an object oriented approach","authors":"S. Coote, J. Gallagher, J. Mariani, T. Rodden, A. Scott, D. Shepherd","doi":"10.1109/WVL.1988.18027","DOIUrl":"https://doi.org/10.1109/WVL.1988.18027","url":null,"abstract":"Distributed process control has gained in impetus over recent years as an alternative to central control systems. The object-oriented paradigm lends itself well to the description of such distributed systems. The Oscar model of active objects embodies this paradigm, and a support environment for the design and implementation of process control systems built on this model is outlined. A graphical system description language based on an extended GRAFCET notation is described. This language is used to specify the interobject messaging and action required for a particular control task. The parsing of the diagram provides the code for controlling a system. A higher-level iconic approach to the description of control strategies is also described. By restricting themselves to the domain of process control, the authors have been able to make substantial progress in the provision of an integrated support environment. The environment incorporates the notions of visual programming techniques and combines iconic and object-oriented paradigms to produce a consistent interface metaphor.<<ETX>>","PeriodicalId":123206,"journal":{"name":"[Proceedings] 1988 IEEE Workshop on Visual Languages","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127824789","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An interface description language for graph editors","authors":"Frances Paulisch","doi":"10.1109/WVL.1988.18022","DOIUrl":"https://doi.org/10.1109/WVL.1988.18022","url":null,"abstract":"A graph editor can be used as a graphical user interface to many applications. A language is defined which describes the interface between an application and a graph editor. The language describes attributes of the graph such as the various node and edge types and how they should be displayed. It also specifies the manner in which the graph is to be displayed (layout algorithm, layout constraints) and the set of editing commands. The use of this language will simplify the customization of graph editors. For various types of graph editors there would be corresponding descriptions. This interface description language is being incorporated into the EDGE graph editor.<<ETX>>","PeriodicalId":123206,"journal":{"name":"[Proceedings] 1988 IEEE Workshop on Visual Languages","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115702865","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"IGIP: a framework towards open-ended visual programming","authors":"F. Reeth, E. Flerackers, T. D'Hondt","doi":"10.1109/WVL.1988.18034","DOIUrl":"https://doi.org/10.1109/WVL.1988.18034","url":null,"abstract":"Within the visual programming paradigm there is a vast range of potential for creating program representations. To benefit by these possibilities, it could be worthwhile to make the program representation open-ended, i.e. modifiable to the specific needs of the user. The authors elucidate the tentative result of their research in this field around the iconic programming environment. An initially developed prototype framework is described, followed by a discussion on the current more open-ended system.<<ETX>>","PeriodicalId":123206,"journal":{"name":"[Proceedings] 1988 IEEE Workshop on Visual Languages","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124836529","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A model for the specification and interpretation of visual languages","authors":"G. Tortora, P. Leoncini","doi":"10.1109/WVL.1988.18010","DOIUrl":"https://doi.org/10.1109/WVL.1988.18010","url":null,"abstract":"A model for the specification of icon systems is proposed, and a general-purpose icon interpreter is presented, based on attribute grammars. In the model, the underlying context-free grammar is a picture grammar that expresses the syntactic aspects of the icon systems. An attribute evaluator computes the meaning of a given icon sentence by evaluating the designated s-attribute of the nonterminal on the root of the parse tree. As semantic rules are actually domain-independent rule schemata, during the attribute evaluation a domain-specific knowledge base is consulted. The meaning of the ionic sentence is expressed in terms of conceptual tree graphs, which are well-suited for later execution. The design of the model is based on the theory of generalized icons. The system diagram of the icon interpreter is presented. The icon dictionary, the domain specific knowledge base, and the attribute grammar are described.<<ETX>>","PeriodicalId":123206,"journal":{"name":"[Proceedings] 1988 IEEE Workshop on Visual Languages","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121888818","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"MPL-a graphical programming environment for matrix processing based on logic and constraints","authors":"R. Yeung","doi":"10.1109/WVL.1988.18021","DOIUrl":"https://doi.org/10.1109/WVL.1988.18021","url":null,"abstract":"The matrix is a commonly used two-dimensional data structure. On a two-dimensional display, 2-D data structures are more suitable for visualization than other linear structures such as lists. A description is given of a graphical programming environment for processing matrices, called MPL, in which matrices are integrated graphically as parts of the program. The system demonstrates that several ideas from programming language research-constraints, logic programming and functionals-can be combined with visual programming techniques to form an efficient mixed graphical-textual notation. It also provides a framework for expressing and prototyping matrix-related algorithms.<<ETX>>","PeriodicalId":123206,"journal":{"name":"[Proceedings] 1988 IEEE Workshop on Visual Languages","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128579912","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A knowledge-based approach to the shortest path problem in a digitized map","authors":"E. Jungert, Peter D. Holmes","doi":"10.1109/WVL.1988.18035","DOIUrl":"https://doi.org/10.1109/WVL.1988.18035","url":null,"abstract":"The shortest problem is considered in the context of a navigating ship or vehicle. The method presented is divided into a knowledge-based plan generator and a conventional program which acts upon cues present within the resulting plan. The initial phase of processing is performed by the knowledge-based system, which contains the necessary heuristics for directing the vehicle and keeping track of the local and global contexts through which it has to pass. The knowledge-based part of the system also creates control information for the algorithmic portion, i.e. the portion performing the computations necessary for constructing the final path. The knowledge structure is an extension of symbolic projections. The technique demonstrates significant efficiency while providing a number of advantages over other techniques.<<ETX>>","PeriodicalId":123206,"journal":{"name":"[Proceedings] 1988 IEEE Workshop on Visual Languages","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116263961","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Frank Ludolph, Yu-Ying Chow, D. Ingalls, Scott Wallace, K. Doyle
{"title":"The Fabrik programming environment","authors":"Frank Ludolph, Yu-Ying Chow, D. Ingalls, Scott Wallace, K. Doyle","doi":"10.1109/WVL.1988.18032","DOIUrl":"https://doi.org/10.1109/WVL.1988.18032","url":null,"abstract":"Fabrik is an experimental interactive graphical programming environment designed to simplify the programming process by integrating the user interface, the programmer language and its representation, and the environmental languages used to construct and debug programs. The programming language uses a functional, bidirectional data-flow model that trivializes syntax and eliminates the need for some traditional programming abstractions. Program synthesis is simplified by the use of aggregate and application-specific operations, modifiable examples, and the direct construction of graphical elements. The user interface includes several features designed to ease the construction and editing of the program graphs. Understanding of both individual functions and program operation are aided by immediate execution and feedback as the program is edited.<<ETX>>","PeriodicalId":123206,"journal":{"name":"[Proceedings] 1988 IEEE Workshop on Visual Languages","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116801339","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Automatic data visualization for novice Pascal programmers","authors":"B. Myers, Ravinder Chandhok, Atul Sareen","doi":"10.1109/WVL.1988.18028","DOIUrl":"https://doi.org/10.1109/WVL.1988.18028","url":null,"abstract":"Presenting the data structures from proams in a gr graphical manner can significantly help programmers understand and debug their programs. The Amethyst system, which runs on Apple Macintosh computers, provides attractive and appropriate default displays for data structures. The default displays include the appropriate forms for literals of the simple types inside type-specific shapes as well as stacked boxes for records and arrays. The authors' visualizations are integrated into an advanced programming environment that is used to teach programming methodology at the introductory level.<<ETX>>","PeriodicalId":123206,"journal":{"name":"[Proceedings] 1988 IEEE Workshop on Visual Languages","volume":"506 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124261808","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A tree systems inference algorithm for an iconic environment","authors":"A. Guercio, Shi-Kuo Chang","doi":"10.1109/WVL.1988.18011","DOIUrl":"https://doi.org/10.1109/WVL.1988.18011","url":null,"abstract":"A tree learning algorithm that uses tree systems inference techniques is presented. The algorithm observes similarity between subtrees and embedding tree structures and affects grammatical expansions that enlarge the input sample set. An application to a set of icons from the SIL-ICON Compiler v.3 is described. The algorithm adds learning capabilities to the compiler so the icon dictionary and the grammar are incrementally expanded.<<ETX>>","PeriodicalId":123206,"journal":{"name":"[Proceedings] 1988 IEEE Workshop on Visual Languages","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126484451","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Some remarks on developing application programs in Visual","authors":"K. Cheng, M. Hwu, S. Hsu","doi":"10.1109/WVL.1988.18015","DOIUrl":"https://doi.org/10.1109/WVL.1988.18015","url":null,"abstract":"A visual programming environment for users to develop their own defined icon-based Chinese input methods is presented. The purpose is to discuss some interesting ideas on developing application programs dealing with icon objects. It is shown that Chinese characters are concrete icons, that are representable as webs (decomposition graphs). A grammar that generates these webs is a context-free web grammar, and so a Chinese input simulator is a machine that accepts these webs. Developing such a simulator can be regarded as the construction of an user-defined application program. The authors show that a form-based visual approach can be used to specify the simulation behaviors for defining and evaluating icon-based Chinese input methods, although the visual objects dealt with are concrete icons.<<ETX>>","PeriodicalId":123206,"journal":{"name":"[Proceedings] 1988 IEEE Workshop on Visual Languages","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133644408","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}