{"title":"一种基于可视化编程语言的数据流测试方法","authors":"M. Karam, Trevor J. Smedley","doi":"10.1109/HCC.2002.1046355","DOIUrl":null,"url":null,"abstract":"In this paper we extend our testing system previously presented (2001) to allow users to visually investigate intraprocedural du-associations, or du-associations that exist within the boundary of a procedure in the visual programming language Prograph.","PeriodicalId":298317,"journal":{"name":"Proceedings IEEE 2002 Symposia on Human Centric Computing Languages and Environments","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A data-flow testing methodology for a dataflow based visual programming language\",\"authors\":\"M. Karam, Trevor J. Smedley\",\"doi\":\"10.1109/HCC.2002.1046355\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we extend our testing system previously presented (2001) to allow users to visually investigate intraprocedural du-associations, or du-associations that exist within the boundary of a procedure in the visual programming language Prograph.\",\"PeriodicalId\":298317,\"journal\":{\"name\":\"Proceedings IEEE 2002 Symposia on Human Centric Computing Languages and Environments\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-09-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings IEEE 2002 Symposia on Human Centric Computing Languages and Environments\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HCC.2002.1046355\",\"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 IEEE 2002 Symposia on Human Centric Computing Languages and Environments","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HCC.2002.1046355","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A data-flow testing methodology for a dataflow based visual programming language
In this paper we extend our testing system previously presented (2001) to allow users to visually investigate intraprocedural du-associations, or du-associations that exist within the boundary of a procedure in the visual programming language Prograph.