Pub Date : 2000-11-01DOI: 10.1109/ISPSE.2000.913221
S. Mizutani, H. Tarumi, Y. Kambayashi
Business cooperation between companies is becoming popular in the world, which has brought changes to the management of business processes. Inter-organizational process management is widely required. We propose agent-based groupware, which realizes open and distributed business systems. In this groupware, agents act as interfaces between people and the business system. They also coordinate multiple jobs, people, and organizations. However it is very difficult to introduce, evaluate, and evolve agent-based groupware, because it is very difficult to estimate and test the effect of introducing agents into the real workplace. Human behavior is also a very important factor; because some people get accustomed to using the system, but others do not. To evaluate human behavior as well as agents' and processes we have been developing a simulator. This paper gives a simulation model which has some original aspects, describes the simulator and shows results of simulation.
{"title":"Simulating the impact of business process management agents and human factors","authors":"S. Mizutani, H. Tarumi, Y. Kambayashi","doi":"10.1109/ISPSE.2000.913221","DOIUrl":"https://doi.org/10.1109/ISPSE.2000.913221","url":null,"abstract":"Business cooperation between companies is becoming popular in the world, which has brought changes to the management of business processes. Inter-organizational process management is widely required. We propose agent-based groupware, which realizes open and distributed business systems. In this groupware, agents act as interfaces between people and the business system. They also coordinate multiple jobs, people, and organizations. However it is very difficult to introduce, evaluate, and evolve agent-based groupware, because it is very difficult to estimate and test the effect of introducing agents into the real workplace. Human behavior is also a very important factor; because some people get accustomed to using the system, but others do not. To evaluate human behavior as well as agents' and processes we have been developing a simulator. This paper gives a simulation model which has some original aspects, describes the simulator and shows results of simulation.","PeriodicalId":170375,"journal":{"name":"Proceedings International Symposium on Principles of Software Evolution","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125000433","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 : 2000-11-01DOI: 10.1109/ISPSE.2000.913245
E. Shibayama, M. Toyoda, B. Shizuki, S. Takahashi
We describe issues in design of visual languages that can provide a support for software evolution and lessons learned from our experience in the development of a visual language environment called KLIEG. In this paper, we put emphasis on general frameworks for visual syntax, interaction supports and aspect visualization. We also describe several specific techniques and design decisions of KLIEG.
{"title":"Design issues of visual languages for supporting software evolution","authors":"E. Shibayama, M. Toyoda, B. Shizuki, S. Takahashi","doi":"10.1109/ISPSE.2000.913245","DOIUrl":"https://doi.org/10.1109/ISPSE.2000.913245","url":null,"abstract":"We describe issues in design of visual languages that can provide a support for software evolution and lessons learned from our experience in the development of a visual language environment called KLIEG. In this paper, we put emphasis on general frameworks for visual syntax, interaction supports and aspect visualization. We also describe several specific techniques and design decisions of KLIEG.","PeriodicalId":170375,"journal":{"name":"Proceedings International Symposium on Principles of Software Evolution","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122706055","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 : 2000-11-01DOI: 10.1109/ISPSE.2000.913225
M. Rodríguez-Fórtiz, J. Parets-Llorca
There are many approaches to specify and design software systems, but their evolution is not usually dealt with. Our proposal is to use two formalisms to manage evolution: a language based on past predicate temporal logic (PPTL) and coloured Petri nets (CPN). Both formalisms allow the structure and behaviour of a system to be specified in the same way and to decide when a system can run or when it can evolve depending on its functioning and structure in the past. A correspondence relationship is established between both formalisms, which allows CPN to be used to reason about the integrity of the systems which evolve.
{"title":"Using predicate temporal logic and coloured Petri nets to specifying integrity restrictions in the structural evolution of temporal active systems","authors":"M. Rodríguez-Fórtiz, J. Parets-Llorca","doi":"10.1109/ISPSE.2000.913225","DOIUrl":"https://doi.org/10.1109/ISPSE.2000.913225","url":null,"abstract":"There are many approaches to specify and design software systems, but their evolution is not usually dealt with. Our proposal is to use two formalisms to manage evolution: a language based on past predicate temporal logic (PPTL) and coloured Petri nets (CPN). Both formalisms allow the structure and behaviour of a system to be specified in the same way and to decide when a system can run or when it can evolve depending on its functioning and structure in the past. A correspondence relationship is established between both formalisms, which allows CPN to be used to reason about the integrity of the systems which evolve.","PeriodicalId":170375,"journal":{"name":"Proceedings International Symposium on Principles of Software Evolution","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129919657","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 : 2000-11-01DOI: 10.1109/ISPSE.2000.913232
N. Subramanian, L. Chung
As the environment of a software system continuously changes, so should the system adapt to such changes for its continued success and survival. Software architecture greatly facilitates the process of software adaptation to environmental changes, since changes are then made to the components instead of the much larger system as a whole. Adaptability for embedded systems often requires techniques different from those used for non-embedded systems. This is due to the fact that embedded systems operate in a harsher environment. This paper considers software adaptability as a key non-functional requirement (NFR) for evolving systems and discusses this concept as applied to embedded systems. The strategies available to adapt an embedded system are explained by solving the practical problem of vocabulary evolution. Several adaptable software architectures for an embedded system for this problem are developed. The codes that follow from these architectures are then implemented in an embedded system and the results are discussed.
{"title":"Architecture-driven embedded systems adaptation for supporting vocabulary evolution","authors":"N. Subramanian, L. Chung","doi":"10.1109/ISPSE.2000.913232","DOIUrl":"https://doi.org/10.1109/ISPSE.2000.913232","url":null,"abstract":"As the environment of a software system continuously changes, so should the system adapt to such changes for its continued success and survival. Software architecture greatly facilitates the process of software adaptation to environmental changes, since changes are then made to the components instead of the much larger system as a whole. Adaptability for embedded systems often requires techniques different from those used for non-embedded systems. This is due to the fact that embedded systems operate in a harsher environment. This paper considers software adaptability as a key non-functional requirement (NFR) for evolving systems and discusses this concept as applied to embedded systems. The strategies available to adapt an embedded system are explained by solving the practical problem of vocabulary evolution. Several adaptable software architectures for an embedded system for this problem are developed. The codes that follow from these architectures are then implemented in an embedded system and the results are discussed.","PeriodicalId":170375,"journal":{"name":"Proceedings International Symposium on Principles of Software Evolution","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125848047","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 : 2000-11-01DOI: 10.1109/ISPSE.2000.913250
S. Saranauwarat, H. Taniguchi
Improving an operating system's support for the evolution of software is vital to the goal of reducing the significant sum spent on adapting existing software to changing user requirements, especially to improve the performance of software. Therefore, we proposed the idea that, by increasing an operating system's abilities to observe the software's execution behavior and to evolve its execution behavior using the observed results, the operating system could adapt existing software to changing user requirements without making any changes to the software. We integrated the above abilities into a CPU scheduling mechanism in an operating system, and we verified the usefulness of our idea using existing software, viz. a World Wide Web (WWW) server. In this case, our scheduling mechanism alters the execution behavior of a WWW server by giving preferential use of the CPU resources to server processes handling HTML file requests. This allows the user's requirement for the enhancement of response time during periods of high demand to be satisfied. In order to determine which processes are server processes handling HTML file requests, we introduced the scheduling parameters SLP (Scheduling of Long-wait Processes) and RW (Run/Wait). In this paper, we describe how we predicted and updated the RW parameter based on the observed execution behavior of a WWW server, and we present an experimental validation of our method.
{"title":"Operating systems support for the evolution of software: an evaluation using WWW server software","authors":"S. Saranauwarat, H. Taniguchi","doi":"10.1109/ISPSE.2000.913250","DOIUrl":"https://doi.org/10.1109/ISPSE.2000.913250","url":null,"abstract":"Improving an operating system's support for the evolution of software is vital to the goal of reducing the significant sum spent on adapting existing software to changing user requirements, especially to improve the performance of software. Therefore, we proposed the idea that, by increasing an operating system's abilities to observe the software's execution behavior and to evolve its execution behavior using the observed results, the operating system could adapt existing software to changing user requirements without making any changes to the software. We integrated the above abilities into a CPU scheduling mechanism in an operating system, and we verified the usefulness of our idea using existing software, viz. a World Wide Web (WWW) server. In this case, our scheduling mechanism alters the execution behavior of a WWW server by giving preferential use of the CPU resources to server processes handling HTML file requests. This allows the user's requirement for the enhancement of response time during periods of high demand to be satisfied. In order to determine which processes are server processes handling HTML file requests, we introduced the scheduling parameters SLP (Scheduling of Long-wait Processes) and RW (Run/Wait). In this paper, we describe how we predicted and updated the RW parameter based on the observed execution behavior of a WWW server, and we present an experimental validation of our method.","PeriodicalId":170375,"journal":{"name":"Proceedings International Symposium on Principles of Software Evolution","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114534233","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 : 2000-11-01DOI: 10.1109/ISPSE.2000.913217
Y. Tsukada
This paper proposes a new proof-based approach to safe evolution of distributed software systems. Specifically it extends the simple certification mechanism of proof-carrying code (PCC) to make it interactive and probabilistic, thereby devising code with interactive proof (CIP). With CIP, a code consumer is convinced, with overwhelming probability, of the existence and validity of a safety proof of a transmitted code through interaction with a code producer. The class of safety properties that are provable by CIP is larger than the class provable by PCC, provided that each code consumer is allowed to spend a reasonable amount of time on verification. Moreover, CIP can be further extended to devise code with zero-knowledge interactive proof (CZKIP). This concept is useful, for example, when the code producer wants to use the safety proof as a kind of "copyright" of the code.
{"title":"Mobile codes with interactive proofs: an approach to provably safe evolution of distributed software systems","authors":"Y. Tsukada","doi":"10.1109/ISPSE.2000.913217","DOIUrl":"https://doi.org/10.1109/ISPSE.2000.913217","url":null,"abstract":"This paper proposes a new proof-based approach to safe evolution of distributed software systems. Specifically it extends the simple certification mechanism of proof-carrying code (PCC) to make it interactive and probabilistic, thereby devising code with interactive proof (CIP). With CIP, a code consumer is convinced, with overwhelming probability, of the existence and validity of a safety proof of a transmitted code through interaction with a code producer. The class of safety properties that are provable by CIP is larger than the class provable by PCC, provided that each code consumer is allowed to spend a reasonable amount of time on verification. Moreover, CIP can be further extended to devise code with zero-knowledge interactive proof (CZKIP). This concept is useful, for example, when the code producer wants to use the safety proof as a kind of \"copyright\" of the code.","PeriodicalId":170375,"journal":{"name":"Proceedings International Symposium on Principles of Software Evolution","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131573815","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 : 2000-11-01DOI: 10.1109/ISPSE.2000.913240
S. Yamamoto, K. Agusa
The open-source movement plays an important role especially in the middle and lower phases of software development, and it brings a new research style to software engineering. Researchers can now access large quantities of large-scale and commercial-quality software for free without any non-disclosure agreement (NDA). In this paper, we report a project named "Sappy" in order to establish the communication field and a knowledge-sharing space for open-source software developers (where the knowledge consists of idioms, sample program segments, programming know-how, bug reports and debugging solutions, to-do lists, and so on). We have built the Source Program Archives Site, which collects and stores large quantities of excellent open-source software programs. The site analyses the source programs in order to generated marked-up source programs in HTML by the tool called SPIE which we are developing for this project. The site provides the tagged source programs through the Internet. Thus, software developers can browse and retrieve portions of software with popular Internet browsers like Netscape Communicator and Microsoft Internet Explorer.
开源运动尤其在软件开发的中下游阶段发挥着重要作用，它给软件工程带来了一种新的研究方式。研究人员现在无需任何保密协议(NDA)就可以免费获取大量大规模的商业质量软件。在本文中，我们报告了一个名为“Sappy”的项目，目的是为开源软件开发人员建立交流领域和知识共享空间(其中的知识包括习惯用法、示例程序段、编程技术、错误报告和调试解决方案、待办事项列表等)。我们建立了源程序档案网站，收集和存储了大量优秀的开源软件程序。本网站利用SPIE工具对源程序进行分析，以生成HTML格式的标记源程序。SPIE是我们为本项目开发的工具。该网站通过互联网提供带标签的源程序。因此，软件开发人员可以使用流行的Internet浏览器(如Netscape Communicator和Microsoft Internet Explorer)浏览和检索软件的部分内容。
{"title":"Source Program Archives Site: a step toward cooperation of open-source movement and software engineering","authors":"S. Yamamoto, K. Agusa","doi":"10.1109/ISPSE.2000.913240","DOIUrl":"https://doi.org/10.1109/ISPSE.2000.913240","url":null,"abstract":"The open-source movement plays an important role especially in the middle and lower phases of software development, and it brings a new research style to software engineering. Researchers can now access large quantities of large-scale and commercial-quality software for free without any non-disclosure agreement (NDA). In this paper, we report a project named \"Sappy\" in order to establish the communication field and a knowledge-sharing space for open-source software developers (where the knowledge consists of idioms, sample program segments, programming know-how, bug reports and debugging solutions, to-do lists, and so on). We have built the Source Program Archives Site, which collects and stores large quantities of excellent open-source software programs. The site analyses the source programs in order to generated marked-up source programs in HTML by the tool called SPIE which we are developing for this project. The site provides the tagged source programs through the Internet. Thus, software developers can browse and retrieve portions of software with popular Internet browsers like Netscape Communicator and Microsoft Internet Explorer.","PeriodicalId":170375,"journal":{"name":"Proceedings International Symposium on Principles of Software Evolution","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129879041","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 : 2000-11-01DOI: 10.1109/ISPSE.2000.913251
T. Katayama, K. Saisho, A. Fukuda
Writing device drivers takes much time and requires effort because it needs knowledge of the target device and operating system (OS). In order to lighten the burden, the authors have proposed a model to generate device drivers and a device-driver generation system. The system generates the source code of a device driver from three inputs: the device driver specification, an OS-dependent specification and a device-dependent specification. The device drivers generated in the model are evolutionary because their features can be expanded easily. However, they are not always effective because the burden of describing the device-dependent specification, which is one of the inputs, is nearly as same as in the traditional method. In this paper, to aim at a greater reduction of the burden, device drivers are abstracted again, each input is defined afresh, and then a prototype of the system is implemented. As an example of the generation, we chose an interrupt handler of a network device, FreeBSD and Linux as the target OSs, and Etherlink XL as the target device. The OS-dependent specification and the device-dependent specification can be reused in each OS and each device, respectively. As a result, an identical device-dependent specification can be applied to both OSs. The burden in generating new device drivers or in porting device drivers to other OSs can thus be reduced.
{"title":"Prototype of the device driver generation system for UNIX-like operating systems","authors":"T. Katayama, K. Saisho, A. Fukuda","doi":"10.1109/ISPSE.2000.913251","DOIUrl":"https://doi.org/10.1109/ISPSE.2000.913251","url":null,"abstract":"Writing device drivers takes much time and requires effort because it needs knowledge of the target device and operating system (OS). In order to lighten the burden, the authors have proposed a model to generate device drivers and a device-driver generation system. The system generates the source code of a device driver from three inputs: the device driver specification, an OS-dependent specification and a device-dependent specification. The device drivers generated in the model are evolutionary because their features can be expanded easily. However, they are not always effective because the burden of describing the device-dependent specification, which is one of the inputs, is nearly as same as in the traditional method. In this paper, to aim at a greater reduction of the burden, device drivers are abstracted again, each input is defined afresh, and then a prototype of the system is implemented. As an example of the generation, we chose an interrupt handler of a network device, FreeBSD and Linux as the target OSs, and Etherlink XL as the target device. The OS-dependent specification and the device-dependent specification can be reused in each OS and each device, respectively. As a result, an identical device-dependent specification can be applied to both OSs. The burden in generating new device drivers or in porting device drivers to other OSs can thus be reduced.","PeriodicalId":170375,"journal":{"name":"Proceedings International Symposium on Principles of Software Evolution","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126660465","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 : 2000-11-01DOI: 10.1109/ISPSE.2000.913224
C. Gómez, Jaume López, Antoni Olivé
We study temporal conceptual schema evolutions related to reification, a typical and complex modeling construct. Various types of reification are considered. Using a previously defined framework, we specify only at conceptual level (and without descending to logical or application levels), the effects of any possible evolution related to reification, thus reducing the complexity of the management of those changes.
{"title":"Evolving temporal conceptual schemas: the reification case","authors":"C. Gómez, Jaume López, Antoni Olivé","doi":"10.1109/ISPSE.2000.913224","DOIUrl":"https://doi.org/10.1109/ISPSE.2000.913224","url":null,"abstract":"We study temporal conceptual schema evolutions related to reification, a typical and complex modeling construct. Various types of reification are considered. Using a previously defined framework, we specify only at conceptual level (and without descending to logical or application levels), the effects of any possible evolution related to reification, thus reducing the complexity of the management of those changes.","PeriodicalId":170375,"journal":{"name":"Proceedings International Symposium on Principles of Software Evolution","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122391488","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 : 2000-11-01DOI: 10.1109/ISPSE.2000.913238
T. Aoshima, N. Yonezaki
We introduce an efficient tableau-based satisfiability checking procedure for a specification which consists of several modules. This method extracts reduced constraints from each module and verifies a property with them. We also show that this method is applicable to the decision procedure for strong satisfiability and stepwise satisfiability. Finally, we show the experimental results of the method.
{"title":"Verification of reactive system specifications with outer event conditional formula","authors":"T. Aoshima, N. Yonezaki","doi":"10.1109/ISPSE.2000.913238","DOIUrl":"https://doi.org/10.1109/ISPSE.2000.913238","url":null,"abstract":"We introduce an efficient tableau-based satisfiability checking procedure for a specification which consists of several modules. This method extracts reduced constraints from each module and verifies a property with them. We also show that this method is applicable to the decision procedure for strong satisfiability and stepwise satisfiability. Finally, we show the experimental results of the method.","PeriodicalId":170375,"journal":{"name":"Proceedings International Symposium on Principles of Software Evolution","volume":"295 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122718815","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
扫码关注我们
求助内容：
应助结果提醒方式：