{"title":"A Measurement-Driven Process Model for Managing Inconsistent Software Requirements","authors":"K. Mu, Zhi Jin, D. Zowghi","doi":"10.1109/APSEC.2008.24","DOIUrl":"https://doi.org/10.1109/APSEC.2008.24","url":null,"abstract":"Inconsistency is a pervasive issue in software engineering. Both general rules of inconsistency management and special case-based approaches to handling inconsistency have recently been considered. In this paper, we present a process model for handling requirements inconsistency within the viewpoints framework. In this process model, when an inconsistency among viewpoints is detected, a set of candidate proposals for handling inconsistency will be generated using techniques from multi-agent automated negotiations. The proposals are then prioritized using an integrated measurement of inconsistencies. The viewpoints involved in the inconsistency will then enter the negotiations by being presented with the candidate proposals and thus selecting an acceptable proposal based on the priorities associated with each candidate proposal. To facilitate usability, in our process, we assume that the natural language requirements statements are first translated into corresponding logical formulas using a translator software. Moreover, the candidate proposals for handling inconsistency are also translated back from formal logic into natural language before being presented for selection.","PeriodicalId":218839,"journal":{"name":"2008 15th Asia-Pacific Software Engineering Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130843364","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":"Modeling and Verifying Web Browser Interactions","authors":"Shengbo Chen, Huai-kou Miao, Zhong-sheng Qian","doi":"10.1109/APSEC.2008.34","DOIUrl":"https://doi.org/10.1109/APSEC.2008.34","url":null,"abstract":"Web applications can only be accessed through dedicated client systems called Web browsers. Most current Web browsers offer many tools or facilities for Web page revisiting, including the back and forward buttons, refresh, favorites, link menu and history lists etc. Users can press the back or forward buttons to negatively influence the behaviors of Web application navigation. Existing navigation models are static ones on the whole. Userspsila navigation paths are all determined on stage of model design. Web browser interactions have not been taken into account make them difference from practical navigation in Web applications. Accordingly, special care is taken on Web browser interactions during the userpsilas traversal within hypermedia space. We give out the concept of safety critical region (SCR) and propose an approach to modeling on-the-fly navigation models. The Kripke structure is employed to describe the on-the-fly navigation models. Coverage criteria of Web browser inter-actions, such as, node coverage, transition coverage triggered by actions, SCR coverage, are exploited to derive the properties of Web browser interactions in CTL. Ultimately, we use SMV, the model checking tool, to verify the on-the-fly navigation models.","PeriodicalId":218839,"journal":{"name":"2008 15th Asia-Pacific Software Engineering Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131256561","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":"Detecting Occurrences of Refactoring with Heuristic Search","authors":"Shinpei Hayashi, Yasuyuki Tsuda, M. Saeki","doi":"10.1109/APSEC.2008.9","DOIUrl":"https://doi.org/10.1109/APSEC.2008.9","url":null,"abstract":"This paper proposes a novel technique to detect the occurrences of refactoring from a version archive, in order to reduce the effort spent in understanding what modifications have been applied. In a real software development process, a refactoring operation may sometimes be performed together with other modifications at the same revision. This means that understanding the differences between two versions stored in the archive is not usually an easily process. In order to detect these impure refactorings, we model the detection within a graph search. Our technique considers a version of a program as a state and a refactoring as a transition. It then searches for the path that approaches from the initial to the final state. To improve the efficiency of the search, we use the source code differences between the current and the final state for choosing the candidates of refactoring to be applied next and estimating the heuristic distance to the final state. We have clearly demonstrated the feasibility of our approach through a case study.","PeriodicalId":218839,"journal":{"name":"2008 15th Asia-Pacific Software Engineering Conference","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133779624","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":"Beyond Agile: Smart","authors":"I. Jacobson","doi":"10.1109/APSEC.2008.77","DOIUrl":"https://doi.org/10.1109/APSEC.2008.77","url":null,"abstract":"Summary form only given. One of the most popular buzzwords in software development is agile. Today everyone wants to be agile. That is good! However, being agile is not enough. For several years Dr. Ivar Jacobson has expressed that the most important character you need to have to be a great software developer is to be smart. What does that mean? Most people know intuitively what does it mean for software. In this session, Dr. Ivar Jacobson will describe what it means to be smart when it comes to developing software from requirements through to deployment.","PeriodicalId":218839,"journal":{"name":"2008 15th Asia-Pacific Software Engineering Conference","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121916865","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 Unanticipated Runtime Adaptation of Java Applications","authors":"M. Pukall, Christian Kästner, G. Saake","doi":"10.1109/APSEC.2008.66","DOIUrl":"https://doi.org/10.1109/APSEC.2008.66","url":null,"abstract":"Modifying an application usually means to stop the application, apply the changes, and start the application again. That means, the application is not available for at least a short time period. This is not acceptable for highly available applications. One reasonable approach which faces the problem of unavailability is to change highly available applications at runtime. To allow extensive runtime adaptation the application must be enabled for unanticipated changes even of already executed program parts. This is due to the fact that it is not predictable what changes become necessary and when they have to be applied. Since Java is commonly used for developing highly available applications, we discuss its shortcomings and opportunities regarding unanticipated runtime adaptation. We present an approach based on Java HotSwap and object wrapping which overcomes the identified shortcomings and evaluate it in a case study.","PeriodicalId":218839,"journal":{"name":"2008 15th Asia-Pacific Software Engineering Conference","volume":"247 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124657567","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":"Model Checking Process with Goal Oriented Requirements Analysis","authors":"H. Ogawa, Fumihiro Kumeno, S. Honiden","doi":"10.1109/APSEC.2008.71","DOIUrl":"https://doi.org/10.1109/APSEC.2008.71","url":null,"abstract":"Model checking is a powerful technique for verifying the correctness of a systempsilas specification. But even when the specification has been verified to be correct, there is still the question of whether the specification covers all the expected behaviors. One of the most important issues for verification is the sufficiency of verification items. In model checking, specification-level properties such as reachability are well-studied, but the sufficiency of a specification against the preceding requirements still remains a challenge.In this paper, we propose a model-checking process with goal oriented requirements analysis, in which goal descriptions in a natural language are systematically refined into linear temporal logic formulae. Furthermore, the coverage of the verification result can be evaluated against the goal model. We developed a tool that supports the process, and applied it to an example. This process lowers the technical barriers to model checking and improves the sufficiency of system verification.","PeriodicalId":218839,"journal":{"name":"2008 15th Asia-Pacific Software Engineering Conference","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127970592","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}
J. Estublier, Germán Vega, P. Lalanda, Thomas Leveque
{"title":"Domain Specific Engineering Environments","authors":"J. Estublier, Germán Vega, P. Lalanda, Thomas Leveque","doi":"10.1109/APSEC.2008.16","DOIUrl":"https://doi.org/10.1109/APSEC.2008.16","url":null,"abstract":"Computer aided software engineering tools represent one the main successes of software engineering in the past decades. They however need to be improved along several dimensions in order to face new challenges due to ever more complex applications, more heterogeneous technologies and more stakeholders involved. In this paper, we present an approach based on the concept of domain. We define a domain as an area in which a number of stakeholders is repeatedly performing similar activities. In a project, an arbitrary number of domains can be identified, being business, technical, or related to life cycle activities. In our metamodel-based approach, any domain can be easily modelled and the corresponding computer aided domain specific engineering environment (CADSE) can be generated. Using CADSE composition, complete and wide scope engineering environments can be built as a composition of an arbitrary number of domains. The paper presents the approach, the technology and draws a few lessons of the first years of use in a number of real projects.","PeriodicalId":218839,"journal":{"name":"2008 15th Asia-Pacific Software Engineering Conference","volume":"14 10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131057018","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":"Management of Composites in Software Engineering Environments","authors":"J. Estublier, Germán Vega, Thomas Leveque","doi":"10.1109/APSEC.2008.17","DOIUrl":"https://doi.org/10.1109/APSEC.2008.17","url":null,"abstract":".Design and development scalability, in any engineering, requires information hiding and a specific composition mechanism in which composite items are made-up of other items. This paper shows that scalability is currently ill supported and that software engineering composites are rather special with respect to other engineering disciplines. Indeed, a software engineering composite is simultaneously a model element, an engineering artifacts and a real object, which is unprecedented in the history of engineering. This paper analyzes the requirements that composites must satisfy in order to support scalability in software engineering. We have developed CADSE (Computer Aided Domain Specific Environment) in which composites are first class elements from which workspaces, concurrent engineering and view point support are provided. The paper discusses our experience with using the proposed system over the last years.","PeriodicalId":218839,"journal":{"name":"2008 15th Asia-Pacific Software Engineering Conference","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128100175","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":"Emergent Properties in Reactive Systems","authors":"M. Aiguier, P. L. Gall, M. Mabrouki","doi":"10.1109/APSEC.2008.28","DOIUrl":"https://doi.org/10.1109/APSEC.2008.28","url":null,"abstract":"Reactive systems are often described by interconnecting sub-components along architectural connectors defining communication policies. Generally, such global systems may exhibit properties, often called \"emergent properties\", that cannot be anticipated just from a complete knowledge of components. These emergent properties are twofold: (1) the global system can question properties attached to components; (2) some global properties cannot be inferred only from a complete knowledge of components, but for being inferred, need the knowledge of cooperation mechanisms between components. In practice, properties of the second form combine knowledge inherited from components. Thus, they are often defined in a richer language than the ones associated to each component and the presence of such emergent properties is quite natural. In this paper, we restrict ourselves to reactive systems described by means of transition systems as components and of the usual synchronous product as architectural connector and whose behavior is expressed by logical properties over a modal first-order logic. In this framework, we propose to study complexity of reactive systems through this notion of emergent properties and we will give some conditions to guarantee when a system has not emergent properties of the first form.","PeriodicalId":218839,"journal":{"name":"2008 15th Asia-Pacific Software Engineering Conference","volume":"130 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123434006","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":"Detection of Diverse Design Pattern Variants","authors":"K. Stencel, P. Wegrzynowicz","doi":"10.1109/APSEC.2008.67","DOIUrl":"https://doi.org/10.1109/APSEC.2008.67","url":null,"abstract":"We propose a method for automatic detection of occurrences of design patterns. We also describe its proof-of-concept implementation and the results of comparative experiments with other tools. The method presented here is able to detect many nonstandard implementation variants of design patterns, while its efficiency is comparable to other state-of-the-art detection tools. Moreover, the method is highly customizable because an analyst can introduce a new pattern retrieval query or modify an existing one and then repeat the detection using the results of earlier source code analysis stored in a relational database.","PeriodicalId":218839,"journal":{"name":"2008 15th Asia-Pacific Software Engineering Conference","volume":"402 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129183835","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}