Pub Date : 2000-09-11DOI: 10.1109/ICECCS.2000.873943
Aynur Abdurazik, P. Ammann, W. Ding, Jeff Offutt
This paper compares three specification-based testing criteria using Mathur and Wong's PROBSUBSUMES measure. The three criteria are specification-mutation coverage, full predicate coverage, and transition-pair coverage. A novel aspect of the work is that each criterion is encoded in a model checker, and the model checker is used first to generate test sets for each criterion and then to evaluate test sets against alternate criteria. Significantly, the use of the model checker for generation of test sets eliminates human bias from this phase of the experiment. The strengths and weaknesses of the criteria are discussed.
{"title":"Evaluation of three specification-based testing criteria","authors":"Aynur Abdurazik, P. Ammann, W. Ding, Jeff Offutt","doi":"10.1109/ICECCS.2000.873943","DOIUrl":"https://doi.org/10.1109/ICECCS.2000.873943","url":null,"abstract":"This paper compares three specification-based testing criteria using Mathur and Wong's PROBSUBSUMES measure. The three criteria are specification-mutation coverage, full predicate coverage, and transition-pair coverage. A novel aspect of the work is that each criterion is encoded in a model checker, and the model checker is used first to generate test sets for each criterion and then to evaluate test sets against alternate criteria. Significantly, the use of the model checker for generation of test sets eliminates human bias from this phase of the experiment. The strengths and weaknesses of the criteria are discussed.","PeriodicalId":228728,"journal":{"name":"Proceedings Sixth IEEE International Conference on Engineering of Complex Computer Systems. ICECCS 2000","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134059216","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-09-11DOI: 10.1109/ICECCS.2000.873937
L. Cortés, P. Eles, Zebo Peng
Design of embedded systems is a complex task that requires design cycles founded upon formal notation, so that the synthesis from specification to implementation can be carried out systematically. The authors present a computational model for embedded systems based on Petri nets called PRES+. It includes an explicit notion of time and allows a concise formulation of models. Tokens, in our notation hold information, and transitions when fired perform transformation of data. Based on this model we define several notions of equivalence (reachable, behavioral, time, and total), which provide the framework for transformational synthesis of embedded systems. Different representations of an Ethernet network coprocessor are studied in order to illustrate the applicability of PRES+ and the definitions of equivalence on practical systems.
{"title":"Definitions of equivalence for transformational synthesis of embedded systems","authors":"L. Cortés, P. Eles, Zebo Peng","doi":"10.1109/ICECCS.2000.873937","DOIUrl":"https://doi.org/10.1109/ICECCS.2000.873937","url":null,"abstract":"Design of embedded systems is a complex task that requires design cycles founded upon formal notation, so that the synthesis from specification to implementation can be carried out systematically. The authors present a computational model for embedded systems based on Petri nets called PRES+. It includes an explicit notion of time and allows a concise formulation of models. Tokens, in our notation hold information, and transitions when fired perform transformation of data. Based on this model we define several notions of equivalence (reachable, behavioral, time, and total), which provide the framework for transformational synthesis of embedded systems. Different representations of an Ethernet network coprocessor are studied in order to illustrate the applicability of PRES+ and the definitions of equivalence on practical systems.","PeriodicalId":228728,"journal":{"name":"Proceedings Sixth IEEE International Conference on Engineering of Complex Computer Systems. ICECCS 2000","volume":"2 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133257938","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-09-11DOI: 10.1109/ICECCS.2000.873928
H. Gomaa, Shaoying Liu, M. Shin
An application domain is defined as a family of systems that have some features in common and others that differentiate them. A domain model is a multiple view object oriented analysis model for the application domain that reflects the common aspects and variations among the members of the family of systems that constitute the domain. The paper describes the integration of the domain modeling method for analyzing and modeling families of software systems with the SOFL formal specification language. Aggregation hierarchies and generalization/specialization hierarchies are depicted using the UML static modeling notation. Object communication diagrams are depicted using the SOFL condition data flow diagram notation. SOFL is used for the formal specification of the kernel, optional and variant classes.
{"title":"Integration of the domain modeling method for families of systems with the SOFL formal specification language","authors":"H. Gomaa, Shaoying Liu, M. Shin","doi":"10.1109/ICECCS.2000.873928","DOIUrl":"https://doi.org/10.1109/ICECCS.2000.873928","url":null,"abstract":"An application domain is defined as a family of systems that have some features in common and others that differentiate them. A domain model is a multiple view object oriented analysis model for the application domain that reflects the common aspects and variations among the members of the family of systems that constitute the domain. The paper describes the integration of the domain modeling method for analyzing and modeling families of software systems with the SOFL formal specification language. Aggregation hierarchies and generalization/specialization hierarchies are depicted using the UML static modeling notation. Object communication diagrams are depicted using the SOFL condition data flow diagram notation. SOFL is used for the formal specification of the kernel, optional and variant classes.","PeriodicalId":228728,"journal":{"name":"Proceedings Sixth IEEE International Conference on Engineering of Complex Computer Systems. ICECCS 2000","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126264520","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-09-11DOI: 10.1109/ICECCS.2000.873947
Fuminori Nakanishi, Shinnya Hiraike, S. Inoue, Y. Kakuda, K. Toda
Imprecise computation is one of the promising schemes in real time systems to adapt the quality of computations to the change of load, keeping the deadlines of tasks in the systems. When overload occurs in the systems, the minimum requirements on the deadline are assured by decreasing the quality of the computation. This paper describes how to apply the concept of imprecise computation to automobile control in the expressway assuming the intelligent transportation system (ITS). The deadline violation of tasks for automobile control in the expressway induces collision of automobiles. Regardless of whether the expressway is congested or not, collision of automobiles must be avoided. To satisfy such requirement, the concept of imprecise computation is effective. This paper proposes a flexible scheduling using imprecise computation to avoid collision of automobiles and increase throughput.
{"title":"A flexible scheduling for automobile control using imprecise computation and its fundamental evaluation","authors":"Fuminori Nakanishi, Shinnya Hiraike, S. Inoue, Y. Kakuda, K. Toda","doi":"10.1109/ICECCS.2000.873947","DOIUrl":"https://doi.org/10.1109/ICECCS.2000.873947","url":null,"abstract":"Imprecise computation is one of the promising schemes in real time systems to adapt the quality of computations to the change of load, keeping the deadlines of tasks in the systems. When overload occurs in the systems, the minimum requirements on the deadline are assured by decreasing the quality of the computation. This paper describes how to apply the concept of imprecise computation to automobile control in the expressway assuming the intelligent transportation system (ITS). The deadline violation of tasks for automobile control in the expressway induces collision of automobiles. Regardless of whether the expressway is congested or not, collision of automobiles must be avoided. To satisfy such requirement, the concept of imprecise computation is effective. This paper proposes a flexible scheduling using imprecise computation to avoid collision of automobiles and increase throughput.","PeriodicalId":228728,"journal":{"name":"Proceedings Sixth IEEE International Conference on Engineering of Complex Computer Systems. ICECCS 2000","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126437183","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-09-11DOI: 10.1109/ICECCS.2000.873938
Hideaki Hirayama, H. Honda, T. Yuba
Mining the large Web based online distributed databases to discover new knowledge and financial gain is an important research problem. These computations require high performance distributed and parallel computing environments. Traditional data mining techniques such as classification, association, clustering can be extended to find new efficient solutions. The paper presents the scalable data mining problem, proposes the use of software DSM (distributed shared memory) with a new mechanism as an effective solution and discusses both the implementation and performance evaluation results. It is observed that the overhead of a software DSM is very large for scalable data mining programs. A new Log Based Consistency (LBC) mechanism, especially designed for scalable data mining on the software DSM is proposed to overcome this overhead. Traditional association rule based data mining programs frequently modify the same fields by count-up operations. In contrast, the LBC mechanism keeps up the consistency by broadcasting the count-up operation logs among the multiple nodes.
{"title":"Scalable data mining with log based consistency DSM for high performance distributed computing","authors":"Hideaki Hirayama, H. Honda, T. Yuba","doi":"10.1109/ICECCS.2000.873938","DOIUrl":"https://doi.org/10.1109/ICECCS.2000.873938","url":null,"abstract":"Mining the large Web based online distributed databases to discover new knowledge and financial gain is an important research problem. These computations require high performance distributed and parallel computing environments. Traditional data mining techniques such as classification, association, clustering can be extended to find new efficient solutions. The paper presents the scalable data mining problem, proposes the use of software DSM (distributed shared memory) with a new mechanism as an effective solution and discusses both the implementation and performance evaluation results. It is observed that the overhead of a software DSM is very large for scalable data mining programs. A new Log Based Consistency (LBC) mechanism, especially designed for scalable data mining on the software DSM is proposed to overcome this overhead. Traditional association rule based data mining programs frequently modify the same fields by count-up operations. In contrast, the LBC mechanism keeps up the consistency by broadcasting the count-up operation logs among the multiple nodes.","PeriodicalId":228728,"journal":{"name":"Proceedings Sixth IEEE International Conference on Engineering of Complex Computer Systems. ICECCS 2000","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133160051","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-09-11DOI: 10.1109/ICECCS.2000.873936
T. Kunii, Masayuki Hisada
Ever increasing software complexity requires serious consideration to make software as a whole into sustainable social infrastructure. Abstraction hierarchies realized as incrementally modular hierarchies of software are shown to be the strong candidates to reduce software complexity. The program construct of Java is used as a test case to demonstrate the power of cellular modeling and we show how cellular modeling serve as a rapid prototyping tool and a validation tool as well by showing abstracted Java program structures without complexity.
{"title":"Overcoming software complexity by constructing abstraction hierarchies: the principles and applications","authors":"T. Kunii, Masayuki Hisada","doi":"10.1109/ICECCS.2000.873936","DOIUrl":"https://doi.org/10.1109/ICECCS.2000.873936","url":null,"abstract":"Ever increasing software complexity requires serious consideration to make software as a whole into sustainable social infrastructure. Abstraction hierarchies realized as incrementally modular hierarchies of software are shown to be the strong candidates to reduce software complexity. The program construct of Java is used as a test case to demonstrate the power of cellular modeling and we show how cellular modeling serve as a rapid prototyping tool and a validation tool as well by showing abstracted Java program structures without complexity.","PeriodicalId":228728,"journal":{"name":"Proceedings Sixth IEEE International Conference on Engineering of Complex Computer Systems. ICECCS 2000","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129517785","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-09-11DOI: 10.1109/ICECCS.2000.873940
D. Notkin
Explicitly stated program invariants can help programmers by characterizing certain aspects of program execution and identifying program properties that must be preserved when modifying code. In practice, these invariants are usually absent from code. An alternative to expecting programmers to annotate code with invariants is to automatically infer invariants from the program itself. This talk describes dynamic techniques for discovering invariants from execution traces; the essential idea is to look for patterns in and relationships among variable values over a set of executions. An implementation has indicated that the approach is both effective -- successfully rediscovering formal specifications -- and useful --discovering invariants that assisted a software evolution task. The talk will also discuss, both in terms of invariant detection and also in more general terms, issues related to the potential synergy between static and dynamic analysis techniques.
{"title":"Dynamically detecting relevant program invariants","authors":"D. Notkin","doi":"10.1109/ICECCS.2000.873940","DOIUrl":"https://doi.org/10.1109/ICECCS.2000.873940","url":null,"abstract":"Explicitly stated program invariants can help programmers by characterizing certain aspects of program execution and identifying program properties that must be preserved when modifying code. In practice, these invariants are usually absent from code. An alternative to expecting programmers to annotate code with invariants is to automatically infer invariants from the program itself. This talk describes dynamic techniques for discovering invariants from execution traces; the essential idea is to look for patterns in and relationships among variable values over a set of executions. An implementation has indicated that the approach is both effective -- successfully rediscovering formal specifications -- and useful --discovering invariants that assisted a software evolution task. The talk will also discuss, both in terms of invariant detection and also in more general terms, issues related to the potential synergy between static and dynamic analysis techniques.","PeriodicalId":228728,"journal":{"name":"Proceedings Sixth IEEE International Conference on Engineering of Complex Computer Systems. ICECCS 2000","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127549959","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-09-11DOI: 10.1109/ICECCS.2000.873948
S. Inoue, Y. Kakuda, M. Terabe
In order to make the ATM network fault-tolerant and the network service flexible, a method for setting up backup virtual paths (VPs for short) using multiagents is effective with respect to adaptability to the change of network resource and user requirements, examples of which are failure of nodes and links and addition of VPs, respectively. In the method, under the assumption that candidates of backup VPs between different pairs of source and destination nodes are given, the optimum backup VPs are obtained by exchanging information among agents autonomously. First, this paper proposes a new measure for determining backup VPs between different pairs of source and destination nodes. The measure shows a degree of fault-tolerance for backup VPs and addition of VPs. Next, this paper presents simulation results to evaluate the adaptability of the method. The results show that the method efficiently obtains the optimum backup VPs even when the number of backup VPs increases and that different idle time at each destination node enables to shorten the total processing time while keeping complete detection of shared links.
{"title":"New measure and experimental evaluation for multiagent-based reservation of backup virtual paths in ATM networks","authors":"S. Inoue, Y. Kakuda, M. Terabe","doi":"10.1109/ICECCS.2000.873948","DOIUrl":"https://doi.org/10.1109/ICECCS.2000.873948","url":null,"abstract":"In order to make the ATM network fault-tolerant and the network service flexible, a method for setting up backup virtual paths (VPs for short) using multiagents is effective with respect to adaptability to the change of network resource and user requirements, examples of which are failure of nodes and links and addition of VPs, respectively. In the method, under the assumption that candidates of backup VPs between different pairs of source and destination nodes are given, the optimum backup VPs are obtained by exchanging information among agents autonomously. First, this paper proposes a new measure for determining backup VPs between different pairs of source and destination nodes. The measure shows a degree of fault-tolerance for backup VPs and addition of VPs. Next, this paper presents simulation results to evaluate the adaptability of the method. The results show that the method efficiently obtains the optimum backup VPs even when the number of backup VPs increases and that different idle time at each destination node enables to shorten the total processing time while keeping complete detection of shared links.","PeriodicalId":228728,"journal":{"name":"Proceedings Sixth IEEE International Conference on Engineering of Complex Computer Systems. ICECCS 2000","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130988864","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-09-11DOI: 10.1109/ICECCS.2000.873931
P. Petrov, A. Stoyen
The authors present an architectural overview of an agent based decision support environment. We have selected the domain of AWACS Command and Control, in which human controllers need to make critical decisions under strict timing constraints in a dynamically changing environment. The decision support training environment is based on distributed simulation, tightly coupled with an intelligent agent infrastructure. The agents apply heuristics based algorithms to provide decision support to the human controllers.
{"title":"An intelligent-agent based decision support system for a complex command and control application","authors":"P. Petrov, A. Stoyen","doi":"10.1109/ICECCS.2000.873931","DOIUrl":"https://doi.org/10.1109/ICECCS.2000.873931","url":null,"abstract":"The authors present an architectural overview of an agent based decision support environment. We have selected the domain of AWACS Command and Control, in which human controllers need to make critical decisions under strict timing constraints in a dynamically changing environment. The decision support training environment is based on distributed simulation, tightly coupled with an intelligent agent infrastructure. The agents apply heuristics based algorithms to provide decision support to the human controllers.","PeriodicalId":228728,"journal":{"name":"Proceedings Sixth IEEE International Conference on Engineering of Complex Computer Systems. ICECCS 2000","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128378045","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-09-11DOI: 10.1109/ICECCS.2000.873946
Tae Yoneda, T. Ohta
Telecommunication systems are typical complex systems. Services that independently operate normally will behave differently when simultaneously initiated with another service. This behavior is called feature interaction and is recognized to affect the dependability. This article proposes a method of dramatically reducing the computation time required for detecting feature interactions in telecommunication services. One of the knotty problems in defecting feature interactions at the specification design stage is terminal assignment. For the same service specifications, occurrence of feature interactions depends on how to assign real terminals to terminal variables in the specifications. Consequently, all terminals connected to the network have to be considered in order to detect all interactions. As a result, the number of combinations of terminal assignments is enormous. This causes huge expansion of computation time needed for detection of feature interactions. By considering equivalent states, the proposed method can reduce the number of terminal assignments to one 400th compared with that of the conventional method.
{"title":"Reduction of the number of terminal assignments for detecting feature interactions in telecommunication services","authors":"Tae Yoneda, T. Ohta","doi":"10.1109/ICECCS.2000.873946","DOIUrl":"https://doi.org/10.1109/ICECCS.2000.873946","url":null,"abstract":"Telecommunication systems are typical complex systems. Services that independently operate normally will behave differently when simultaneously initiated with another service. This behavior is called feature interaction and is recognized to affect the dependability. This article proposes a method of dramatically reducing the computation time required for detecting feature interactions in telecommunication services. One of the knotty problems in defecting feature interactions at the specification design stage is terminal assignment. For the same service specifications, occurrence of feature interactions depends on how to assign real terminals to terminal variables in the specifications. Consequently, all terminals connected to the network have to be considered in order to detect all interactions. As a result, the number of combinations of terminal assignments is enormous. This causes huge expansion of computation time needed for detection of feature interactions. By considering equivalent states, the proposed method can reduce the number of terminal assignments to one 400th compared with that of the conventional method.","PeriodicalId":228728,"journal":{"name":"Proceedings Sixth IEEE International Conference on Engineering of Complex Computer Systems. ICECCS 2000","volume":"212 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133137531","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
扫码关注我们
求助内容：
应助结果提醒方式：