Pub Date : 1989-09-20DOI: 10.1109/CMPSAC.1989.65097
M. Mizuno
An information flow control policy specifies the manner in which classified information flows from one object to another. A link-time algorithm is presented for an information flow certification mechanism designed for modular programming systems. The mechanism combines a compile-time algorithm developed for object-oriented systems with the link-time algorithm described. The compile-time algorithm partially verifies the security of each procedure independently and generates equations which express potential flows caused by parameter passing. The link-time algorithm completes the certification of the entire program by verifying the interprocedural information flows. It analyzes the equations for all procedures in the program and calculates the least fixed point by using a standard iterative method.<>
{"title":"An iterative method for secure inter-procedural information flow control","authors":"M. Mizuno","doi":"10.1109/CMPSAC.1989.65097","DOIUrl":"https://doi.org/10.1109/CMPSAC.1989.65097","url":null,"abstract":"An information flow control policy specifies the manner in which classified information flows from one object to another. A link-time algorithm is presented for an information flow certification mechanism designed for modular programming systems. The mechanism combines a compile-time algorithm developed for object-oriented systems with the link-time algorithm described. The compile-time algorithm partially verifies the security of each procedure independently and generates equations which express potential flows caused by parameter passing. The link-time algorithm completes the certification of the entire program by verifying the interprocedural information flows. It analyzes the equations for all procedures in the program and calculates the least fixed point by using a standard iterative method.<<ETX>>","PeriodicalId":339677,"journal":{"name":"[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123939777","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 : 1989-09-20DOI: 10.1109/CMPSAC.1989.65177
V. Mittal, M. Singhal
A framework is presented for distributed problem solving. As an illustration of this system, the implementation of a job scheduler to do load balancing in distributed systems is developed and discussed. The framework is developed around a distributed blackboard system with multiple planes in a hierarchy. Sites in a distributed system have an incorrect and inconsistent picture of the states of other sites in the system. In this framework of cooperating specialists communicating by means of distributed blackboards, it is shown how to handle uncertain and unreliable knowledge. Some of the specialists used in the system, results obtained, and directions for future research are described.<>
{"title":"Scatter-Brain: an experiment in distributed problem solving applied to load balancing","authors":"V. Mittal, M. Singhal","doi":"10.1109/CMPSAC.1989.65177","DOIUrl":"https://doi.org/10.1109/CMPSAC.1989.65177","url":null,"abstract":"A framework is presented for distributed problem solving. As an illustration of this system, the implementation of a job scheduler to do load balancing in distributed systems is developed and discussed. The framework is developed around a distributed blackboard system with multiple planes in a hierarchy. Sites in a distributed system have an incorrect and inconsistent picture of the states of other sites in the system. In this framework of cooperating specialists communicating by means of distributed blackboards, it is shown how to handle uncertain and unreliable knowledge. Some of the specialists used in the system, results obtained, and directions for future research are described.<<ETX>>","PeriodicalId":339677,"journal":{"name":"[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125518094","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 : 1989-09-20DOI: 10.1109/CMPSAC.1989.65087
H. Lam, S. Su, A. Alashqur
The object orientation of a semantic association model (OSAM) is presented. It integrates the concepts and techniques of semantic modeling and those introduced by the object-oriented paradigm. Unlike conventional data models such as the relational model, the object orientation of OSAM allows the user to model an application in terms of complex objects, classes and their associations, instead of tuples (or records) and relations (or record types). The primitives (objects, class, instance and link) and the perspectives (class and object) of an OSAM database are described. Key differences between OSAM and a conventional object-oriented model are discussed. The features of object orientation and explicit definition of semantic associations among objects allow the database of an application domain to be modeled, accessed and manipulated at a higher conceptual level and thus simplify the tasks of the users in the development of their applications.<>
{"title":"Integrating the concepts and techniques of semantic modeling and the object-oriented paradigm","authors":"H. Lam, S. Su, A. Alashqur","doi":"10.1109/CMPSAC.1989.65087","DOIUrl":"https://doi.org/10.1109/CMPSAC.1989.65087","url":null,"abstract":"The object orientation of a semantic association model (OSAM) is presented. It integrates the concepts and techniques of semantic modeling and those introduced by the object-oriented paradigm. Unlike conventional data models such as the relational model, the object orientation of OSAM allows the user to model an application in terms of complex objects, classes and their associations, instead of tuples (or records) and relations (or record types). The primitives (objects, class, instance and link) and the perspectives (class and object) of an OSAM database are described. Key differences between OSAM and a conventional object-oriented model are discussed. The features of object orientation and explicit definition of semantic associations among objects allow the database of an application domain to be modeled, accessed and manipulated at a higher conceptual level and thus simplify the tasks of the users in the development of their applications.<<ETX>>","PeriodicalId":339677,"journal":{"name":"[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference","volume":"409 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114940782","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 : 1989-09-20DOI: 10.1109/CMPSAC.1989.65101
J. Aoe
A decimal notation satisfies many simple mathematical properties and it is a useful tool in the analysis of trees. A practical method is presented that compresses the decimal codes while maintaining the fast determination of relations (e.g. ancestor, descendant, brother, etc.). A special node, called a kernel node, including many common subcodes of the other codes, is defined and a compact data structure is presented using the kernel nodes. For the case where n(m) is the number of the total (kernel) nodes, it is proved that encoding a decimal code is a constant time, that the worst-case time complexity of compressing the decimal codes is O(n+m/sup 2/), and that the size of the data structure is proportional to m. From the experimental results for some hierarchical semantic primitives for natural language processing, it is shown that the ratio m/n is extremely small, ranging from 0.047 to 0.13.<>
{"title":"An efficient algorithm of compressing decimal notations for tree structures","authors":"J. Aoe","doi":"10.1109/CMPSAC.1989.65101","DOIUrl":"https://doi.org/10.1109/CMPSAC.1989.65101","url":null,"abstract":"A decimal notation satisfies many simple mathematical properties and it is a useful tool in the analysis of trees. A practical method is presented that compresses the decimal codes while maintaining the fast determination of relations (e.g. ancestor, descendant, brother, etc.). A special node, called a kernel node, including many common subcodes of the other codes, is defined and a compact data structure is presented using the kernel nodes. For the case where n(m) is the number of the total (kernel) nodes, it is proved that encoding a decimal code is a constant time, that the worst-case time complexity of compressing the decimal codes is O(n+m/sup 2/), and that the size of the data structure is proportional to m. From the experimental results for some hierarchical semantic primitives for natural language processing, it is shown that the ratio m/n is extremely small, ranging from 0.047 to 0.13.<<ETX>>","PeriodicalId":339677,"journal":{"name":"[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115086126","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 : 1989-09-20DOI: 10.1109/CMPSAC.1989.65154
Hirotaka Sekine, Hirokatsu Terajima
A visual solid modeling system for a polyhedral shape has been developed. The system is designed to be used as a styling design tool in the early stage of industrial design. A new shape modeling technique, involving the plane cursor and the cut operation, was developed for this purpose. The plane cursor, a 3-D graphical input tool, allows the user to locate a plane in 3-D space by mouse manipulation. The cut operation uses this plane as a cutting blade to cut off or divide a solid. These operations enable the user to generate an arbitrary polyhedron in a visual environment, which is similar to the work of making a mock-up model. The software organization and the shape data structure were also designed for this purpose.<>
{"title":"A visual solid modeling system using a plane cursor","authors":"Hirotaka Sekine, Hirokatsu Terajima","doi":"10.1109/CMPSAC.1989.65154","DOIUrl":"https://doi.org/10.1109/CMPSAC.1989.65154","url":null,"abstract":"A visual solid modeling system for a polyhedral shape has been developed. The system is designed to be used as a styling design tool in the early stage of industrial design. A new shape modeling technique, involving the plane cursor and the cut operation, was developed for this purpose. The plane cursor, a 3-D graphical input tool, allows the user to locate a plane in 3-D space by mouse manipulation. The cut operation uses this plane as a cutting blade to cut off or divide a solid. These operations enable the user to generate an arbitrary polyhedron in a visual environment, which is similar to the work of making a mock-up model. The software organization and the shape data structure were also designed for this purpose.<<ETX>>","PeriodicalId":339677,"journal":{"name":"[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference","volume":"2004 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127324352","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 : 1989-09-20DOI: 10.1109/CMPSAC.1989.65048
M. McSherry, T. Casavant
The problem of efficient task migration in hypercube multiprocessors is addressed. Task migration is useful for subcube reallocation, dynamic task sizing, load balancing, and support of fault tolerance. Efficient routing algorithms for large messages can increase the benefits obtained from migration. While pipelined communication techniques allow a maximum reduction in communication time, hardware costs for these solutions may be extreme. Current technology limits the extent to which communication links can be used simultaneously, and therefore the architectural support of pipelined communications in hypercubes. The proposed centralized algorithm applies an optimization heuristic in an idealized, static, nonpipelined setting and further uses retrograde motion to maximize the utilization of available bandwidth. The algorithm is applied to a dynamic system, and simulation studies evaluate the actual performance. The results provide a basis for extension and enhancement of the existing algorithm to a distributed routing algorithm.<>
{"title":"Software routing support for task migration in hypercube multiprocessor systems","authors":"M. McSherry, T. Casavant","doi":"10.1109/CMPSAC.1989.65048","DOIUrl":"https://doi.org/10.1109/CMPSAC.1989.65048","url":null,"abstract":"The problem of efficient task migration in hypercube multiprocessors is addressed. Task migration is useful for subcube reallocation, dynamic task sizing, load balancing, and support of fault tolerance. Efficient routing algorithms for large messages can increase the benefits obtained from migration. While pipelined communication techniques allow a maximum reduction in communication time, hardware costs for these solutions may be extreme. Current technology limits the extent to which communication links can be used simultaneously, and therefore the architectural support of pipelined communications in hypercubes. The proposed centralized algorithm applies an optimization heuristic in an idealized, static, nonpipelined setting and further uses retrograde motion to maximize the utilization of available bandwidth. The algorithm is applied to a dynamic system, and simulation studies evaluate the actual performance. The results provide a basis for extension and enhancement of the existing algorithm to a distributed routing algorithm.<<ETX>>","PeriodicalId":339677,"journal":{"name":"[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129035295","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 : 1989-09-20DOI: 10.1109/CMPSAC.1989.65070
W. Eventoff
A new program development environment that is based on visual programming techniques and avoids the problems associated with the use of existing methods, fostering parallel thinking, is presented. The environment, which reflects the intelligent apprentice paradigm (i.e. an assistant that helps the user but depends on the user for advice), provides an integrated set of tools that allows the user both to understand the dependencies within the program readily and to manipulate the dependence graph directly to maximize the amount of parallelism that can be exploited. To enter this environment, the user simply compiles the program under study. The tools analyze the dependences within the program and present the user with a diagrammatic, hierarchical representation of the program's dependence graph, reformatted to reflect available parallelism and highlighting constructs that inhibit the parallelization process (e.g. runtime-determined array bounds, I/O operations, computed GOTOs, etc.).<>
{"title":"An environment for the conversion of sequential programs into parallel forms","authors":"W. Eventoff","doi":"10.1109/CMPSAC.1989.65070","DOIUrl":"https://doi.org/10.1109/CMPSAC.1989.65070","url":null,"abstract":"A new program development environment that is based on visual programming techniques and avoids the problems associated with the use of existing methods, fostering parallel thinking, is presented. The environment, which reflects the intelligent apprentice paradigm (i.e. an assistant that helps the user but depends on the user for advice), provides an integrated set of tools that allows the user both to understand the dependencies within the program readily and to manipulate the dependence graph directly to maximize the amount of parallelism that can be exploited. To enter this environment, the user simply compiles the program under study. The tools analyze the dependences within the program and present the user with a diagrammatic, hierarchical representation of the program's dependence graph, reformatted to reflect available parallelism and highlighting constructs that inhibit the parallelization process (e.g. runtime-determined array bounds, I/O operations, computed GOTOs, etc.).<<ETX>>","PeriodicalId":339677,"journal":{"name":"[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128885600","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 : 1989-09-20DOI: 10.1109/CMPSAC.1989.65135
K. Honda, K. Minomura, Toshihiro Komiyama
A meta-methodology for software quality assurance has been developed and put into practice so that software quality assurance activities can be effectively and systematically executed in software projects. Meta-SQAP (software quality assurance program) provides guidelines and information concerning the three levels of SQA activities: the project SQA, the SQA management cycle, and the division SQA activity levels. Under Meta-SQAP, project SQA activities, such as review, configuration control, and testing, are well organized and planned out as a SQAP. The SQAP is effectively operated by the SQA management cycle activities, consisting of SQA target definition, SQA program evaluation, and feedback. All the projects are supported by the division SQA activities in each division, such as organizational restructuring and information exchange between projects.<>
{"title":"Meta-SQAP: meta-methodology for software quality assurance","authors":"K. Honda, K. Minomura, Toshihiro Komiyama","doi":"10.1109/CMPSAC.1989.65135","DOIUrl":"https://doi.org/10.1109/CMPSAC.1989.65135","url":null,"abstract":"A meta-methodology for software quality assurance has been developed and put into practice so that software quality assurance activities can be effectively and systematically executed in software projects. Meta-SQAP (software quality assurance program) provides guidelines and information concerning the three levels of SQA activities: the project SQA, the SQA management cycle, and the division SQA activity levels. Under Meta-SQAP, project SQA activities, such as review, configuration control, and testing, are well organized and planned out as a SQAP. The SQAP is effectively operated by the SQA management cycle activities, consisting of SQA target definition, SQA program evaluation, and feedback. All the projects are supported by the division SQA activities in each division, such as organizational restructuring and information exchange between projects.<<ETX>>","PeriodicalId":339677,"journal":{"name":"[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123169244","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 : 1989-09-20DOI: 10.1109/CMPSAC.1989.65088
B. Desai, R. Pollock
An approach to schema integration in a heterogeneous distributed database management system (DBMS) design is described. The approach has been used with success in a prototype multiple database access system (MDAS). This system acts as a front-end to multiple local DBMSs which continue to perform all local data management and processing. The MDAS services queries on an integrated view of semantically related databases exhibiting a range of schema and data conflicts.<>
{"title":"On schema integration in a heterogeneous distributed database management system","authors":"B. Desai, R. Pollock","doi":"10.1109/CMPSAC.1989.65088","DOIUrl":"https://doi.org/10.1109/CMPSAC.1989.65088","url":null,"abstract":"An approach to schema integration in a heterogeneous distributed database management system (DBMS) design is described. The approach has been used with success in a prototype multiple database access system (MDAS). This system acts as a front-end to multiple local DBMSs which continue to perform all local data management and processing. The MDAS services queries on an integrated view of semantically related databases exhibiting a range of schema and data conflicts.<<ETX>>","PeriodicalId":339677,"journal":{"name":"[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126833479","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 : 1989-09-20DOI: 10.1109/CMPSAC.1989.65132
Y. Tohma
Models used to estimate the number of residual software faults are examined. The models were developed by universities and industries in Japan. It has been shown that the hypergeometric distribution model can be applied to real data of different types. The relationship between the model based on the hypergeometric distribution and those based on the nonhomogeneous Poisson process has been revealed.<>
{"title":"Models to estimate the number of faults still resident in the software after test/debug process","authors":"Y. Tohma","doi":"10.1109/CMPSAC.1989.65132","DOIUrl":"https://doi.org/10.1109/CMPSAC.1989.65132","url":null,"abstract":"Models used to estimate the number of residual software faults are examined. The models were developed by universities and industries in Japan. It has been shown that the hypergeometric distribution model can be applied to real data of different types. The relationship between the model based on the hypergeometric distribution and those based on the nonhomogeneous Poisson process has been revealed.<<ETX>>","PeriodicalId":339677,"journal":{"name":"[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114258158","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
扫码关注我们
求助内容：
应助结果提醒方式：