{"title":"Are knowledge representations the answer to requirement analysis?","authors":"I. Zualkernan, W. Tsai","doi":"10.1109/ICCL.1988.13094","DOIUrl":"https://doi.org/10.1109/ICCL.1988.13094","url":null,"abstract":"A clear distinction between a requirement and a specification is crucial to an understanding of how and why knowledge representation techniques can be useful for the requirement stage. A useful distinction is to divide the requirement analysis phase into a problem specification and system specification phases. It is argued that it is necessary first to understand what kind of knowledge is in the requirement analysis process before worrying about representational schemes.<<ETX>>","PeriodicalId":219766,"journal":{"name":"Proceedings. 1988 International Conference on Computer Languages","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125328771","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":"Object-oriented conceptual programming based on PROT nets","authors":"M. Baldassari, G. Bruno","doi":"10.1109/ICCL.1988.13068","DOIUrl":"https://doi.org/10.1109/ICCL.1988.13068","url":null,"abstract":"The authors present PROTOB, an object-oriented computer-aided-software-engineering system based on high-level Petri nets called PROT nets. It consists of several tools supporting specification, modeling, and prototyping activities within the framework of the operational software-life-cycle paradigm. As its major application area it addresses discrete-event dynamic systems, such as process control systems and communication protocols.<<ETX>>","PeriodicalId":219766,"journal":{"name":"Proceedings. 1988 International Conference on Computer Languages","volume":"39 26","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131804463","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":"Programming parallel computers","authors":"M. Chandy K.","doi":"10.1109/ICCL.1988.13079","DOIUrl":"https://doi.org/10.1109/ICCL.1988.13079","url":null,"abstract":"The author explores the advantages and the problems of parallel computing. Technological and economic trends are studied with a view toward determining where the field of parallel computing is going. An approach to parallel programming, called UNITY, is described.<<ETX>>","PeriodicalId":219766,"journal":{"name":"Proceedings. 1988 International Conference on Computer Languages","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121536407","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":"Symbolic dimension bound checking in a matrix language","authors":"V.J. de Jong","doi":"10.1109/ICCL.1988.13045","DOIUrl":"https://doi.org/10.1109/ICCL.1988.13045","url":null,"abstract":"A symbolic dimension-bound checker calculates an unconditional symbolic range for each index variable after each statement in a matrix language program. Using these symbolic ranges, dimension-bound restrictions are checked symbolically. If the symbolic dimension bound restrictions cannot be verified, run-time restrictions are generated on the input variables of the program. It is shown under which conditions symbolic evaluation of index expressions in a matrix language is possible, and how the symbolic dimension-bound checker detects if input restrictions are redundant or contradicting. The dimension-bound checker is part of a matrix language compiler in a very-high-level program-producing system for statistical software.<<ETX>>","PeriodicalId":219766,"journal":{"name":"Proceedings. 1988 International Conference on Computer Languages","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122842953","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}