QQ客服 官方微博 反馈留言

	An Approach to Generating Proposals for Handling Inconsistent Software Requirements
	Mu, Kedian ; Liu, Weiru ; Jin, Zhi
	2011
关键词	SPECIFICATIONS INTERPLAY
英文摘要	Inconsistency has been considered as one of the main classes of defects in software requirements specification. Various logic-based techniques have been proposed to manage inconsistencies in requirements engineering. However, identifying an appropriate proposal for resolving inconsistencies in software requirements is still a challenging problem. In this paper, we propose a logic-based approach to generating appropriate proposals for handling inconsistency in software requirements. Informally speaking, given an inconsistent requirements specification, we identify which requirements should be given priority to be changed for resolving the inconsistency in that specification, by balancing the blame of each requirement for the inconsistency against its value for that requirements specification. We follow the viewpoint that minimal inconsistent subsets of a set of formulas are the purest forms of inconsistencies in that set. According to this viewpoint, a potential proposal for resolving inconsistencies can be described by a possible combination of some requirements to be changed that can eliminate minimal inconsistent subsets. Then we propose a method of evaluating the degree of disputability of each requirement involved in the inconsistency in a requirements specification. Finally, we provide an algorithm of generating appropriate proposals for resolving the inconsistency in a requirements specification based on the degree of disputability of requirements.; Computer Science, Artificial Intelligence; Computer Science, Information Systems; Logic; EI; CPCI-S(ISTP); 0
语种	英语
出处	EI ; SCI
内容类型	其他
源URL	[http://hdl.handle.net/20.500.11897/315394]
专题	数学科学学院
推荐引用方式 GB/T 7714	Mu, Kedian,Liu, Weiru,Jin, Zhi. An Approach to Generating Proposals for Handling Inconsistent Software Requirements. 2011-01-01.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。