{"title":"并发程序及其执行的完整可视化","authors":"K. Kahn, V. Saraswat","doi":"10.1109/WVL.1990.128375","DOIUrl":null,"url":null,"abstract":"The theory and methods for a completely visual formalism for programs and their executions are presented. The appearance, and not the construction, completely describes programs, data, and states of execution. Programs, their model of execution, and their execution traces are visualized in the same pictorial terms. A list of advantages of this visual formalism is given. A case study using the Janus language is presented.<<ETX>>","PeriodicalId":256667,"journal":{"name":"Proceedings of the 1990 IEEE Workshop on Visual Languages","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"136","resultStr":"{\"title\":\"Complete visualizations of concurrent programs and their executions\",\"authors\":\"K. Kahn, V. Saraswat\",\"doi\":\"10.1109/WVL.1990.128375\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The theory and methods for a completely visual formalism for programs and their executions are presented. The appearance, and not the construction, completely describes programs, data, and states of execution. Programs, their model of execution, and their execution traces are visualized in the same pictorial terms. A list of advantages of this visual formalism is given. A case study using the Janus language is presented.<<ETX>>\",\"PeriodicalId\":256667,\"journal\":{\"name\":\"Proceedings of the 1990 IEEE Workshop on Visual Languages\",\"volume\":\"17 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1990-10-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"136\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 1990 IEEE Workshop on Visual Languages\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WVL.1990.128375\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 1990 IEEE Workshop on Visual Languages","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WVL.1990.128375","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Complete visualizations of concurrent programs and their executions
The theory and methods for a completely visual formalism for programs and their executions are presented. The appearance, and not the construction, completely describes programs, data, and states of execution. Programs, their model of execution, and their execution traces are visualized in the same pictorial terms. A list of advantages of this visual formalism is given. A case study using the Janus language is presented.<>