Pub Date : 2000-10-30DOI: 10.1109/APAQ.2000.883777
Wang Jianzhong, Xu Qiwen, Ma Huadong
In this paper we study the formal modelling and verification of a network player system using Duration Calculus, a real time interval temporal logic. The system is modelled by the conjunction of a number of Duration Calculus formulae each capturing a basic property of the system. That the system satisfies the requirement is expressed by the entailment of the requirement formula from the system formula. We use an automated tool DCValid for verification. DCValid is a model checking tool and it cannot verify our system in the general form, and therefore a special instance is derived from the general model and subsequently checked using DCValid.
{"title":"Modelling and verification of a network player system with DCValid","authors":"Wang Jianzhong, Xu Qiwen, Ma Huadong","doi":"10.1109/APAQ.2000.883777","DOIUrl":"https://doi.org/10.1109/APAQ.2000.883777","url":null,"abstract":"In this paper we study the formal modelling and verification of a network player system using Duration Calculus, a real time interval temporal logic. The system is modelled by the conjunction of a number of Duration Calculus formulae each capturing a basic property of the system. That the system satisfies the requirement is expressed by the entailment of the requirement formula from the system formula. We use an automated tool DCValid for verification. DCValid is a model checking tool and it cannot verify our system in the general form, and therefore a special instance is derived from the general model and subsequently checked using DCValid.","PeriodicalId":432680,"journal":{"name":"Proceedings First Asia-Pacific Conference on Quality Software","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133257172","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-10-30DOI: 10.1109/APAQ.2000.883800
Jian Zhang
In the analysis of state-based requirement specifications and in software test data generation, one often has to determine the satisfiability of Boolean combinations of numeric constraints. Theoretically this problem is undecidable, and practically many problem instances are very difficult. In this paper an extension to a Boolean constraint solver is described. The new tool can deal with variables of other types (including the enumerated type, integers and reals). It combines Boolean logic reasoning with linear programming and bound propagation. Non-linear constraints are allowed, but the solving method is incomplete. Experimental results show that the tool can be quite useful in testing specifications as well as procedural code.
{"title":"Specification analysis and test data generation by solving Boolean combinations of numeric constraints","authors":"Jian Zhang","doi":"10.1109/APAQ.2000.883800","DOIUrl":"https://doi.org/10.1109/APAQ.2000.883800","url":null,"abstract":"In the analysis of state-based requirement specifications and in software test data generation, one often has to determine the satisfiability of Boolean combinations of numeric constraints. Theoretically this problem is undecidable, and practically many problem instances are very difficult. In this paper an extension to a Boolean constraint solver is described. The new tool can deal with variables of other types (including the enumerated type, integers and reals). It combines Boolean logic reasoning with linear programming and bound propagation. Non-linear constraints are allowed, but the solving method is incomplete. Experimental results show that the tool can be quite useful in testing specifications as well as procedural code.","PeriodicalId":432680,"journal":{"name":"Proceedings First Asia-Pacific Conference on Quality Software","volume":"123 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117325294","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-10-30DOI: 10.1109/APAQ.2000.883802
Karl R. P. H. Leung, W. Wong
Specifications are the primary source for obtaining test cases in software testing. Specification based testing is becoming more and more important when black box components and COTS are widely used in software development. One of these systematic approaches is deriving test cases from a classification tree. This approach partitions the input domain into classifications. Classifications are further partitioned into classes. Test cases are combinations of classes. Relations between classifications and classes are identified and are used to construct the classification tree. From the classification tree, a combination table is constructed. Test cases are derived from the combination table. However human decisions are required in determining whether test cases derived from the combination table are valid. This problem is incurred by the limitation of the expressive power and elegance of the two kinds of relations, namely classification classes and Class-Classification, that are allowed in the classification tree. We propose an enhancement of the classification tree by replacing the two kinds of relations by a Class-Class relation. We call this new approach Class Graphs. This paper describes the class graphs approach and compares its expressive power with the classification tree and show how test cases can be derived from class graph in a more efficient way.
{"title":"Towards a more efficient way of generating test cases: class graphs","authors":"Karl R. P. H. Leung, W. Wong","doi":"10.1109/APAQ.2000.883802","DOIUrl":"https://doi.org/10.1109/APAQ.2000.883802","url":null,"abstract":"Specifications are the primary source for obtaining test cases in software testing. Specification based testing is becoming more and more important when black box components and COTS are widely used in software development. One of these systematic approaches is deriving test cases from a classification tree. This approach partitions the input domain into classifications. Classifications are further partitioned into classes. Test cases are combinations of classes. Relations between classifications and classes are identified and are used to construct the classification tree. From the classification tree, a combination table is constructed. Test cases are derived from the combination table. However human decisions are required in determining whether test cases derived from the combination table are valid. This problem is incurred by the limitation of the expressive power and elegance of the two kinds of relations, namely classification classes and Class-Classification, that are allowed in the classification tree. We propose an enhancement of the classification tree by replacing the two kinds of relations by a Class-Class relation. We call this new approach Class Graphs. This paper describes the class graphs approach and compares its expressive power with the classification tree and show how test cases can be derived from class graph in a more efficient way.","PeriodicalId":432680,"journal":{"name":"Proceedings First Asia-Pacific Conference on Quality Software","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134593039","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 : 1900-01-01DOI: 10.1109/APAQ.2000.883772
V. Klimov, A. Mikhailovsky, S. Xu, A. Malko, C. Leatherdale, M. Bawendl
{"title":"Proceedings First Asia-Pacific Conference on Quality Software","authors":"V. Klimov, A. Mikhailovsky, S. Xu, A. Malko, C. Leatherdale, M. Bawendl","doi":"10.1109/APAQ.2000.883772","DOIUrl":"https://doi.org/10.1109/APAQ.2000.883772","url":null,"abstract":"","PeriodicalId":432680,"journal":{"name":"Proceedings First Asia-Pacific Conference on Quality Software","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123317095","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
扫码关注我们
求助内容：
应助结果提醒方式：