{"title":"armvls -原子反应模型视觉语言系统——一种新的动画化算法","authors":"K. Warendorf, W. J. Hsu, P. Y. Seah","doi":"10.1109/ICICS.1997.652117","DOIUrl":null,"url":null,"abstract":"Visual language (VL) is a programming language without textual codes and algorithm animation (AA) is about visualizing a computer algorithm. Visual programming (VP) and AA are traditionally separate factions in software visualization (SV). With the atomic reaction model (ARM) project we have bridged these two major branches in SV. Due to the advancements in graphics technology, many developers have come up with graphical applications that claim to be VLs. We see in this diversity of VP systems two main categories of VLs. They are the application specific and the general programming (GP). GPVLs are be developed with the eventual aim of substituting textual programming. Currently, there are two main approaches: graphical rewrite systems and dataflow VLs. AA systems have up to this point of time used the approach pioneered by the BALSA AA system to animate algorithms. Opsis, a Java applet for teaching binary tree algorithms, has shown that the visual approach to AA is more effective as a learning tool. Therefore in this project, we create a VP system that can animate most of the algorithms traditionally done by textual coding. The ARM offered an alternative to the textual codes used in BALSA systems. We have also proven that a VL is capable of solving complex problems without sacrificing its visual clarity and showed that graphical rewrite systems are not necessarily simplistic and without much flow control as compared to dataflow VLs. We have even laid down the frameworks of a heterogeneous VL. Our research has successfully opened the door to true GPVLs.","PeriodicalId":71361,"journal":{"name":"信息通信技术","volume":"106 1","pages":"939-943 vol.2"},"PeriodicalIF":0.0000,"publicationDate":"1997-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"ARMVLS-atomic reaction model visual language system-a new way of animating algorithms\",\"authors\":\"K. Warendorf, W. J. Hsu, P. Y. Seah\",\"doi\":\"10.1109/ICICS.1997.652117\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Visual language (VL) is a programming language without textual codes and algorithm animation (AA) is about visualizing a computer algorithm. Visual programming (VP) and AA are traditionally separate factions in software visualization (SV). With the atomic reaction model (ARM) project we have bridged these two major branches in SV. Due to the advancements in graphics technology, many developers have come up with graphical applications that claim to be VLs. We see in this diversity of VP systems two main categories of VLs. They are the application specific and the general programming (GP). GPVLs are be developed with the eventual aim of substituting textual programming. Currently, there are two main approaches: graphical rewrite systems and dataflow VLs. AA systems have up to this point of time used the approach pioneered by the BALSA AA system to animate algorithms. Opsis, a Java applet for teaching binary tree algorithms, has shown that the visual approach to AA is more effective as a learning tool. Therefore in this project, we create a VP system that can animate most of the algorithms traditionally done by textual coding. The ARM offered an alternative to the textual codes used in BALSA systems. We have also proven that a VL is capable of solving complex problems without sacrificing its visual clarity and showed that graphical rewrite systems are not necessarily simplistic and without much flow control as compared to dataflow VLs. We have even laid down the frameworks of a heterogeneous VL. Our research has successfully opened the door to true GPVLs.\",\"PeriodicalId\":71361,\"journal\":{\"name\":\"信息通信技术\",\"volume\":\"106 1\",\"pages\":\"939-943 vol.2\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1997-09-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"信息通信技术\",\"FirstCategoryId\":\"1093\",\"ListUrlMain\":\"https://doi.org/10.1109/ICICS.1997.652117\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"信息通信技术","FirstCategoryId":"1093","ListUrlMain":"https://doi.org/10.1109/ICICS.1997.652117","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
ARMVLS-atomic reaction model visual language system-a new way of animating algorithms
Visual language (VL) is a programming language without textual codes and algorithm animation (AA) is about visualizing a computer algorithm. Visual programming (VP) and AA are traditionally separate factions in software visualization (SV). With the atomic reaction model (ARM) project we have bridged these two major branches in SV. Due to the advancements in graphics technology, many developers have come up with graphical applications that claim to be VLs. We see in this diversity of VP systems two main categories of VLs. They are the application specific and the general programming (GP). GPVLs are be developed with the eventual aim of substituting textual programming. Currently, there are two main approaches: graphical rewrite systems and dataflow VLs. AA systems have up to this point of time used the approach pioneered by the BALSA AA system to animate algorithms. Opsis, a Java applet for teaching binary tree algorithms, has shown that the visual approach to AA is more effective as a learning tool. Therefore in this project, we create a VP system that can animate most of the algorithms traditionally done by textual coding. The ARM offered an alternative to the textual codes used in BALSA systems. We have also proven that a VL is capable of solving complex problems without sacrificing its visual clarity and showed that graphical rewrite systems are not necessarily simplistic and without much flow control as compared to dataflow VLs. We have even laid down the frameworks of a heterogeneous VL. Our research has successfully opened the door to true GPVLs.