{"title":"Failure Analysis of Open Source J2EE Application Servers","authors":"Junguo Li, Gang Huang, Jian Zou, Hong Mei","doi":"10.1109/QSIC.2007.27","DOIUrl":"https://doi.org/10.1109/QSIC.2007.27","url":null,"abstract":"Open source J2EE Application Servers (J2EE ASs) have already attracted industrial attentions in recent years, but the reliability is still an obstacle to their wide acceptance. The detail of software failures in J2EE AS was seldom discussed in the past, although such information is valuable to evaluate and improve its reliability. In this paper, we present a measurement- based failure classification and analysis. Presented results indicate open source J2EE AS's reliability needs improvement. Some notable results include: (1) the implementation of a widely used fault-tolerant mechanism, clustering, needs improvement; (2) only 15% of reported failures are removed within a week, and about 10% still open by the time we finish the study; (3) different J2EE ASs have different unreliable services so reliability improvement activities should be specific to both AS and applications.","PeriodicalId":136227,"journal":{"name":"Seventh International Conference on Quality Software (QSIC 2007)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129155013","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}
{"title":"Increasing Software Effort Estimation Accuracy Using Experience Data, Estimation Models and Checklists","authors":"K. M. Furulund, Kjetil Moløkken-Østvold","doi":"10.1109/QSIC.2007.31","DOIUrl":"https://doi.org/10.1109/QSIC.2007.31","url":null,"abstract":"It is frequently suggested that using experience data, estimation models and checklists can increase software effort estimation accuracy. However, there has been limited empirical research on the subject. We conducted a study of eighteen of the latest projects of a software contractor. Quantitative and qualitative data was collected on several issues related to estimates, key project properties, and project outcome. It was found that in projects where experience data was utilized in the estimation process, they experienced a lesser magnitude of effort overruns. The use of a checklist also appeared to increase estimation accuracy. However, the utilization of an estimation model did not appear to have a substantial impact.","PeriodicalId":136227,"journal":{"name":"Seventh International Conference on Quality Software (QSIC 2007)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129036752","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}
{"title":"Alternative B-Sequences","authors":"Lihua Duan, Jessica Chen","doi":"10.1109/QSIC.2007.12","DOIUrl":"https://doi.org/10.1109/QSIC.2007.12","url":null,"abstract":"When an implementation under test (IUT) is state-based, and its expected abstract behavior is given in terms of a finite state machine (FSM), a checking sequence generated from the specification FSM and applied on the lUTfor testing can provide us with high-level confidence in the correct functional behavior of our implementation. One of the issues here is to generate efficient checking sequences in terms of their lengths. In this paper, we discuss the possibility of reducing the lengths of checking sequences by making use of the invertible transitions in the specification FSM to increase the choice of betasequences to be included into a checking sequence. We present a sufficient condition for adopting alternative beta-sequences and illustrate a possible way of incorporating these alternative beta-sequences into existing methods for checking sequence generation to further reduce their lengths.","PeriodicalId":136227,"journal":{"name":"Seventh International Conference on Quality Software (QSIC 2007)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131689994","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}
{"title":"Nondeterministic Testing with Linear Model-Checker Counterexamples","authors":"G. Fraser, F. Wotawa","doi":"10.1109/QSIC.2007.38","DOIUrl":"https://doi.org/10.1109/QSIC.2007.38","url":null,"abstract":"In model-based testing, software test-cases are derived from a formal specification. A popular technique is to use traces created by a model-checker as test-cases. This approach is fully automated and flexible with regard to the structure and type of test-cases. Nondeterministic models, however, pose a problem to testing with model-checkers. Even though a model-checker is able to cope with nondeterminism, the traces it returns make commitments at non- deterministic transitions. If a resulting test-case is executed on an implementation that takes a different, valid transition at such a nondeterministic choice, then the test-case would erroneously detect a fault. This paper discusses the extension of available model-checker based test-case generation methods so that the problem of nondeterminism can be overcome.","PeriodicalId":136227,"journal":{"name":"Seventh International Conference on Quality Software (QSIC 2007)","volume":"170 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122974606","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}
{"title":"Test Case Prioritization Based on Varying Testing Requirement Priorities and Test Case Costs","authors":"Xiaofang Zhang, Changhai Nie, Baowen Xu, Bo Qu","doi":"10.1109/QSIC.2007.57","DOIUrl":"https://doi.org/10.1109/QSIC.2007.57","url":null,"abstract":"Test case prioritization is an effective and practical technique in regression testing. It schedules test cases in order of precedence that increases their ability to meet some performance goals, such as code coverage, rate of fault detection. In previous work, the test case prioritization techniques and metrics usually assumed that testing requirement priorities and test case costs are uniform. In this paper, basing on varying testing requirement priorities and test case costs, we present a new, general test case prioritization technique and an associated metric. The case study illustrates that the rate of \"units-oftesting-requirement-priority-satisfied- per-unit-test-case-cost\" can be increased, and then the testing quality and customer satisfaction can be improved.","PeriodicalId":136227,"journal":{"name":"Seventh International Conference on Quality Software (QSIC 2007)","volume":"249 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123032449","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}
{"title":"Metrics and Evolution in Open Source Software","authors":"Young Lee, Jeong Yang, Kai-Hsiung Chang","doi":"10.1109/QSIC.2007.36","DOIUrl":"https://doi.org/10.1109/QSIC.2007.36","url":null,"abstract":"This paper presents an analysis of the evolution of an open source software system, JFreeChart, which is an open source charting library [1], based on its size, fan-in/out coupling, and cohesion metrics. We developed JamTool, a Java automated measurement tool [4] to obtain the metrics and to observe the quality change along the evolution of the twenty-two released versions of JFreeChart. The empirical study clearly indicates that there are positive relations between the number of classes and the fan-in/out coupling, and the added class group has better software quality than the removed class group. Moreover, the experimental results follow Lehman's 1st, 2nd, 6th laws 6th but against 7th law of software evolution.","PeriodicalId":136227,"journal":{"name":"Seventh International Conference on Quality Software (QSIC 2007)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121008226","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}
{"title":"Reduction of Complexity and Automation of Parallel Execution through Loop Level Parallelism","authors":"Robert A. Tefft, R. Lee","doi":"10.1109/QSIC.2007.45","DOIUrl":"https://doi.org/10.1109/QSIC.2007.45","url":null,"abstract":"SIMD (single instruction multiple data) is a processor architecture classification from Flynn's taxonomy. The concept is that a single instruction set operates on multiple units of data simultaneously. Computers use this processor architecture are known as array processors or vector processors. Most computers in use today are SISD (single instruction single data) though allowing a single instruction to operate on multiple data can also be applied to a virtual machine that is capable of parallel execution through the use of multi-threading/multi-core processors, or distributed parallel execution on a multi-computer grid. This paper proposes a language structure that applies the SIMD concept to the Java virtual machine. The motive is to reduce the complexity of the code and ease implementation of parallelization by running a single set of instructions concurrently on an entire collection of objects.","PeriodicalId":136227,"journal":{"name":"Seventh International Conference on Quality Software (QSIC 2007)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116874852","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}
{"title":"Towards Automatic Measurement of Probabilistic Processes","authors":"Lin Song, Yuxin Deng, Xiaojuan Cai","doi":"10.1109/QSIC.2007.65","DOIUrl":"https://doi.org/10.1109/QSIC.2007.65","url":null,"abstract":"In this paper we propose a metric for finite processes in a probabilistic extension of CSP. The kernel of the metric corresponds to trace equivalence and most of the operators in the process algebra is shown to satisfy non-expansiveness property with respect to this metric. We also provide an algorithm to calculate the distance between two processes to a prescribed discount factor in polynomial time. The algorithm has been implemented in a tool that helps us to measure processes automatically.","PeriodicalId":136227,"journal":{"name":"Seventh International Conference on Quality Software (QSIC 2007)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126909712","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}
{"title":"Abstraction in Assertion-Based Test Oracles","authors":"Yoonsik Cheon","doi":"10.1109/QSIC.2007.10","DOIUrl":"https://doi.org/10.1109/QSIC.2007.10","url":null,"abstract":"Assertions can be used as test oracles. However, writing effective assertions of right abstraction levels is difficult because on the one hand, detailed assertions are preferred for thorough testing (i.e., to detect as many errors as possible), but on the other hand abstract assertions are preferred for readability, maintainability, and reusability. As assertions become a practical tool for testing and debugging programs, this is an important and practical problem to solve for the effective use of assertions. We advocate the use of model variables - specification-only variables of which abstract values are given as mappings from concrete program states - to write abstract assertions for test oracles. We performed a mutation testing experiment to evaluate the effectiveness of the use of model variables in assertion-based test oracles. According to our experiment, assertions written in terms of model variables are as effective as assertions written without using model variables in detecting (injected) faults, and the execution time overhead of model variables are negligible. Our findings are applicable to other use of runtime checkable assertions.","PeriodicalId":136227,"journal":{"name":"Seventh International Conference on Quality Software (QSIC 2007)","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131886428","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}
Jangbok Kim, Kyunghee Choi, D. Hoffman, Gihyun Jung
{"title":"White Box Pairwise Test Case Generation","authors":"Jangbok Kim, Kyunghee Choi, D. Hoffman, Gihyun Jung","doi":"10.1109/QSIC.2007.71","DOIUrl":"https://doi.org/10.1109/QSIC.2007.71","url":null,"abstract":"Pairwise testing is an intuitive approach to test case generation, and has already seen use in commercial tools and practical applications. Pairwise testing is black box, in the sense that the test selection is independent of the internal structure of the system. We present a white box extension which selects additional test cases for the system based on specifications for one or more internal sub- operations. We have developed a novel algorithm for generating test cases for the full system which achieve pairwise coverage of the sub-operations. We have evaluated the algorithm using a case study, which indicates the practicality and effectiveness of the approach.","PeriodicalId":136227,"journal":{"name":"Seventh International Conference on Quality Software (QSIC 2007)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133916249","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}