There are a number of conflicting forces between short- and long-term considerations for software release planning in industry. For example, from a business perspective it is usually desired with a short time-to-market. However, from software quality perspective it is usually desired to have a longer time-to-market such that the proper architectural mechanisms can be put in place, which in the long-term reduce development cost and addresses quality aspects. In this paper we outline some of these conflicting forces, with a focus on long-lived systems, and examplify how they impact product quality and time-to-market. In this paper we propose a simple, but useful, extension of the release planning process that addresses these conflicting forces. The method is inspired from empirical data captured in a multiple case study involving 7 companies.
{"title":"A Method for Balancing Short- and Long-Term Investments: Quality vs. Features","authors":"M. Lindgren, Anders Wall, R. Land, C. Norström","doi":"10.1109/SEAA.2008.22","DOIUrl":"https://doi.org/10.1109/SEAA.2008.22","url":null,"abstract":"There are a number of conflicting forces between short- and long-term considerations for software release planning in industry. For example, from a business perspective it is usually desired with a short time-to-market. However, from software quality perspective it is usually desired to have a longer time-to-market such that the proper architectural mechanisms can be put in place, which in the long-term reduce development cost and addresses quality aspects. In this paper we outline some of these conflicting forces, with a focus on long-lived systems, and examplify how they impact product quality and time-to-market. In this paper we propose a simple, but useful, extension of the release planning process that addresses these conflicting forces. The method is inspired from empirical data captured in a multiple case study involving 7 companies.","PeriodicalId":127633,"journal":{"name":"2008 34th Euromicro Conference Software Engineering and Advanced Applications","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125224429","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}
This paper introduces a novel method and a prototype tool for the resource monitoring of OSGi-based software components. The OSGi Service Platform enables the cooperation of multiple Java based components within a single Java Virtual Machine (JVM), introducing challenges for resource monitoring as the JVM conceals the resource consumption information of separate OSGi components. When addressing this challenge as a research problem, a method based on arranging execution threads of components to separate groups is presented. The presented method and prototype tool enable the identification of the resource consumption of individual accountable components executed within a single JVM. The prototype monitoring tool is used for validating the presented resource monitoring method and is also overviewed in this paper, providing an insight view to the JVM from a resource consumption perspective.
{"title":"A Method for the Resource Monitoring of OSGi-based Software Components","authors":"Tuukka Miettinen, D. Pakkala, M. Hongisto","doi":"10.1109/SEAA.2008.24","DOIUrl":"https://doi.org/10.1109/SEAA.2008.24","url":null,"abstract":"This paper introduces a novel method and a prototype tool for the resource monitoring of OSGi-based software components. The OSGi Service Platform enables the cooperation of multiple Java based components within a single Java Virtual Machine (JVM), introducing challenges for resource monitoring as the JVM conceals the resource consumption information of separate OSGi components. When addressing this challenge as a research problem, a method based on arranging execution threads of components to separate groups is presented. The presented method and prototype tool enable the identification of the resource consumption of individual accountable components executed within a single JVM. The prototype monitoring tool is used for validating the presented resource monitoring method and is also overviewed in this paper, providing an insight view to the JVM from a resource consumption perspective.","PeriodicalId":127633,"journal":{"name":"2008 34th Euromicro Conference Software Engineering and Advanced Applications","volume":"219 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116761929","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}
In this exploratory case study, effort distribution visualizations of industrial software development projects are made in order to assess to what extent patterns can be found that describe the nature of the distribution of effort. The visualization of effort distributions of two rational unified process (RUP) projects are presented and discussed. Data was collected from hour registration systems, visualized in the image of the RUP 'hump' chart and analyzed for striking features or abnormalities. Senior project team members were confronted with the analysis in order to verify the findings. Although the visualizations show interesting patterns, they cannot be interpreted without context information. The visualizations were evaluated to be a useful addition to project post-mortem analysis.
{"title":"Evaluating RUP Software Development Processes Through Visualization of Effort Distribution","authors":"W. Heijstek, M. Chaudron","doi":"10.1109/SEAA.2008.43","DOIUrl":"https://doi.org/10.1109/SEAA.2008.43","url":null,"abstract":"In this exploratory case study, effort distribution visualizations of industrial software development projects are made in order to assess to what extent patterns can be found that describe the nature of the distribution of effort. The visualization of effort distributions of two rational unified process (RUP) projects are presented and discussed. Data was collected from hour registration systems, visualized in the image of the RUP 'hump' chart and analyzed for striking features or abnormalities. Senior project team members were confronted with the analysis in order to verify the findings. Although the visualizations show interesting patterns, they cannot be interpreted without context information. The visualizations were evaluated to be a useful addition to project post-mortem analysis.","PeriodicalId":127633,"journal":{"name":"2008 34th Euromicro Conference Software Engineering and Advanced Applications","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125085904","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}
To determine the potential signaling traffic reductions, the session establishment procedures were investigated. The investigation showed that, the S-CSCF (serving call session control function) is the major bottleneck in IMS (IP multimedia subsystem) network. And then the modeling of 3GPP (3rd Generation Partnership Project) service triggering algorithm (STA) in IMS was presented. The session setup delay was employed as the measurement to investigate the performance of the ATA (application triggering architecture) and S-CSCF. Analytical results showed that, the number of the ASs, the use of the subsequent filter criteria (sFC) and the arrival rate have heavy impact on the session setup delay. The results will be useful in constructing IMS network. At last, we proposed several possible solutions to reduce the session setup delay decrease the load of the S- CSCF and improves the QoS (quality of service) of IMS network.
{"title":"On Performance of 3GPP Service Triggering Mechanism in IMS Network","authors":"Zhaoyong Xun, J. Liao, Xiaomin Zhu","doi":"10.1109/SEAA.2008.20","DOIUrl":"https://doi.org/10.1109/SEAA.2008.20","url":null,"abstract":"To determine the potential signaling traffic reductions, the session establishment procedures were investigated. The investigation showed that, the S-CSCF (serving call session control function) is the major bottleneck in IMS (IP multimedia subsystem) network. And then the modeling of 3GPP (3rd Generation Partnership Project) service triggering algorithm (STA) in IMS was presented. The session setup delay was employed as the measurement to investigate the performance of the ATA (application triggering architecture) and S-CSCF. Analytical results showed that, the number of the ASs, the use of the subsequent filter criteria (sFC) and the arrival rate have heavy impact on the session setup delay. The results will be useful in constructing IMS network. At last, we proposed several possible solutions to reduce the session setup delay decrease the load of the S- CSCF and improves the QoS (quality of service) of IMS network.","PeriodicalId":127633,"journal":{"name":"2008 34th Euromicro Conference Software Engineering and Advanced Applications","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133408629","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}
A synchronized time base is indispensable for a time- triggered system since all activities in such a system are triggered by the passage of time. Distributed fault-tolerant clock synchronization algorithms are normally used to achieve the synchronized time base. As a state-of-the-art representative of the time-triggered systems for automotive applications, FlexRay uses a fault-tolerant mid-point algorithm to achieve the synchronized time base. Correctness of the algorithm plays a crucial role as most of the protocol services rely on the fact that there exists a synchronized time base in the system. Due to the distinguished characteristics of the algorithm, we propose a case-analysis based technique for the formal analysis of the algorithm. We show that the case analysis technique can greatly facilitate our formal analysis of the algorithm. Mechanical support with Isabelle/HOL, a theorem prover, is also discussed.
{"title":"Formal Analysis of a Distributed Fault Tolerant Clock Synchronization Algorithm for Automotive Communication Systems","authors":"Bo Zhang","doi":"10.1109/SEAA.2008.48","DOIUrl":"https://doi.org/10.1109/SEAA.2008.48","url":null,"abstract":"A synchronized time base is indispensable for a time- triggered system since all activities in such a system are triggered by the passage of time. Distributed fault-tolerant clock synchronization algorithms are normally used to achieve the synchronized time base. As a state-of-the-art representative of the time-triggered systems for automotive applications, FlexRay uses a fault-tolerant mid-point algorithm to achieve the synchronized time base. Correctness of the algorithm plays a crucial role as most of the protocol services rely on the fact that there exists a synchronized time base in the system. Due to the distinguished characteristics of the algorithm, we propose a case-analysis based technique for the formal analysis of the algorithm. We show that the case analysis technique can greatly facilitate our formal analysis of the algorithm. Mechanical support with Isabelle/HOL, a theorem prover, is also discussed.","PeriodicalId":127633,"journal":{"name":"2008 34th Euromicro Conference Software Engineering and Advanced Applications","volume":"38 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133729950","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}
Current software component models lack compositionality. Most of them also do not have both active and passive components. In this paper, we show how we can define a compositional approach to active and passive components. We define these components in such a way that their composition can be defined by explicit composition operators. Our approach not only achieves compositionality, but also enables systematic or hierarchical composition.
{"title":"A Compositional Approach to Active and Passive Components","authors":"K. Lau, Ioannis Ntalamagkas","doi":"10.1109/SEAA.2008.39","DOIUrl":"https://doi.org/10.1109/SEAA.2008.39","url":null,"abstract":"Current software component models lack compositionality. Most of them also do not have both active and passive components. In this paper, we show how we can define a compositional approach to active and passive components. We define these components in such a way that their composition can be defined by explicit composition operators. Our approach not only achieves compositionality, but also enables systematic or hierarchical composition.","PeriodicalId":127633,"journal":{"name":"2008 34th Euromicro Conference Software Engineering and Advanced Applications","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116367114","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}
Dynamic Spectrum Access allows the cognitive radio to use or share the spectrum in an opportunistic manner, which improves the efficiency of spectrum usage. In this research, we first present a theoretic framework and its process flow as a possible future scenario. Then we describe our empirical studies of price formation in cognitive radio networks. Our proposed pricing model describes the interaction between competing Application Service Providers, service broker and end users. We use game theory as a mathematical basis for the analysis of interactive decision-making process among the actors of the given telecommunication market. The empirical studies show that the end users do not always prefer a service provider with the cheapest unit price, but their decisions also depend on the received QoS level. The Nash equilibrium tells the service provider the ideal point where profit is maximized at the highest level of customer satisfaction.
{"title":"Business Model Specific Charging Mechanism in Cognitive Radio","authors":"G. Alptekin, A. Bener","doi":"10.1109/SEAA.2008.73","DOIUrl":"https://doi.org/10.1109/SEAA.2008.73","url":null,"abstract":"Dynamic Spectrum Access allows the cognitive radio to use or share the spectrum in an opportunistic manner, which improves the efficiency of spectrum usage. In this research, we first present a theoretic framework and its process flow as a possible future scenario. Then we describe our empirical studies of price formation in cognitive radio networks. Our proposed pricing model describes the interaction between competing Application Service Providers, service broker and end users. We use game theory as a mathematical basis for the analysis of interactive decision-making process among the actors of the given telecommunication market. The empirical studies show that the end users do not always prefer a service provider with the cheapest unit price, but their decisions also depend on the received QoS level. The Nash equilibrium tells the service provider the ideal point where profit is maximized at the highest level of customer satisfaction.","PeriodicalId":127633,"journal":{"name":"2008 34th Euromicro Conference Software Engineering and Advanced Applications","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124884629","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}
Content management systems (CMSs) are critical software platforms for the success of organizational web sites and intranets. Although most current CMS systems allow their extension through the addition of modules/components, such modules are usually relatively static, allowing only the configuration of certain parameters that constrain some aspects of their presentation.This paper presents the architecture of WebComfort, a dynamic component-based CMS platform which allows users to manage and operate complex web applications in a dynamic and integrated fashion. The major technical details of this system are described in this paper, such as modules, toolkits, the data repository access, and the WebComfort API.
{"title":"The WebComfort Framework: An Extensible Platform for the Development of Web Applications","authors":"J. Saraiva, A. Silva","doi":"10.1109/SEAA.2008.12","DOIUrl":"https://doi.org/10.1109/SEAA.2008.12","url":null,"abstract":"Content management systems (CMSs) are critical software platforms for the success of organizational web sites and intranets. Although most current CMS systems allow their extension through the addition of modules/components, such modules are usually relatively static, allowing only the configuration of certain parameters that constrain some aspects of their presentation.This paper presents the architecture of WebComfort, a dynamic component-based CMS platform which allows users to manage and operate complex web applications in a dynamic and integrated fashion. The major technical details of this system are described in this paper, such as modules, toolkits, the data repository access, and the WebComfort API.","PeriodicalId":127633,"journal":{"name":"2008 34th Euromicro Conference Software Engineering and Advanced Applications","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128221252","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}
Non-functional requirements (NFRs) pose unique challenges in estimating the effort it would take to implement them. This is mainly because of their unique nature; NFRs are subjective, relative, interactive and tending to have a broad impact on the system as a whole. Nevertheless, it is crucial, when making decisions about the scope of software by given resources and budget, to furnish a justifying and quantitative analysis based on both functional requirements (FRs) and NFRs. This paper presents a meta-model which complements the FR dimension with the NFRs as another dimension to be used in effort estimation approaches. The meta-model is deployed to extend the use of the COSMIC functional size measurement method to measure the size of NFRs, as effort is a function of size. We report on a case study to demonstrate our approach in context.
{"title":"A Meta-model for the Assessment of Non-Functional Requirement Size","authors":"M. Kassab, M. Daneva, O. Ormandjieva","doi":"10.1109/SEAA.2008.58","DOIUrl":"https://doi.org/10.1109/SEAA.2008.58","url":null,"abstract":"Non-functional requirements (NFRs) pose unique challenges in estimating the effort it would take to implement them. This is mainly because of their unique nature; NFRs are subjective, relative, interactive and tending to have a broad impact on the system as a whole. Nevertheless, it is crucial, when making decisions about the scope of software by given resources and budget, to furnish a justifying and quantitative analysis based on both functional requirements (FRs) and NFRs. This paper presents a meta-model which complements the FR dimension with the NFRs as another dimension to be used in effort estimation approaches. The meta-model is deployed to extend the use of the COSMIC functional size measurement method to measure the size of NFRs, as effort is a function of size. We report on a case study to demonstrate our approach in context.","PeriodicalId":127633,"journal":{"name":"2008 34th Euromicro Conference Software Engineering and Advanced Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128976686","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}
Some size measures have been proposed in the literature to be employed in estimating Web application development effort, but to date few empirical studies have been undertaken to validate them and compare their effectiveness. To address this issue we have performed an empirical study by using as size measures COSMIC and Web Objects, with the aim of verifying their effectiveness as indicators of development effort. In particular, we have built two effort estimation models by applying the Ordinary Least-Squares regression and by using a dataset of 15 Web applications developed by an italian software company. The performance of the obtained models have been evaluated by using a dataset of further 4 Web applications developed by the same software company some time after the first 15 Web applications. The results reveal that both Web Objects and COSMIC are good indicators of the development effort.
{"title":"A Case Study Using Web Objects and COSMIC for Effort Estimation of Web Applications","authors":"F. Ferrucci, C. Gravino, S. Martino","doi":"10.1109/SEAA.2008.60","DOIUrl":"https://doi.org/10.1109/SEAA.2008.60","url":null,"abstract":"Some size measures have been proposed in the literature to be employed in estimating Web application development effort, but to date few empirical studies have been undertaken to validate them and compare their effectiveness. To address this issue we have performed an empirical study by using as size measures COSMIC and Web Objects, with the aim of verifying their effectiveness as indicators of development effort. In particular, we have built two effort estimation models by applying the Ordinary Least-Squares regression and by using a dataset of 15 Web applications developed by an italian software company. The performance of the obtained models have been evaluated by using a dataset of further 4 Web applications developed by the same software company some time after the first 15 Web applications. The results reveal that both Web Objects and COSMIC are good indicators of the development effort.","PeriodicalId":127633,"journal":{"name":"2008 34th Euromicro Conference Software Engineering and Advanced Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130230466","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
扫码关注我们
求助内容：
应助结果提醒方式：