Pub Date : 1998-12-02DOI: 10.1109/APSEC.1998.733718
Harumi Watanabe, Hiroki Tokuoka, Wenxin Wu, M. Saeki
Object-oriented software essentially has dynamic aspect such as object creation, deletion and dynamic binding during execution. This aspect makes behavior analysis and tests of object-oriented software significantly complicated. In this paper we propose a new technique of object-oriented software analysis and testing by using Coloured Petri Nets (CPN), which is an extended version of Petri Net, one of formal techniques having the ability to analyze concurrent behavior. We represent identified objects with colored tokens of a CPN expressing object oriented software in order to avoid the net-explosion problem. We provide translation rules of object-oriented software into a CPN and a technique to analyze and test effectively the net to investigate several behavioral properties. Our translation technique is essentially independent of which language we describe software. As an example, to show the effectiveness of our technique, we pick up UML (Unified Modeling Language) and translate a specification written in it into a CPN. The net is analyzed tested and simulated as a prototype of the specification.
{"title":"A technique for analysing and testing object-oriented software using coloured Petri nets","authors":"Harumi Watanabe, Hiroki Tokuoka, Wenxin Wu, M. Saeki","doi":"10.1109/APSEC.1998.733718","DOIUrl":"https://doi.org/10.1109/APSEC.1998.733718","url":null,"abstract":"Object-oriented software essentially has dynamic aspect such as object creation, deletion and dynamic binding during execution. This aspect makes behavior analysis and tests of object-oriented software significantly complicated. In this paper we propose a new technique of object-oriented software analysis and testing by using Coloured Petri Nets (CPN), which is an extended version of Petri Net, one of formal techniques having the ability to analyze concurrent behavior. We represent identified objects with colored tokens of a CPN expressing object oriented software in order to avoid the net-explosion problem. We provide translation rules of object-oriented software into a CPN and a technique to analyze and test effectively the net to investigate several behavioral properties. Our translation technique is essentially independent of which language we describe software. As an example, to show the effectiveness of our technique, we pick up UML (Unified Modeling Language) and translate a specification written in it into a CPN. The net is analyzed tested and simulated as a prototype of the specification.","PeriodicalId":296589,"journal":{"name":"Proceedings 1998 Asia Pacific Software Engineering Conference (Cat. No.98EX240)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124971858","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 : 1998-12-02DOI: 10.1109/APSEC.1998.733738
Cang-Ho Choi, Myong Gyun Choi, Soo Dong Kim
This paper presents a visual client/server monitoring and management tool, CSMonitor, that provides realtime message monitoring of distributed CORBA objects, network traffic monitoring, statistic information for load balancing, and various management information for client and server nodes. The key component of CSMonitor is a CORBA interceptor module, which we developed in Visibroker for Java. CSMonitor provides various client/server and distributed computing information graphically. Hence, this tool can be effectively used in developing CORBA-based applications in order to verify the object clustering and design model and in monitoring the network overload of running CORBA applications. By having CSMonitor running, note it becomes possible to visualize the hidden inside of Object Request Broker (ORB), and to use the information provided by CSMonitor for performance optimization.
{"title":"CSMonitor: a visual client/server monitor for CORBA-based distributed applications","authors":"Cang-Ho Choi, Myong Gyun Choi, Soo Dong Kim","doi":"10.1109/APSEC.1998.733738","DOIUrl":"https://doi.org/10.1109/APSEC.1998.733738","url":null,"abstract":"This paper presents a visual client/server monitoring and management tool, CSMonitor, that provides realtime message monitoring of distributed CORBA objects, network traffic monitoring, statistic information for load balancing, and various management information for client and server nodes. The key component of CSMonitor is a CORBA interceptor module, which we developed in Visibroker for Java. CSMonitor provides various client/server and distributed computing information graphically. Hence, this tool can be effectively used in developing CORBA-based applications in order to verify the object clustering and design model and in monitoring the network overload of running CORBA applications. By having CSMonitor running, note it becomes possible to visualize the hidden inside of Object Request Broker (ORB), and to use the information provided by CSMonitor for performance optimization.","PeriodicalId":296589,"journal":{"name":"Proceedings 1998 Asia Pacific Software Engineering Conference (Cat. No.98EX240)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114479886","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 : 1998-12-02DOI: 10.1109/APSEC.1998.733732
Toshiaki Aoki, T. Katayama
The scale of software products is becoming larger as a result of the rapid progress and increasing use of computer systems. It is necessary to develop such large-scale software effectively. object-oriented methodologies have been proposed for the development of such systems. In typical object-oriented methodologies like OMT, a target system is described by several model which mirror different views of it. Though it is desirable to analyze models in this style as it enables us to represent independent aspects of the system in orthogonal manner, it causes a difficulty to maintain consistency among them. In this paper, we show a mechanism to unify analysis models at first. This allows us to deal with the models in concepts shared by them. Next we propose a verification method for checking consistency among them with respect to dataflow. In our method, verification is performed by proving dataflow in an axiomatic system.
{"title":"Unification and consistency verification of object-oriented analysis models","authors":"Toshiaki Aoki, T. Katayama","doi":"10.1109/APSEC.1998.733732","DOIUrl":"https://doi.org/10.1109/APSEC.1998.733732","url":null,"abstract":"The scale of software products is becoming larger as a result of the rapid progress and increasing use of computer systems. It is necessary to develop such large-scale software effectively. object-oriented methodologies have been proposed for the development of such systems. In typical object-oriented methodologies like OMT, a target system is described by several model which mirror different views of it. Though it is desirable to analyze models in this style as it enables us to represent independent aspects of the system in orthogonal manner, it causes a difficulty to maintain consistency among them. In this paper, we show a mechanism to unify analysis models at first. This allows us to deal with the models in concepts shared by them. Next we propose a verification method for checking consistency among them with respect to dataflow. In our method, verification is performed by proving dataflow in an axiomatic system.","PeriodicalId":296589,"journal":{"name":"Proceedings 1998 Asia Pacific Software Engineering Conference (Cat. No.98EX240)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130327011","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 : 1998-12-02DOI: 10.1109/APSEC.1998.733730
C. Chung, Moon-kun Lee, M. Jeong
This paper presents a methodology to verify very large and complex real-time software, such as ATM switching system. Due to the size and complexity, it is commonly very hard to understand and then verify the software. To overcome this problem, the methodology provides a scalable and modular approach to software understanding and verification. Firstly, an architecture of the software is constructed. The basic building block of the architecture is a Software Unit (SWU) which is hierarchically organized in the architecture. It guides understanding of the structural, functional, and behavioral views of the software at different abstraction levels. Secondly, there is a behavioral representation in the Real-time State Machine for Reverse Specification (RSMRS). RSMRS is constructed from SWU using reverse specification. RSMRS is further simulated and the simulation output is analyzed for verification. One of the most powerful characteristics of this approach is the capability of abstracting and exploding and verification information.
本文提出了一种验证大型复杂实时软件的方法，如ATM交换系统。由于软件的大小和复杂性，通常很难理解和验证软件。为了克服这个问题，该方法为软件理解和验证提供了一种可伸缩和模块化的方法。首先，构建了软件的体系结构。体系结构的基本构建块是软件单元(Software Unit, SWU)，它在体系结构中分层组织。它指导在不同抽象层次上对软件的结构、功能和行为视图的理解。其次，在反向规范实时状态机(RSMRS)中有一种行为表示。RSMRS是使用反向规范从SWU构造的。进一步对RSMRS进行了仿真，并对仿真输出进行了分析验证。这种方法最强大的特征之一是抽象、扩展和验证信息的能力。
{"title":"A scalable and modular approach to verification of ATM switching system using reverse specification","authors":"C. Chung, Moon-kun Lee, M. Jeong","doi":"10.1109/APSEC.1998.733730","DOIUrl":"https://doi.org/10.1109/APSEC.1998.733730","url":null,"abstract":"This paper presents a methodology to verify very large and complex real-time software, such as ATM switching system. Due to the size and complexity, it is commonly very hard to understand and then verify the software. To overcome this problem, the methodology provides a scalable and modular approach to software understanding and verification. Firstly, an architecture of the software is constructed. The basic building block of the architecture is a Software Unit (SWU) which is hierarchically organized in the architecture. It guides understanding of the structural, functional, and behavioral views of the software at different abstraction levels. Secondly, there is a behavioral representation in the Real-time State Machine for Reverse Specification (RSMRS). RSMRS is constructed from SWU using reverse specification. RSMRS is further simulated and the simulation output is analyzed for verification. One of the most powerful characteristics of this approach is the capability of abstracting and exploding and verification information.","PeriodicalId":296589,"journal":{"name":"Proceedings 1998 Asia Pacific Software Engineering Conference (Cat. No.98EX240)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121705762","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 : 1998-12-02DOI: 10.1109/APSEC.1998.733733
Y. Jang, H. Chae, Y. Kwon, Doo-Hwan Bae
Modified programs are required to be retested to determine whether changes have been made correctly and to investigate whether those cause any adverse effect on the program behavior. Then, the key issue is the extent of the retesting tasks. To save time and efforts, retesting should be done on only the parts that might be affected by changes. Change impact analysis is the activity which identifies the parts to be retested. Object-oriented paradigm is based on several concepts such as encapsulation, inheritance, polymorphism, and dynamic binding. Although these features contribute to the reusability and extensibility of systems, they produce complex dependencies between classes and attributes, which make it difficult to identify the affected components by changes. We propose an approach for analyzing change impact in a class hierarchy. Our approach is based on the class firewall method, but aims to reduce the retesting effort significantly by taking a member function as a test unit. We deal with the impacts of changes associated with various object-oriented features as well as types of changes which can occur at the level of a data member a member function, a class, and an inheritance relation.
{"title":"Change impact analysis for a class hierarchy","authors":"Y. Jang, H. Chae, Y. Kwon, Doo-Hwan Bae","doi":"10.1109/APSEC.1998.733733","DOIUrl":"https://doi.org/10.1109/APSEC.1998.733733","url":null,"abstract":"Modified programs are required to be retested to determine whether changes have been made correctly and to investigate whether those cause any adverse effect on the program behavior. Then, the key issue is the extent of the retesting tasks. To save time and efforts, retesting should be done on only the parts that might be affected by changes. Change impact analysis is the activity which identifies the parts to be retested. Object-oriented paradigm is based on several concepts such as encapsulation, inheritance, polymorphism, and dynamic binding. Although these features contribute to the reusability and extensibility of systems, they produce complex dependencies between classes and attributes, which make it difficult to identify the affected components by changes. We propose an approach for analyzing change impact in a class hierarchy. Our approach is based on the class firewall method, but aims to reduce the retesting effort significantly by taking a member function as a test unit. We deal with the impacts of changes associated with various object-oriented features as well as types of changes which can occur at the level of a data member a member function, a class, and an inheritance relation.","PeriodicalId":296589,"journal":{"name":"Proceedings 1998 Asia Pacific Software Engineering Conference (Cat. No.98EX240)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121985611","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 : 1998-12-02DOI: 10.1109/APSEC.1998.733553
Yoshio Satoh
To realize the open and global software marketplace and to enable the virtual enterprise along with software life-cycle, we have completed a two year project named the NGSE (Next Generation Software Engineering) program which is a part of Software CALS (Continuous Acquisition and Lifecycle Support) project sponsored by IPA (Information technology Promotion Agency). The NGSE program developed and demonstrated the enabling technologies for CBSD (Component-Based Software Development) or Componentware, which consist of technology standards, application guidelines and environments for sharing software information and providing network security. This paper reports the results of the NGSE program including the business model and experiments of CBSD. We discuss the following CBSD technologies for the enabling cooperative software development in a distributed object environment. (i) Component trading on Internet. (ii) Software integration technologies using prefabricated software components. (iii) System integration technologies. (iv) Internet security technologies. From these experiments, we can conclude the proposed CBSD enabling technologies for next generation software engineering is feasible.
{"title":"Experiment of component-based software development on multiple distributed object environments","authors":"Yoshio Satoh","doi":"10.1109/APSEC.1998.733553","DOIUrl":"https://doi.org/10.1109/APSEC.1998.733553","url":null,"abstract":"To realize the open and global software marketplace and to enable the virtual enterprise along with software life-cycle, we have completed a two year project named the NGSE (Next Generation Software Engineering) program which is a part of Software CALS (Continuous Acquisition and Lifecycle Support) project sponsored by IPA (Information technology Promotion Agency). The NGSE program developed and demonstrated the enabling technologies for CBSD (Component-Based Software Development) or Componentware, which consist of technology standards, application guidelines and environments for sharing software information and providing network security. This paper reports the results of the NGSE program including the business model and experiments of CBSD. We discuss the following CBSD technologies for the enabling cooperative software development in a distributed object environment. (i) Component trading on Internet. (ii) Software integration technologies using prefabricated software components. (iii) System integration technologies. (iv) Internet security technologies. From these experiments, we can conclude the proposed CBSD enabling technologies for next generation software engineering is feasible.","PeriodicalId":296589,"journal":{"name":"Proceedings 1998 Asia Pacific Software Engineering Conference (Cat. No.98EX240)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131602569","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 : 1998-12-02DOI: 10.1109/APSEC.1998.733606
J. Cybulski, K. Reed
This paper describes RARE (Reuse-Assisted Requirements Elicitation), a method enabling software requirements engineers to process informal software requirements effectively. RARE's object is to assist analysts in transforming requirements expressed in natural language into a comprehensive collection of rigorous specifications that can be used as a starting point in software development. However, unlike other approaches to managing requirements documents, RARE focuses on the application of reuse-intensive methods of dealing with requirements documents, their contents and structure, and the processes involved in the analysis and refinement of requirements texts. The RARE method circumscribes an iterative process of planning, gathering and elaboration analysis, refinement, adaptation, integration and validation of requirements texts. The paper also describes the operation of IDIOM (Informal Document Interpreter, Organiser and Manager), a requirements management tool that supports the RARE method.
{"title":"Computer-assisted analysis and refinement of informal software requirements documents","authors":"J. Cybulski, K. Reed","doi":"10.1109/APSEC.1998.733606","DOIUrl":"https://doi.org/10.1109/APSEC.1998.733606","url":null,"abstract":"This paper describes RARE (Reuse-Assisted Requirements Elicitation), a method enabling software requirements engineers to process informal software requirements effectively. RARE's object is to assist analysts in transforming requirements expressed in natural language into a comprehensive collection of rigorous specifications that can be used as a starting point in software development. However, unlike other approaches to managing requirements documents, RARE focuses on the application of reuse-intensive methods of dealing with requirements documents, their contents and structure, and the processes involved in the analysis and refinement of requirements texts. The RARE method circumscribes an iterative process of planning, gathering and elaboration analysis, refinement, adaptation, integration and validation of requirements texts. The paper also describes the operation of IDIOM (Informal Document Interpreter, Organiser and Manager), a requirements management tool that supports the RARE method.","PeriodicalId":296589,"journal":{"name":"Proceedings 1998 Asia Pacific Software Engineering Conference (Cat. No.98EX240)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130792107","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 : 1998-12-02DOI: 10.1109/APSEC.1998.733596
Greg Butler, P. Grogono, F. Khendek
A framework is developed in order to support the development of a family of applications. Many approaches to documenting frameworks have been tried though with different aims and audiences in mind. Of greatest utility are those aimed at reducing the learning curve for application developers. We propose the concept of a reuse case as offering a perspective of the different approaches to documenting frameworks. The categories of reuse cases are defined, and we discuss other views of reuse cases that can help to classify them.
{"title":"A reuse case perspective on documenting frameworks","authors":"Greg Butler, P. Grogono, F. Khendek","doi":"10.1109/APSEC.1998.733596","DOIUrl":"https://doi.org/10.1109/APSEC.1998.733596","url":null,"abstract":"A framework is developed in order to support the development of a family of applications. Many approaches to documenting frameworks have been tried though with different aims and audiences in mind. Of greatest utility are those aimed at reducing the learning curve for application developers. We propose the concept of a reuse case as offering a perspective of the different approaches to documenting frameworks. The categories of reuse cases are defined, and we discuss other views of reuse cases that can help to classify them.","PeriodicalId":296589,"journal":{"name":"Proceedings 1998 Asia Pacific Software Engineering Conference (Cat. No.98EX240)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129421243","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 : 1998-12-02DOI: 10.1109/APSEC.1998.733724
R. Biuk-Aghai
The recent interest in carrying out software engineering in a distributed manner could lead to a future increase in the contracting of software engineers, grouped into flexible, distributed software teams. One of the implications will be a requirement for more customizable software engineering environments to meet the diverse requirements of different projects. This paper examines customizability issues and suggests the use of component-based systems to achieve a high degree of customizability. A component model for software tools is presented in which tool components are characterized by the services they provide, require and optionally can use. Implementations of early prototypes, using JavaBeans components and employing the JavaBeans Activation Framework, are presented. The integration of legacy tools into the model is explored, and two mechanisms are presented: adapters encapsulate access to tools implemented in Java, and wrappers integrate other external tools.
{"title":"Customizable software engineering environments for flexible distributed software teams","authors":"R. Biuk-Aghai","doi":"10.1109/APSEC.1998.733724","DOIUrl":"https://doi.org/10.1109/APSEC.1998.733724","url":null,"abstract":"The recent interest in carrying out software engineering in a distributed manner could lead to a future increase in the contracting of software engineers, grouped into flexible, distributed software teams. One of the implications will be a requirement for more customizable software engineering environments to meet the diverse requirements of different projects. This paper examines customizability issues and suggests the use of component-based systems to achieve a high degree of customizability. A component model for software tools is presented in which tool components are characterized by the services they provide, require and optionally can use. Implementations of early prototypes, using JavaBeans components and employing the JavaBeans Activation Framework, are presented. The integration of legacy tools into the model is explored, and two mechanisms are presented: adapters encapsulate access to tools implemented in Java, and wrappers integrate other external tools.","PeriodicalId":296589,"journal":{"name":"Proceedings 1998 Asia Pacific Software Engineering Conference (Cat. No.98EX240)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130990653","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 : 1998-12-02DOI: 10.1109/APSEC.1998.733616
O. Abulnaja, S. Hosseini, K. Vairavan
Various studies have shown that both hardware and software are subject to failures. However, the majority of the existing works have dealt with the problem by considering that either software is fault-free but hardware is subject to failure, or hardware is fault-free but software is subject to failure. Thus, techniques for dealing with both software and hardware faults must be developed. In this work, we propose an efficient integrated fault-tolerant approach for ultrareliable execution of tasks where both hardware and software failures, and on-line fault diagnosis are considered. The proposed approach is called the Integrated Fault-Tolerant (IFT) approach. We also propose a scheduling algorithm called the Integrated Fault-Tolerant Scheduling (IFTS) algorithm based on the IFT technique.
{"title":"High performance technique for ultrareliable execution of tasks under both hardware and software faults","authors":"O. Abulnaja, S. Hosseini, K. Vairavan","doi":"10.1109/APSEC.1998.733616","DOIUrl":"https://doi.org/10.1109/APSEC.1998.733616","url":null,"abstract":"Various studies have shown that both hardware and software are subject to failures. However, the majority of the existing works have dealt with the problem by considering that either software is fault-free but hardware is subject to failure, or hardware is fault-free but software is subject to failure. Thus, techniques for dealing with both software and hardware faults must be developed. In this work, we propose an efficient integrated fault-tolerant approach for ultrareliable execution of tasks where both hardware and software failures, and on-line fault diagnosis are considered. The proposed approach is called the Integrated Fault-Tolerant (IFT) approach. We also propose a scheduling algorithm called the Integrated Fault-Tolerant Scheduling (IFTS) algorithm based on the IFT technique.","PeriodicalId":296589,"journal":{"name":"Proceedings 1998 Asia Pacific Software Engineering Conference (Cat. No.98EX240)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126299332","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
扫码关注我们
求助内容：
应助结果提醒方式：