Tenth Asia-Pacific Software Engineering Conference, 2003.最新文献

筛选
英文 中文
Utilizing specification testing in review task trees for rigorous review of formal specifications 利用审查任务树中的规范测试来严格审查正式的规范
Tenth Asia-Pacific Software Engineering Conference, 2003. Pub Date : 2003-12-10 DOI: 10.1109/APSEC.2003.1254406
Shaoying Liu
{"title":"Utilizing specification testing in review task trees for rigorous review of formal specifications","authors":"Shaoying Liu","doi":"10.1109/APSEC.2003.1254406","DOIUrl":"https://doi.org/10.1109/APSEC.2003.1254406","url":null,"abstract":"Review task tree (RTT) is a comprehensible notation for expressing review tasks in rigorous review of formal specifications. It has a mechanism for evaluating the final review result based on the review results of all the members (atomic tasks) of its minimal cutset. However, the notation does not provide any method for actually reviewing the atomic tasks. We present a way to utilize a specification testing method for rigorous review of the atomic tasks. Strategies for generating test cases for each kind of RTT are described and explained with examples. A small case study is conducted using the proposed technique, and the result is analyzed to show the benefit and the potential limitation of the technique.","PeriodicalId":122752,"journal":{"name":"Tenth Asia-Pacific Software Engineering Conference, 2003.","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115761330","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}
引用次数: 12
A ontology-based process modelling for XP 基于本体的XP过程建模
Tenth Asia-Pacific Software Engineering Conference, 2003. Pub Date : 2003-12-10 DOI: 10.1109/APSEC.2003.1254376
P. Ceravolo, E. Damiani, M. Marchesi, S. Pinna, Francesco Zavatarelli
{"title":"A ontology-based process modelling for XP","authors":"P. Ceravolo, E. Damiani, M. Marchesi, S. Pinna, Francesco Zavatarelli","doi":"10.1109/APSEC.2003.1254376","DOIUrl":"https://doi.org/10.1109/APSEC.2003.1254376","url":null,"abstract":"We describe the Extreme Programming Ontology (XPO), a formal model specifying the main concepts used in the extreme programming methodology and their properties. XPO's modular structure was developed using the usual normative top down approach to software engineering process modeling. It relies on a set of core components rooted in three main concepts: organisational role, product and phase. Besides being useful for indexing relevant documents and XP artifacts such as user stories and Wiki pages, XPO is aimed at being a sound basis for nonintrusive analysis of agile processes, mining process data about programmers activity and repositories content in order to extract new concepts potentially identifying critical factors in agile software development. Extension to XPO are also discussed, including other agile methodologies and more general software engineering concepts.","PeriodicalId":122752,"journal":{"name":"Tenth Asia-Pacific Software Engineering Conference, 2003.","volume":"48 10","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113956791","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}
引用次数: 20
Understanding how the requirements are implemented in source code 了解如何在源代码中实现需求
Tenth Asia-Pacific Software Engineering Conference, 2003. Pub Date : 2003-12-10 DOI: 10.1109/APSEC.2003.1254359
Wei Zhao, Lu Zhang, Yin Liu, Jing Luo, Jiasu Sun
{"title":"Understanding how the requirements are implemented in source code","authors":"Wei Zhao, Lu Zhang, Yin Liu, Jing Luo, Jiasu Sun","doi":"10.1109/APSEC.2003.1254359","DOIUrl":"https://doi.org/10.1109/APSEC.2003.1254359","url":null,"abstract":"For software maintenance and evolution, a common problem is to understand how each requirement is implemented in the source code. The basic solution of this problem is to find the fragment of source code that is corresponding to the implementation of each requirement. This can be viewed as a requirement-slicing problem - slicing the source code according to each individual requirement. We present an approach to find the set of functions that is corresponding to each requirement. The main idea of our method is to combine the information retrieval technology with the static analysis of source code structures. First, we retrieve the initial function sets through some information retrieval model using functional requirements as the queries and identifier information (such as function names, parameter names, variable names etc.) of functions in the source code as target documents. Then we complement each retrieved initial function set by analyzing the call graph extracted from the source code. A premise of our approach is that programmers should use meaningful names as identifiers. Furthermore, we perform an experimental study based on a GNU system. We use two basic metrics: precision and recall (which are the common practice in the information retrieval field), to evaluate our approach. We also compare the results directly acquired from information retrieval with those that are complemented through static source code structure analysis.","PeriodicalId":122752,"journal":{"name":"Tenth Asia-Pacific Software Engineering Conference, 2003.","volume":"07 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115909185","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}
引用次数: 25
PAORE: package oriented requirements elicitation PAORE:面向包的需求引出
Tenth Asia-Pacific Software Engineering Conference, 2003. Pub Date : 2003-12-10 DOI: 10.1109/APSEC.2003.1254354
Junzou Kato, Morio Nagata, Shuichiro Yamamoto, M. Saeki, H. Kaiya, H. Horai, A. Ohnishi, S. Komiya, Kenji Watahiki
{"title":"PAORE: package oriented requirements elicitation","authors":"Junzou Kato, Morio Nagata, Shuichiro Yamamoto, M. Saeki, H. Kaiya, H. Horai, A. Ohnishi, S. Komiya, Kenji Watahiki","doi":"10.1109/APSEC.2003.1254354","DOIUrl":"https://doi.org/10.1109/APSEC.2003.1254354","url":null,"abstract":"We propose a new requirements elicitation method in the domains of ERP, CRM, and SCM by using specifications of several existing package software. We have analyzed the requirements elicitation processes of experienced analysts in a specific domain, and found that they clarify requirements by referring the specifications of existing packages that seem to be satisfied with customer's needs. This process can be formulated into two subprocesses: 1) package selection, where an analyst compares the customer's needs with functions/nonfunctions of packages and selects the suitable candidates of packages; and 2) requirements evolution, where he examines the selected packages with his customer and an approved part of specifications of packages are added into their requirements. The proposed method, called PAORE (package oriented requirements elicitation method) is designed based on the analysis. We applied this method to a simple but realistic example of Web-based sales supporting system and assessed it.","PeriodicalId":122752,"journal":{"name":"Tenth Asia-Pacific Software Engineering Conference, 2003.","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130441272","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}
引用次数: 23
Implementing angelic nondeterminism 实现天使的不确定性
Tenth Asia-Pacific Software Engineering Conference, 2003. Pub Date : 2003-12-10 DOI: 10.1109/APSEC.2003.1254370
O. Celiku, Joakim von Wright
{"title":"Implementing angelic nondeterminism","authors":"O. Celiku, Joakim von Wright","doi":"10.1109/APSEC.2003.1254370","DOIUrl":"https://doi.org/10.1109/APSEC.2003.1254370","url":null,"abstract":"We extend correctness and refinement reasoning methods in order to show how angelic nondeterminism can be systematically transformed into demonic nondeterminism or determinism. This kind of transformation is important because angelic nondeterminism assumes that an agent interested in establishing the postcondition will resolve the choices intelligently. When angelic nondeterminism is reduced into demonic nondeterminism or determinism, such intelligent choices are no longer necessary. Reducing angelic nondeterminism is generally not a refinement; however, when context is taken into consideration, it can be a correctness-preserving transformation.","PeriodicalId":122752,"journal":{"name":"Tenth Asia-Pacific Software Engineering Conference, 2003.","volume":"369 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134217216","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}
引用次数: 10
Implementing exception handling policies for workflow management system 实现工作流管理系统的异常处理策略
Tenth Asia-Pacific Software Engineering Conference, 2003. Pub Date : 2003-12-10 DOI: 10.1109/APSEC.2003.1254411
Jinmiao Li, Y. Mai, Greg Butler
{"title":"Implementing exception handling policies for workflow management system","authors":"Jinmiao Li, Y. Mai, Greg Butler","doi":"10.1109/APSEC.2003.1254411","DOIUrl":"https://doi.org/10.1109/APSEC.2003.1254411","url":null,"abstract":"Exceptions are deviations from the normal execution of the program. They occur frequently in programs. In modern programming languages exceptions are separated from the normal execution using try-catch blocks and whenever an exception is raised then the catch blocks either recover from the exception in some way. or log the exception and abort. A workflow can be characterized as a long-running process. Exceptions occur in workflows but it is more expensive to abort the workflow as much work may be lost. Many proposals for describing workflows have been made. Some address exception handling, but few of these cleanly separate the description of the normal workflow from exceptions, and none present clear implementation details. Our approach to modeling and handling exceptions relies on continuations, listeners as exception handlers, and on policies, or strategies, for continuation. This model leads to a very flexible design and implementation of workflow. We present the details behind the implementation. Our work has been validated in a small prototype written in Java, though our approach and design are independent of the programming language.","PeriodicalId":122752,"journal":{"name":"Tenth Asia-Pacific Software Engineering Conference, 2003.","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129789336","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}
引用次数: 9
Rigorous EBNF-based definition for a graphic modeling language 严格的基于ebnf的图形建模语言定义
Tenth Asia-Pacific Software Engineering Conference, 2003. Pub Date : 2003-12-10 DOI: 10.1109/APSEC.2003.1254371
Yong Xia, M. Glinz
{"title":"Rigorous EBNF-based definition for a graphic modeling language","authors":"Yong Xia, M. Glinz","doi":"10.1109/APSEC.2003.1254371","DOIUrl":"https://doi.org/10.1109/APSEC.2003.1254371","url":null,"abstract":"Today, the syntax of visual specification languages such as UML is typically defined using meta-modelling techniques. However, this kind of syntax definition has drawbacks. In particular, graphic meta-models are not powerful enough, so they must be augmented by a textual constraint language. As an alternative, we present a text-based technique for the syntax definition of a graphic specification language. We exploit the fact that in a graphic specification language, most syntactic features are independent of the layout of the graph. So we map the graphic elements to textual ones and define the context-free syntax of this textual language in EBNF. Using our mapping, this grammar also defines the syntax of the graphic language. Simple spatial and context-sensitive constraints are then added by attributing the context-free grammar. Finally, for handling complex structural and dynamic information in the syntax, we give a set of operational rules that work on the attributed EBNF. We explain our syntax definition technique by applying it to the modelling language ADORA, which is being developed in our research group. We also briefly discuss the application of our technique to the syntax definition of UML. We mention the advantages of our method over the metamodeling techniques.","PeriodicalId":122752,"journal":{"name":"Tenth Asia-Pacific Software Engineering Conference, 2003.","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129843548","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}
引用次数: 15
Ensuring compatible interactions within component-based software systems 确保基于组件的软件系统中的兼容交互
Tenth Asia-Pacific Software Engineering Conference, 2003. Pub Date : 2003-12-10 DOI: 10.1109/APSEC.2003.1254399
Jun Han, Ksze Kae Ker
{"title":"Ensuring compatible interactions within component-based software systems","authors":"Jun Han, Ksze Kae Ker","doi":"10.1109/APSEC.2003.1254399","DOIUrl":"https://doi.org/10.1109/APSEC.2003.1254399","url":null,"abstract":"The interface definition of a component in a distributed system forms the contract between the component itself and its neighbouring components regarding the use of its services. In general, such a contract should cover the issues of service functionality, usage and quality. The interface definition languages (IDLs) used by commercial middleware standards such as CORBA primarily address the signature issues of such a contract, i.e., the forms and types of component or object services. Nothing is said about other aspects of the contract, including the way in which the component services are to be used. We introduce a framework and associated techniques that augment commercial IDLs with interaction protocol specifications and validate component interactions against such protocol specifications at run-time. In effect, the validation becomes a useful tool for testing whether or not the object services are used properly in a distributed system. Our approach has been implemented in the CORBA context, but can be readily applied to other IDL-based object/component systems.","PeriodicalId":122752,"journal":{"name":"Tenth Asia-Pacific Software Engineering Conference, 2003.","volume":"133 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130973773","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}
引用次数: 18
Matching software practitioner needs to researcher activities 将软件从业者的需求与研究者的活动相匹配
Tenth Asia-Pacific Software Engineering Conference, 2003. Pub Date : 2003-12-10 DOI: 10.1109/APSEC.2003.1254353
M. Feather, T. Menzies, J. R. Connelly
{"title":"Matching software practitioner needs to researcher activities","authors":"M. Feather, T. Menzies, J. R. Connelly","doi":"10.1109/APSEC.2003.1254353","DOIUrl":"https://doi.org/10.1109/APSEC.2003.1254353","url":null,"abstract":"We present an approach to matching software practitioners' needs to software researchers' activities. It uses an accepted taxonomical software classification scheme as intermediary, in terms of which practitioners express needs, and researchers express activities. A decision support tool is used to combine these expressions of needs/activities, and to assist in studying the implications of that combined knowledge. This enables identification of fruitful connections between researchers and practitioners, of areas of common interest among researchers, and practitioners, and of \"gaps\": areas of unfulfilled needs or unmotivated research. We discuss the software engineering underpinning this approach, illustrating its utility by reporting on experiments with a real-world dataset gathered from researchers and practitioners. We also suggest that this same approach would be applicable to understanding the distribution of interests represented by presenters and attendees of a conference such as APSEC.","PeriodicalId":122752,"journal":{"name":"Tenth Asia-Pacific Software Engineering Conference, 2003.","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126568031","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
Modeling complex systems by a set of interacting finite-state models 用一组相互作用的有限状态模型对复杂系统进行建模
Tenth Asia-Pacific Software Engineering Conference, 2003. Pub Date : 2003-12-10 DOI: 10.1109/APSEC.2003.1254392
S. Kundu
{"title":"Modeling complex systems by a set of interacting finite-state models","authors":"S. Kundu","doi":"10.1109/APSEC.2003.1254392","DOIUrl":"https://doi.org/10.1109/APSEC.2003.1254392","url":null,"abstract":"We present here a new way of modelling a complex system by a number of finite-state components which work together by transferring control among them in a fashion similar to the usual function-calls, including recursive calls. This gives us a simpler modelling technique than statecharts, which are often too complex for general users. The new technique also helps to keep the number of states small as in statecharts. We define the semantics of an interacting family of finite-state models in terms of their behavior-trees. As an elegant application of finite-state modelling, we present a maximally efficient controller design for a tree-structured set of tasks in a reactive system by taking advantage of the common computations among the tasks.","PeriodicalId":122752,"journal":{"name":"Tenth Asia-Pacific Software Engineering Conference, 2003.","volume":"196 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116210721","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}
引用次数: 4
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学术文献互助群
群 号:481959085
Book学术官方微信