2008 ACM/IEEE 30th International Conference on Software Engineering最新文献

筛选
英文 中文
A case study evaluation of maintainability and performance of persistency techniques 一个评估可维护性和持久性技术性能的案例研究
2008 ACM/IEEE 30th International Conference on Software Engineering Pub Date : 2008-05-10 DOI: 10.1145/1368088.1368143
Thomas Goldschmidt, Ralf H. Reussner, Jochen Winzen
{"title":"A case study evaluation of maintainability and performance of persistency techniques","authors":"Thomas Goldschmidt, Ralf H. Reussner, Jochen Winzen","doi":"10.1145/1368088.1368143","DOIUrl":"https://doi.org/10.1145/1368088.1368143","url":null,"abstract":"Efforts for software evolution supersede any other part of the software life cycle. Technological decisions have a major impact on the maintainability, but are not well reflected by existing code or architecture based metrics. The way the persistency of object structures with relational databases is solved affects the maintainability of the overall system. Besides maintainability other quality attributes of the software are of interest, in particular performance metrics. However, a systematic evaluation of the benefits and drawback of different persistency frameworks is lacking. In this paper we systematically evaluate the maintainability and performance of different technological approaches for this mapping. The paper presents a testbed and an evaluation process with specifically designed metrics to evaluate persistency techniques regarding their maintainability and performance. In the second part we present and discuss the results of the case study.","PeriodicalId":367697,"journal":{"name":"2008 ACM/IEEE 30th International Conference on Software Engineering","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123741801","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}
引用次数: 16
Time-bounded adaptation for automotive system software 汽车系统软件的时域自适应
2008 ACM/IEEE 30th International Conference on Software Engineering Pub Date : 2008-05-10 DOI: 10.1145/1368088.1368166
S. Fritsch, A. Senart, D. Schmidt, S. Clarke
{"title":"Time-bounded adaptation for automotive system software","authors":"S. Fritsch, A. Senart, D. Schmidt, S. Clarke","doi":"10.1145/1368088.1368166","DOIUrl":"https://doi.org/10.1145/1368088.1368166","url":null,"abstract":"Software is increasingly deployed in vehicles as demand for new functionality increases and cheaper and more powerful hardware becomes available. Likewise, emerging wireless communication protocols allow the integration of new software into vehicles, thereby enabling time-bounded adaptive response to changes that occur in mobile environments. Examples of time-bounded adaptation include adaptive cruise control and the dynamic integration of location-aware services within fixed time bounds. This paper provides three contributions to the study of time-bounded adaptation for automotive system software. First, we categorise automotive systems with respect to requirements for dynamic software adaptation. Second, we define a taxonomy that captures various dimensions of dynamic adaptation in emerging automotive system software. Third, we use this taxonomy to analyse existing research projects in the automotive domain. Our analysis shows that although time-bounded synchronisation of applications and data is a key requirement for next-generation automotive systems, it is not adequately covered by existing work.","PeriodicalId":367697,"journal":{"name":"2008 ACM/IEEE 30th International Conference on Software Engineering","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114340079","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}
引用次数: 28
Existential live sequence charts revisited 重新审视了存在的现场序列图
2008 ACM/IEEE 30th International Conference on Software Engineering Pub Date : 2008-05-10 DOI: 10.1145/1368088.1368095
German E. Sibay, Sebastián Uchitel, V. Braberman
{"title":"Existential live sequence charts revisited","authors":"German E. Sibay, Sebastián Uchitel, V. Braberman","doi":"10.1145/1368088.1368095","DOIUrl":"https://doi.org/10.1145/1368088.1368095","url":null,"abstract":"Scenario-based specifications are a popular means for describing intended system behaviour. We aim to facilitate early analysis of system behaviour and the development of behaviour models in conjunction with scenarios. In this paper we define a novel scenario-based specification language with an existential semantics and that supports conditional specification of behaviour in the form of prechart and main chart. The language semantics is consistent with existing informal scenario-based and use-case based approaches to requirements engineering. The language provides a good fit with universal live sequence charts as standard existential live sequence charts do not adequately support conditional scenarios. In addition, we define a novel synthesis algorithm that, rather than building arbitrarily one of the many behaviour models that satisfy a scenario, constructs a modal transition system (MTS) which characterizes all behaviour models that conform to the scenario.","PeriodicalId":367697,"journal":{"name":"2008 ACM/IEEE 30th International Conference on Software Engineering","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122479755","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}
引用次数: 54
Automatic modularity conformance checking 自动模块化一致性检查
2008 ACM/IEEE 30th International Conference on Software Engineering Pub Date : 2008-05-10 DOI: 10.1145/1368088.1368144
Sunny Wong, Yuanfang Cai, Yuanyuan Song, K. Sullivan
{"title":"Automatic modularity conformance checking","authors":"Sunny Wong, Yuanfang Cai, Yuanyuan Song, K. Sullivan","doi":"10.1145/1368088.1368144","DOIUrl":"https://doi.org/10.1145/1368088.1368144","url":null,"abstract":"According to Parnas's information hiding principle and Baldwin and Clark's design rule theory, the key step to decomposing a system into modules is to determine the design rules (or in Parnas's terms, interfaces) that decouple otherwise coupled design decisions and to hide decisions that are likely to change in independent modules. Given a modular design, it is often difficult to determine whether and how its implementation realizes the designed modularity. Manually comparing code with abstract design is tedious and error-prone. We present an automated approach to check the conformance of implemented modularity to designed modularity, using design structure matrices as a uniform representation for both. Our experiments suggest that our approach has the potential to manifest the decoupling effects of design rules in code, and to detect modularity deviation caused by implementation faults. We also show that design and implementation models together provide a comprehensive view of modular structure that makes certain implicit dependencies within code explicit.","PeriodicalId":367697,"journal":{"name":"2008 ACM/IEEE 30th International Conference on Software Engineering","volume":"149 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117287157","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}
引用次数: 44
Systematically refactoring inheritance to delegation in java 在java中系统地重构继承到委托
2008 ACM/IEEE 30th International Conference on Software Engineering Pub Date : 2008-05-10 DOI: 10.1145/1368088.1368147
Hannes Kegel, F. Steimann
{"title":"Systematically refactoring inheritance to delegation in java","authors":"Hannes Kegel, F. Steimann","doi":"10.1145/1368088.1368147","DOIUrl":"https://doi.org/10.1145/1368088.1368147","url":null,"abstract":"Because of the strong coupling of classes and the proliferation of unneeded class members induced by inheritance, the suggestion to use composition and delegation instead has become common place. The presentation of a corresponding refactoring in the literature may lead one to believe that such a transformation is a straightforward undertaking. However, closer analysis reveals that this refactoring is neither always possible, nor does it necessarily achieve its desired effect. We have therefore identified the necessary preconditions and realizable postconditions of the refactoring, and built a tool that can perform it completely automatically. By applying this tool to all subclasses of several open-source projects, we have collected evidence of the applicability of the refactoring and of its capability to deliver on its promises. The refactoring builds on constraint graphs originally developed for type inference to check the preconditions and to compute the necessary delegation as well as the subtype relationships that must be maintained.","PeriodicalId":367697,"journal":{"name":"2008 ACM/IEEE 30th International Conference on Software Engineering","volume":"171 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116120389","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}
引用次数: 57
State extensions for java pathfinder java pathfinder的状态扩展
2008 ACM/IEEE 30th International Conference on Software Engineering Pub Date : 2008-05-10 DOI: 10.1145/1368088.1368224
Tihomir Gvero, Miloš Gligorić, Steven Lauterburg, Marcelo d’Amorim, D. Marinov, S. Khurshid
{"title":"State extensions for java pathfinder","authors":"Tihomir Gvero, Miloš Gligorić, Steven Lauterburg, Marcelo d’Amorim, D. Marinov, S. Khurshid","doi":"10.1145/1368088.1368224","DOIUrl":"https://doi.org/10.1145/1368088.1368224","url":null,"abstract":"Java PathFinder (JPF) is an explicit-state model checker for Java programs. JPF implements a backtrackable Java Virtual Machine (JVM) that provides non-deterministic choices and control over thread scheduling. JPF is itself implemented in Java and runs on top of a host JVM. JPF represents the JVM state of the program being checked and performs three main operations on this state representation: bytecode execution, state backtracking, and state comparison. This paper summarizes four extensions that we have developed to the JPF state representation and operations. One extension provides a new functionality to JPF, and three extensions improve performance of JPF in various scenarios. Some of our code has already been included in publicly available JPF.","PeriodicalId":367697,"journal":{"name":"2008 ACM/IEEE 30th International Conference on Software Engineering","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116741137","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}
引用次数: 13
Detecting model inconsistency through operation-based model construction 通过基于操作的模型构造检测模型不一致
2008 ACM/IEEE 30th International Conference on Software Engineering Pub Date : 2008-05-10 DOI: 10.1145/1368088.1368158
Xavier Blanc, Isabelle Mounier, Alix Mougenot, T. Mens
{"title":"Detecting model inconsistency through operation-based model construction","authors":"Xavier Blanc, Isabelle Mounier, Alix Mougenot, T. Mens","doi":"10.1145/1368088.1368158","DOIUrl":"https://doi.org/10.1145/1368088.1368158","url":null,"abstract":"Nowadays, large-scale industrial software systems may involve hundreds of developers working on hundreds of different but related models representing parts of the same system specification. Detecting and resolving structural inconsistencies between these models is then critical. In this article we propose to represent models by sequences of elementary construction operations, rather than by the set of model elements they contain. Structural and methodological consistency rules can then be expressed uniformly as logical constraints on such sequences. Our approach is meta-model independent, allowing us to deal with consistency between different models whatever their kind. We have validated our approach by building a Prolog engine that detects violations of structural and methodological constraints specified on UML 2.1 models and requirement models. This engine has been integrated into two contemporary UML-based modelling environments, Eclipse EMF and rational software architect (RSA).","PeriodicalId":367697,"journal":{"name":"2008 ACM/IEEE 30th International Conference on Software Engineering","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128073928","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}
引用次数: 185
Using JULE to generate a compliance test suite for the UML standard 使用JULE为UML标准生成遵从性测试套件
2008 ACM/IEEE 30th International Conference on Software Engineering Pub Date : 2008-05-10 DOI: 10.1145/1368088.1368212
P. Bunyakiati, A. Finkelstein, J. Skene, C. Chapman
{"title":"Using JULE to generate a compliance test suite for the UML standard","authors":"P. Bunyakiati, A. Finkelstein, J. Skene, C. Chapman","doi":"10.1145/1368088.1368212","DOIUrl":"https://doi.org/10.1145/1368088.1368212","url":null,"abstract":"The Java-UML Lightweight Enumerator (JULE) tool implements a vitally important aspect of the framework for software tool certification - test suite generation. The framework uses UML models as the test inputs for the bounded exhaustive-testing approach. Within a size bound for the metamodel types, JULE enumerates only the set of non-isomorphic models in the form of relational structures. These models are classified into two sets - demonstration and counterexample - using binary decision diagrams (BDDs). The power of JULE lies in its model enumeration and its use of a high-performance grid infrastructure. Hence, JULE efficiently generates a very small test suite while increasing the bound on the input size to the extent that is practical for certification purpose.","PeriodicalId":367697,"journal":{"name":"2008 ACM/IEEE 30th International Conference on Software Engineering","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116098947","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}
引用次数: 3
jPredictor jPredictor
2008 ACM/IEEE 30th International Conference on Software Engineering Pub Date : 2008-05-10 DOI: 10.1145/1368088.1368119
Feng Chen, Traian-Florin Serbanuta, Grigore Roşu
{"title":"jPredictor","authors":"Feng Chen, Traian-Florin Serbanuta, Grigore Roşu","doi":"10.1145/1368088.1368119","DOIUrl":"https://doi.org/10.1145/1368088.1368119","url":null,"abstract":"jPredictor is a tool for detecting concurrency errors in Java programs. The Java program is instrumented to emit property-relevant events at runtime and then executed. The resulting execution trace is collected and analyzed by Predictor, which extracts a causality relation sliced using static analysis and refined with lock-atomicity information. The resulting abstract model, a hybrid of a partial order and atomic blocks, is then exhaustively analyzed against the property and errors with counter-examples are reported to the user. Thus, jPredictor can \"predict\" errors that did not happen in the observed execution, but which could have happened under a different thread scheduling. The analysis technique employed in jPredictor is fully automatic, generic (works for any trace property), sound (produces no false alarms) but it is incomplete (may miss errors). Two common types of errors are investigated in this paper: dataraces and atomicity violations. Experiments show that jPredictor is precise (in its predictions), effective and efficient. After the code producing them was executed only once, jPredictor found all the errors reported by other tools. It also found errors missed by other tools, including static race detectors, as well as unknown errors in popular systems like Tomcat and the Apache FTP server.","PeriodicalId":367697,"journal":{"name":"2008 ACM/IEEE 30th International Conference on Software Engineering","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127082213","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}
引用次数: 133
Predicting defects using network analysis on dependency graphs 使用依赖图上的网络分析来预测缺陷
2008 ACM/IEEE 30th International Conference on Software Engineering Pub Date : 2008-05-10 DOI: 10.1145/1368088.1368161
Thomas Zimmermann, Nachiappan Nagappan
{"title":"Predicting defects using network analysis on dependency graphs","authors":"Thomas Zimmermann, Nachiappan Nagappan","doi":"10.1145/1368088.1368161","DOIUrl":"https://doi.org/10.1145/1368088.1368161","url":null,"abstract":"In software development, resources for quality assurance are limited by time and by cost. In order to allocate resources effectively, managers need to rely on their experience backed by code complexity metrics. But often dependencies exist between various pieces of code over which managers may have little knowledge. These dependencies can be construed as a low level graph of the entire system. In this paper, we propose to use network analysis on these dependency graphs. This allows managers to identify central program units that are more likely to face defects. In our evaluation on Windows Server 2003, we found that the recall for models built from network measures is by 10% points higher than for models built from complexity metrics. In addition, network measures could identify 60% of the binaries that the Windows developers considered as critical-twice as many as identified by complexity metrics.","PeriodicalId":367697,"journal":{"name":"2008 ACM/IEEE 30th International Conference on Software Engineering","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133081095","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}
引用次数: 552
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书