Pub Date : 1989-09-20DOI: 10.1109/CMPSAC.1989.65069
D. Padua
The author discusses a few issues regarding programming tools and their interaction. In parallel programming environments the target machine is parallel, and at least some of the tools deal with parallelism by making possible its expression (e.g. a computer for a parallel programming language or a parallelizing compiler). The author discusses the more general concept of problem-solving environments because he believes that in the future, and at least for some applications, the users of these environments will not be programmers or at least will not have to write any programs. Therefore, much of the interaction with the system will be a description of the problem to be solved and not a description of the solution method.<>
{"title":"Problem solving environments","authors":"D. Padua","doi":"10.1109/CMPSAC.1989.65069","DOIUrl":"https://doi.org/10.1109/CMPSAC.1989.65069","url":null,"abstract":"The author discusses a few issues regarding programming tools and their interaction. In parallel programming environments the target machine is parallel, and at least some of the tools deal with parallelism by making possible its expression (e.g. a computer for a parallel programming language or a parallelizing compiler). The author discusses the more general concept of problem-solving environments because he believes that in the future, and at least for some applications, the users of these environments will not be programmers or at least will not have to write any programs. Therefore, much of the interaction with the system will be a description of the problem to be solved and not a description of the solution method.<<ETX>>","PeriodicalId":339677,"journal":{"name":"[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference","volume":"22 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":"132197089","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.65140
Charles W. Lillie, B. Brykczynski
The US strategic defense initiative office (SDIO) recognizes that software will play a critical role in the development and deployment of the strategic defense system (SDS). Proper SDS software development will require attention in the following three areas: technology utilization, education, and policy. Several major efforts designed to reduce the risk associated with development and deployment of SDS software are described. These efforts include the SDS software policy, the SDS software center, and the software annex of the SDS capstone testing and evaluation master plan (TEMP).<>
{"title":"The SDI approach","authors":"Charles W. Lillie, B. Brykczynski","doi":"10.1109/CMPSAC.1989.65140","DOIUrl":"https://doi.org/10.1109/CMPSAC.1989.65140","url":null,"abstract":"The US strategic defense initiative office (SDIO) recognizes that software will play a critical role in the development and deployment of the strategic defense system (SDS). Proper SDS software development will require attention in the following three areas: technology utilization, education, and policy. Several major efforts designed to reduce the risk associated with development and deployment of SDS software are described. These efforts include the SDS software policy, the SDS software center, and the software annex of the SDS capstone testing and evaluation master plan (TEMP).<<ETX>>","PeriodicalId":339677,"journal":{"name":"[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference","volume":"137 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":"132221942","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.65057
K. Tai
Although a lot of research has been done in software testing, how to test concurrent programs effectively has not received much attention. Two early papers on testing concurrent programs were written by P. Brinch Hansen (see Software-Practice and Experience, vol.8, p.145-50 and p.721-9 (1989)) K.C. Tai's paper (1985) addressed several issues on testing concurrent programs and started the work on deterministic execution testing and debugging of concurrent programs. These and other research results on testing concurrent programs are briefly examined. The following approaches to testing concurrent programs are discussed: single execution testing, multiple execution testing, and deterministic execution testing. Problems in deterministic execution testing and debugging of concurrent programs are examined.<>
尽管在软件测试方面已经做了大量的研究，但是如何有效地测试并发程序却没有受到太多的关注。关于测试并发程序的两篇早期论文是由P. Brinch Hansen撰写的(参见Software-Practice and Experience，卷8,P. 145-50和P. 721-9 (1989)) K.C. Tai的论文(1985)解决了测试并发程序的几个问题，并开始了并发程序的确定性执行测试和调试工作。本文简要介绍了这些和其他关于并发程序测试的研究成果。本文讨论了测试并发程序的以下方法:单执行测试、多执行测试和确定性执行测试。讨论了并发程序的确定性执行测试和调试中存在的问题。
{"title":"Testing of concurrent software","authors":"K. Tai","doi":"10.1109/CMPSAC.1989.65057","DOIUrl":"https://doi.org/10.1109/CMPSAC.1989.65057","url":null,"abstract":"Although a lot of research has been done in software testing, how to test concurrent programs effectively has not received much attention. Two early papers on testing concurrent programs were written by P. Brinch Hansen (see Software-Practice and Experience, vol.8, p.145-50 and p.721-9 (1989)) K.C. Tai's paper (1985) addressed several issues on testing concurrent programs and started the work on deterministic execution testing and debugging of concurrent programs. These and other research results on testing concurrent programs are briefly examined. The following approaches to testing concurrent programs are discussed: single execution testing, multiple execution testing, and deterministic execution testing. Problems in deterministic execution testing and debugging of concurrent programs are examined.<<ETX>>","PeriodicalId":339677,"journal":{"name":"[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference","volume":"40 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":"132306595","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.65146
Y. Kwon
Researchers in software as well as software engineering are having difficulty defining projects with concrete goals and well-organized teams as demanded by funding sources. Upcoming large-scale software projects initiated by the government are expected to create a lot of research opportunity and thereby drive the domestic software technology to a higher level. A review is presented of Korea's software industry and software technology, and future issues are examined.<>
{"title":"Software technology and industry of Korea: widening horizon and emerging presence","authors":"Y. Kwon","doi":"10.1109/CMPSAC.1989.65146","DOIUrl":"https://doi.org/10.1109/CMPSAC.1989.65146","url":null,"abstract":"Researchers in software as well as software engineering are having difficulty defining projects with concrete goals and well-organized teams as demanded by funding sources. Upcoming large-scale software projects initiated by the government are expected to create a lot of research opportunity and thereby drive the domestic software technology to a higher level. A review is presented of Korea's software industry and software technology, and future issues are examined.<<ETX>>","PeriodicalId":339677,"journal":{"name":"[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference","volume":"118 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":"131758189","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.65078
M. Hsu, Va-On Tam
Synchronization in DSVM (distributed shared virtual memory) can be approached top-down by first understanding the synchronization needs at the process level instead of only at the memory access level. The authors demonstrate this idea in the context of transaction synchronization, devising two-phase locking-based algorithms under two DSVM scenarios: with and without an underlying memory coherence system. They compare the performances of the two algorithms and argue that significant performance gain can potentially result from bypassing memory coherence and supporting process synchronization directly on distributed memory. They also study the role of the optimistic algorithms in transaction synchronization in DSVM and show that some optimistic policy appears promising under the scenarios studied.<>
{"title":"Transaction synchronization in distributed shared virtual memory systems","authors":"M. Hsu, Va-On Tam","doi":"10.1109/CMPSAC.1989.65078","DOIUrl":"https://doi.org/10.1109/CMPSAC.1989.65078","url":null,"abstract":"Synchronization in DSVM (distributed shared virtual memory) can be approached top-down by first understanding the synchronization needs at the process level instead of only at the memory access level. The authors demonstrate this idea in the context of transaction synchronization, devising two-phase locking-based algorithms under two DSVM scenarios: with and without an underlying memory coherence system. They compare the performances of the two algorithms and argue that significant performance gain can potentially result from bypassing memory coherence and supporting process synchronization directly on distributed memory. They also study the role of the optimistic algorithms in transaction synchronization in DSVM and show that some optimistic policy appears promising under the scenarios studied.<<ETX>>","PeriodicalId":339677,"journal":{"name":"[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference","volume":"55 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":"133641551","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.65103
Brad J. Cox
It is argued that software is actually a hybrid at the intersection of two fundamentally different domains: the purely concrete plane of everyday physical, tangible experience and the purely abstract plane of intangible thought. The concrete plane is governed by well-understood laws of physics, and the abstract domain by its own laws of mathematics and logic. However, since software is a hybrid, the intersection of these two radically different domains, it does not fully abide by either set of laws. A high-level plan for winning the software industrial revolution is proposed. It is argued that it is necessary to deploy explicit specification tools, and new and largely unexplored kinds of tools. Their function is to gauge compliance between a given implementation of some part and the abstract specification of that part.<>
{"title":"Planning for software manufacturing","authors":"Brad J. Cox","doi":"10.1109/CMPSAC.1989.65103","DOIUrl":"https://doi.org/10.1109/CMPSAC.1989.65103","url":null,"abstract":"It is argued that software is actually a hybrid at the intersection of two fundamentally different domains: the purely concrete plane of everyday physical, tangible experience and the purely abstract plane of intangible thought. The concrete plane is governed by well-understood laws of physics, and the abstract domain by its own laws of mathematics and logic. However, since software is a hybrid, the intersection of these two radically different domains, it does not fully abide by either set of laws. A high-level plan for winning the software industrial revolution is proposed. It is argued that it is necessary to deploy explicit specification tools, and new and largely unexplored kinds of tools. Their function is to gauge compliance between a given implementation of some part and the abstract specification of that part.<<ETX>>","PeriodicalId":339677,"journal":{"name":"[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference","volume":"107 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":"124126218","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.65067
J. Fang
The different processor scheduling approaches in parallel program execution are introduced and compared. On the basis of simulation results, it is concluded that the best choice of a runtime model for parallel programming depends on the nature of the application programs and the hardware architecture.<>
{"title":"Processor scheduling in parallel program execution","authors":"J. Fang","doi":"10.1109/CMPSAC.1989.65067","DOIUrl":"https://doi.org/10.1109/CMPSAC.1989.65067","url":null,"abstract":"The different processor scheduling approaches in parallel program execution are introduced and compared. On the basis of simulation results, it is concluded that the best choice of a runtime model for parallel programming depends on the nature of the application programs and the hardware architecture.<<ETX>>","PeriodicalId":339677,"journal":{"name":"[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference","volume":"39 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":"116828329","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.65174
Yong Zheng, Jiahua Qian
The attribute grammar is a convenient tool for specifying the semantics of programming languages. It has been used widely in the development of interactive programming environments. To date, many environments are constructed based on attribute evaluation. However, in traditional attribute grammar, a lot of copy rule chains must be used due to its essential limitations, which results in severe time and space problems. To improve the efficiency, the attribute grammar is extended by allowing a nonlocal dependency relationship (NDR). The use of this NDR avoids semantic information flowing through copy rule chains. The representation of NDR is described. An approach to maintaining the consistency of NDR in the semantic tree during program development is presented. The implementation of the NDR is discussed.<>
{"title":"The implementation of nonlocal dependency relationship in interactive environment","authors":"Yong Zheng, Jiahua Qian","doi":"10.1109/CMPSAC.1989.65174","DOIUrl":"https://doi.org/10.1109/CMPSAC.1989.65174","url":null,"abstract":"The attribute grammar is a convenient tool for specifying the semantics of programming languages. It has been used widely in the development of interactive programming environments. To date, many environments are constructed based on attribute evaluation. However, in traditional attribute grammar, a lot of copy rule chains must be used due to its essential limitations, which results in severe time and space problems. To improve the efficiency, the attribute grammar is extended by allowing a nonlocal dependency relationship (NDR). The use of this NDR avoids semantic information flowing through copy rule chains. The representation of NDR is described. An approach to maintaining the consistency of NDR in the semantic tree during program development is presented. The implementation of the NDR is discussed.<<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":"129857619","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.65094
Yun-Huan Chou, Wei-Peng Yang, C. Chang
A method is presented for arranging a set of records into buckets to facilitate partial match retrieval. The idea is mainly motivated by the concept of optimal Cartesian product files. For a set of records, the method recursively partitions them into a collection of optimal Cartesian product files. A performance formula of this new file structure is derived and the superiority of this data organization concept is established. It is shown that the Cartesian product file is only a special case of the proposed file system.<>
{"title":"Greedy file-a new data organization concept for partial match retrieval","authors":"Yun-Huan Chou, Wei-Peng Yang, C. Chang","doi":"10.1109/CMPSAC.1989.65094","DOIUrl":"https://doi.org/10.1109/CMPSAC.1989.65094","url":null,"abstract":"A method is presented for arranging a set of records into buckets to facilitate partial match retrieval. The idea is mainly motivated by the concept of optimal Cartesian product files. For a set of records, the method recursively partitions them into a collection of optimal Cartesian product files. A performance formula of this new file structure is derived and the superiority of this data organization concept is established. It is shown that the Cartesian product file is only a special case of the proposed file system.<<ETX>>","PeriodicalId":339677,"journal":{"name":"[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference","volume":"8 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":"127056496","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.65161
K. Zeroual
The requirement specification activity is one of the most error-prone and expensive in the software development life cycle. It is also a complex activity because of the fuzzy and informal nature of the user requirements, the lack of automated tools to support it, and the requirements evolution. A deductive approach is presented. It deals with some fundamental AI issues regarding the knowledge acquisition process-in particular, the way informal requirement descriptions evolve into formal ones. To show how the approach can be applied, a fragment of a patient monitoring system is specified in the top-down decomposition technique. The approach is implemented in a requirement specification tool, SMES (software modeling expert system).<>
{"title":"Reasoning on requirement specifications: a deductive approach","authors":"K. Zeroual","doi":"10.1109/CMPSAC.1989.65161","DOIUrl":"https://doi.org/10.1109/CMPSAC.1989.65161","url":null,"abstract":"The requirement specification activity is one of the most error-prone and expensive in the software development life cycle. It is also a complex activity because of the fuzzy and informal nature of the user requirements, the lack of automated tools to support it, and the requirements evolution. A deductive approach is presented. It deals with some fundamental AI issues regarding the knowledge acquisition process-in particular, the way informal requirement descriptions evolve into formal ones. To show how the approach can be applied, a fragment of a patient monitoring system is specified in the top-down decomposition technique. The approach is implemented in a requirement specification tool, SMES (software modeling expert system).<<ETX>>","PeriodicalId":339677,"journal":{"name":"[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference","volume":"20 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":"132441361","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
扫码关注我们
求助内容：
应助结果提醒方式：