Pub Date : 1990-12-01DOI: 10.1109/CMPSAC.1990.139430
Tsuyoshi Nakajima, N. Tamura, K. Uehara
The authors propose a method for recording and analyzing actual design processes, which is called the problem-product-knowledge (PPK) method. This method consists of two parts: a method for recording design activities and a framework for organizing the record. The recording method allows designers to record their activities easily, and the framework allows analysts to organize a record into a design process description and provides two different views of a design process: a problem solving process and a product generating process. The PPK model can be considered as a tool which analysts can use to construct a tree (or dag) of the designer's activity in a bottom-up manner. This tree/dag includes abstraction of both the problem-solving process and the product generating process. Such an abstraction greatly enhances the understandability of the design.<>
{"title":"PPK: a method for recording and analyzing software design processes","authors":"Tsuyoshi Nakajima, N. Tamura, K. Uehara","doi":"10.1109/CMPSAC.1990.139430","DOIUrl":"https://doi.org/10.1109/CMPSAC.1990.139430","url":null,"abstract":"The authors propose a method for recording and analyzing actual design processes, which is called the problem-product-knowledge (PPK) method. This method consists of two parts: a method for recording design activities and a framework for organizing the record. The recording method allows designers to record their activities easily, and the framework allows analysts to organize a record into a design process description and provides two different views of a design process: a problem solving process and a product generating process. The PPK model can be considered as a tool which analysts can use to construct a tree (or dag) of the designer's activity in a bottom-up manner. This tree/dag includes abstraction of both the problem-solving process and the product generating process. Such an abstraction greatly enhances the understandability of the design.<<ETX>>","PeriodicalId":127509,"journal":{"name":"Proceedings., Fourteenth Annual International Computer Software and Applications Conference","volume":"48 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127013704","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}
Pub Date : 1990-12-01DOI: 10.1109/CMPSAC.1990.139389
Y. Nam, L. Henschen
The authors present an algorithm for transforming a linear recursive program in Prolog which contains the list data structure as a term of the predicate into an iterative program using a while loop in a procedural language like Pascal. This algorithm obtains the same result as Prolog without unification and backtracking. In this algorithm, the recursive programs are classified into two cases, the determined programs and the undetermined programs, according to the conditions of the variables in the program. The unification process is transformed into the set of assignment and conditional statements by analyzing the variables of the rules in the program. Backtracking is accomplished by a traversal of a tree whose nodes contain instantiated predicates.<>
{"title":"Compiling linear recursive Prolog programs with list structure into procedural language","authors":"Y. Nam, L. Henschen","doi":"10.1109/CMPSAC.1990.139389","DOIUrl":"https://doi.org/10.1109/CMPSAC.1990.139389","url":null,"abstract":"The authors present an algorithm for transforming a linear recursive program in Prolog which contains the list data structure as a term of the predicate into an iterative program using a while loop in a procedural language like Pascal. This algorithm obtains the same result as Prolog without unification and backtracking. In this algorithm, the recursive programs are classified into two cases, the determined programs and the undetermined programs, according to the conditions of the variables in the program. The unification process is transformed into the set of assignment and conditional statements by analyzing the variables of the rules in the program. Backtracking is accomplished by a traversal of a tree whose nodes contain instantiated predicates.<<ETX>>","PeriodicalId":127509,"journal":{"name":"Proceedings., Fourteenth Annual International Computer Software and Applications Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126364213","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}
Pub Date : 1990-10-31DOI: 10.1109/CMPSAC.1990.139408
K. P. Tan, H. Chan, K. Siau
The authors propose a novel user interface, the Graphical Knowledge Level interface, for user-database interaction. This interface addresses two of the current research problems: the semantic inadequacy of the relational model and the logical data dependence of the relational languages. The interface is more user-friendly than the SOL interface and the Universal Relation interface, as it employs the graphical approach. The semantic inadequacy problem is alleviated by using an enhanced entity-relationship model. This data model includes abstraction concepts such as aggregation, generalization, and categorization. A formal, high-level Graphical Knowledge Level Query Language, GKQL, which provides for both logical and physical data independence has also been designed.<>
{"title":"A graphical knowledge level approach for user-database interaction","authors":"K. P. Tan, H. Chan, K. Siau","doi":"10.1109/CMPSAC.1990.139408","DOIUrl":"https://doi.org/10.1109/CMPSAC.1990.139408","url":null,"abstract":"The authors propose a novel user interface, the Graphical Knowledge Level interface, for user-database interaction. This interface addresses two of the current research problems: the semantic inadequacy of the relational model and the logical data dependence of the relational languages. The interface is more user-friendly than the SOL interface and the Universal Relation interface, as it employs the graphical approach. The semantic inadequacy problem is alleviated by using an enhanced entity-relationship model. This data model includes abstraction concepts such as aggregation, generalization, and categorization. A formal, high-level Graphical Knowledge Level Query Language, GKQL, which provides for both logical and physical data independence has also been designed.<<ETX>>","PeriodicalId":127509,"journal":{"name":"Proceedings., Fourteenth Annual International Computer Software and Applications Conference","volume":"262 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116614600","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}
Pub Date : 1990-10-31DOI: 10.1109/CMPSAC.1990.139379
P.-Y. Hsiao, Chia-Chun Tsai
The authors present a novel plane-sweep algorithm based on spatial data structures with region query operations. Such an algorithm is applicable to the problems of VLSI layout design and image processing. It has a computing time of O(N log N) and allows the functional operations of region search of the spatial data structures to be useful in solving some of the specified problems. This algorithm has been successfully implemented in C language; it was based on two kinds of spatial data structures; multiple storage quad tree and quad list quad tree. This plane-sweep algorithm also has been successfully applied to problems of layout compaction, design rule checking, and minimum reliable partition.<>
{"title":"A new plane-sweep algorithm based on spatial data structure for overlapped rectangles in 2-D plane","authors":"P.-Y. Hsiao, Chia-Chun Tsai","doi":"10.1109/CMPSAC.1990.139379","DOIUrl":"https://doi.org/10.1109/CMPSAC.1990.139379","url":null,"abstract":"The authors present a novel plane-sweep algorithm based on spatial data structures with region query operations. Such an algorithm is applicable to the problems of VLSI layout design and image processing. It has a computing time of O(N log N) and allows the functional operations of region search of the spatial data structures to be useful in solving some of the specified problems. This algorithm has been successfully implemented in C language; it was based on two kinds of spatial data structures; multiple storage quad tree and quad list quad tree. This plane-sweep algorithm also has been successfully applied to problems of layout compaction, design rule checking, and minimum reliable partition.<<ETX>>","PeriodicalId":127509,"journal":{"name":"Proceedings., Fourteenth Annual International Computer Software and Applications Conference","volume":"278 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129682392","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}
Pub Date : 1990-10-31DOI: 10.1109/CMPSAC.1990.139427
T. Shimomura, S. Isoda
A description is given of VIPS, a visual debugging system which makes it easy to debug programs by visually displaying the program execution from various aspects using multiple windows. VIPS automatically acquires data type information from the program to be debugged and rapidly displays data structures. The current version of VIPS aims at list structures, which are the most difficult type of data structures for debugging. A preliminary evaluation shows that VIPS enables a user to find bugs in about 30% less time using about 25% fewer debugging commands compared with a conventional debugging tool.<>
{"title":"VIPS: a visual debugger for list structures","authors":"T. Shimomura, S. Isoda","doi":"10.1109/CMPSAC.1990.139427","DOIUrl":"https://doi.org/10.1109/CMPSAC.1990.139427","url":null,"abstract":"A description is given of VIPS, a visual debugging system which makes it easy to debug programs by visually displaying the program execution from various aspects using multiple windows. VIPS automatically acquires data type information from the program to be debugged and rapidly displays data structures. The current version of VIPS aims at list structures, which are the most difficult type of data structures for debugging. A preliminary evaluation shows that VIPS enables a user to find bugs in about 30% less time using about 25% fewer debugging commands compared with a conventional debugging tool.<<ETX>>","PeriodicalId":127509,"journal":{"name":"Proceedings., Fourteenth Annual International Computer Software and Applications Conference","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123609991","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}
Pub Date : 1990-10-31DOI: 10.1109/CMPSAC.1990.139433
J. Laski
The language of regular expressions is used for the identification of constructors of definition-use chains. Activation of the chains is essential for all data flow testing strategies. The algorithm is based on the node-elimination method of J.A. Brzozowski and E.J. McCluskey (1963). It generates a regular expression that represents the (possibly infinite) set of all constructors of the chain involved. A particular path can then be derived from that expression. The algorithm has been implemented as an extension to STAD, a recently implemented system for testing and debugging.<>
{"title":"Path expression in data flow program testing","authors":"J. Laski","doi":"10.1109/CMPSAC.1990.139433","DOIUrl":"https://doi.org/10.1109/CMPSAC.1990.139433","url":null,"abstract":"The language of regular expressions is used for the identification of constructors of definition-use chains. Activation of the chains is essential for all data flow testing strategies. The algorithm is based on the node-elimination method of J.A. Brzozowski and E.J. McCluskey (1963). It generates a regular expression that represents the (possibly infinite) set of all constructors of the chain involved. A particular path can then be derived from that expression. The algorithm has been implemented as an extension to STAD, a recently implemented system for testing and debugging.<<ETX>>","PeriodicalId":127509,"journal":{"name":"Proceedings., Fourteenth Annual International Computer Software and Applications Conference","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121403926","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}
Pub Date : 1990-10-31DOI: 10.1109/CMPSAC.1990.139345
S. Yau, Yeou-Wei Wang, Jules G. Huang, Jinshuan E. Lee
A software quality assurance framework using knowledge-based engineering technology is described. The knowledge-engineering technology uses an object-oriented database to store the knowledge (the software quality information), and rules and meta-rules are its inferential knowledge. A dependency-based truth maintenance system based on hypothetical reasoning is used for design evaluation of the software quality. This framework can provide knowledge-based assistance for quality assurance throughout the entire software development cycle. To ensure high quality software and achieve cost-effective software development and maintenance, software metrics are used during the entire software development cycle to measure and predict the quality of software products. Various metrics for software attributes for all phases of the software development cycle will be collected and stored in the object-oriented database. The integration of the knowledge base with the software quality framework provides a wide range of support to the development of large-scale software systems.<>
{"title":"An integrated expert system framework for software quality assurance","authors":"S. Yau, Yeou-Wei Wang, Jules G. Huang, Jinshuan E. Lee","doi":"10.1109/CMPSAC.1990.139345","DOIUrl":"https://doi.org/10.1109/CMPSAC.1990.139345","url":null,"abstract":"A software quality assurance framework using knowledge-based engineering technology is described. The knowledge-engineering technology uses an object-oriented database to store the knowledge (the software quality information), and rules and meta-rules are its inferential knowledge. A dependency-based truth maintenance system based on hypothetical reasoning is used for design evaluation of the software quality. This framework can provide knowledge-based assistance for quality assurance throughout the entire software development cycle. To ensure high quality software and achieve cost-effective software development and maintenance, software metrics are used during the entire software development cycle to measure and predict the quality of software products. Various metrics for software attributes for all phases of the software development cycle will be collected and stored in the object-oriented database. The integration of the knowledge base with the software quality framework provides a wide range of support to the development of large-scale software systems.<<ETX>>","PeriodicalId":127509,"journal":{"name":"Proceedings., Fourteenth Annual International Computer Software and Applications Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116287983","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}
Pub Date : 1990-10-31DOI: 10.1109/CMPSAC.1990.139357
Amelia Choi, W. Luk
A bi-level object-oriented data model together with a user query language called OFQL is designed which can support applications like GIS (geographic information systems). The data model is divided into two layers, the higher-level data model and the lower-level data model. The higher-level data model or the geographic object data model primarily consists of the geographic objects and a set of semantic spatial functions through which the topological relationships of the geographic objects are defined or derived. The lower-level data model or the geometric object data model has geometric objects which are the actual spatial representations of the geographic objects in the higher-level data model. It also has a set of geometric functions that retrieve, manipulate, and compute for geometric objects. The general architecture of a GIS system using this data modeling approach consists of two modules: the query processor and the function implementor. With the OFQL user-interface, the user is able to pose queries of a geographic nature without knowing the details of the spatial representation and computation of the geographic objects.<>
{"title":"A bi-level object-oriented data model for GIS applications","authors":"Amelia Choi, W. Luk","doi":"10.1109/CMPSAC.1990.139357","DOIUrl":"https://doi.org/10.1109/CMPSAC.1990.139357","url":null,"abstract":"A bi-level object-oriented data model together with a user query language called OFQL is designed which can support applications like GIS (geographic information systems). The data model is divided into two layers, the higher-level data model and the lower-level data model. The higher-level data model or the geographic object data model primarily consists of the geographic objects and a set of semantic spatial functions through which the topological relationships of the geographic objects are defined or derived. The lower-level data model or the geometric object data model has geometric objects which are the actual spatial representations of the geographic objects in the higher-level data model. It also has a set of geometric functions that retrieve, manipulate, and compute for geometric objects. The general architecture of a GIS system using this data modeling approach consists of two modules: the query processor and the function implementor. With the OFQL user-interface, the user is able to pose queries of a geographic nature without knowing the details of the spatial representation and computation of the geographic objects.<<ETX>>","PeriodicalId":127509,"journal":{"name":"Proceedings., Fourteenth Annual International Computer Software and Applications Conference","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134550626","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}
Pub Date : 1990-10-31DOI: 10.1109/CMPSAC.1990.139439
L. Markosian, T. Driscoll, R. Hunter-Duvar, J. Hartman, W. Kozaczynski, J. Ning, Mark Seipler
The special problems of software re-engineering and technologies and approaches that specifically address these re-engineering problems are considered. Particular attention is given to approaches for analyzing and abstracting the functionality of old code, converting software to work with new languages or dialects, translating large systems, defining appropriate roles for the user of highly automated tools, and identifying the automatable steps in a large-scale project to re-engineer assembly language code. An attempt is made to indicate on the basis of actual experience what aspects of the re-engineering process seem to be most amenable to automation and what productivity gains can be expected.<>
{"title":"Industrial experience in automating software re-engineering","authors":"L. Markosian, T. Driscoll, R. Hunter-Duvar, J. Hartman, W. Kozaczynski, J. Ning, Mark Seipler","doi":"10.1109/CMPSAC.1990.139439","DOIUrl":"https://doi.org/10.1109/CMPSAC.1990.139439","url":null,"abstract":"The special problems of software re-engineering and technologies and approaches that specifically address these re-engineering problems are considered. Particular attention is given to approaches for analyzing and abstracting the functionality of old code, converting software to work with new languages or dialects, translating large systems, defining appropriate roles for the user of highly automated tools, and identifying the automatable steps in a large-scale project to re-engineer assembly language code. An attempt is made to indicate on the basis of actual experience what aspects of the re-engineering process seem to be most amenable to automation and what productivity gains can be expected.<<ETX>>","PeriodicalId":127509,"journal":{"name":"Proceedings., Fourteenth Annual International Computer Software and Applications Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134097670","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}
Pub Date : 1990-10-31DOI: 10.1109/CMPSAC.1990.139397
F. D. Paoli, S. Morasca
A metric for concurrent software is proposed based on an abstract model (Petri nets) as an extension of T.J. McCabe's (1976) cyclomatic number. As such, its focus is on the complexity of control flow. This metric is applied to the assessment of Ada programs, and an automatic method for its direct computation based on the inspection of Ada code is provided. It is pointed out, however, that wider experimentation is needed in order to better assess its effectiveness.<>
{"title":"Extending software complexity metrics to concurrent programs","authors":"F. D. Paoli, S. Morasca","doi":"10.1109/CMPSAC.1990.139397","DOIUrl":"https://doi.org/10.1109/CMPSAC.1990.139397","url":null,"abstract":"A metric for concurrent software is proposed based on an abstract model (Petri nets) as an extension of T.J. McCabe's (1976) cyclomatic number. As such, its focus is on the complexity of control flow. This metric is applied to the assessment of Ada programs, and an automatic method for its direct computation based on the inspection of Ada code is provided. It is pointed out, however, that wider experimentation is needed in order to better assess its effectiveness.<<ETX>>","PeriodicalId":127509,"journal":{"name":"Proceedings., Fourteenth Annual International Computer Software and Applications Conference","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130900238","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：