In a system under design, most functional errors encountered during the verification process are attributed to a misleading interpretation of system requirements. Therefore, the consistent reading of requirements, while mapping them to an unambiguous interpretation is of paramount importance. In requirements formalization, each natural language requirement is captured by one or more logical properties. In this process, we face the problem of consistently interpreting requirements, which stems from the varied use of natural language among engineers and the inherent ambiguities in the use of natural language. This paper introduces solutions that have been tested to demonstrate their effectiveness and utility. A set of templates - called boilerplates - for the specification of requirements in natural language is employed. Boilerplate-based requirements are then formalized into a logic language using an automated algorithm that eliminates ambiguity and ensures semantic consistency.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

From Natural Language Requirement Specifications to Logic Properties

  • Theodoros Nestoridis,
  • Konstantinos Mokos,
  • Panagiotis Katsaros

摘要

In a system under design, most functional errors encountered during the verification process are attributed to a misleading interpretation of system requirements. Therefore, the consistent reading of requirements, while mapping them to an unambiguous interpretation is of paramount importance. In requirements formalization, each natural language requirement is captured by one or more logical properties. In this process, we face the problem of consistently interpreting requirements, which stems from the varied use of natural language among engineers and the inherent ambiguities in the use of natural language. This paper introduces solutions that have been tested to demonstrate their effectiveness and utility. A set of templates - called boilerplates - for the specification of requirements in natural language is employed. Boilerplate-based requirements are then formalized into a logic language using an automated algorithm that eliminates ambiguity and ensures semantic consistency.