Identifying Acceptable Common Proposals for Handling Inconsistent Software Requirements

  • Authors:

  • Kedian Mu;Zhi Jin

  • Affiliations:

  • School of Mathematical Sciences, Peking University, Beijing 100871, P.R. China;Academy of Mathematics and System Sciences, Chinese Academy of Sciences, Beijing 100080, P.R. China

  • Venue:
  • FORTE '07 Proceedings of the 27th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

The requirements specifications of complex systems are increasingly developed in a distributed fashion. It makes inconsistency management necessary during the requirements stage. However, identifying appropriate inconsistency handling proposals is still an important challenge. In particular, for inconsistencies involving many different stakeholders with different concerns, it is difficult to reach an agreement on inconsistency handling. To address this, this paper presents a vote-based approach to choosing acceptable common proposals for handling inconsistency. This approach focuses on the inconsistency in requirements that results from conflicting intentions of stakeholders. Informally speaking, we consider each distinct stakeholder (or a distributed artifact) involved in the inconsistency as a voter. Then we transform identification of an acceptable common proposal into a problem of combinatorial vote. Based on each stakeholder's preferences on the set of proposals, an acceptable common proposal is identified in an automated way according to a given social vote rule.