Towards Development of Complete and Conflict-Free Requirements

被引:14
|
作者
Moitra, Abha [1 ]
Siu, Kit [1 ]
Crapo, Andrew W. [1 ]
Chamarthi, Harsh [1 ]
Durling, Michael [1 ]
Li, Meng [1 ]
Yu, Han [1 ]
Manolios, Panagiotis [2 ]
Meiners, Michael [3 ]
机构
[1] GE Global Res, Niskayuna, NY 12309 USA
[2] Northeastern Univ, Boston, MA 02115 USA
[3] GE Aviat Syst, Grand Rapids, MI USA
关键词
Requirements Formalization; Formal Analysis of Requirements; Ontology; Automated Requirements-Based Test Generation; Requirements Engineering; Formal Methods;
D O I
10.1109/RE.2018.00036
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Writing requirements is no easy task. Common problems include ambiguity in statements, specifications at the wrong level of abstraction, statements with inconsistent references to types, conflicting requirements, and incomplete requirements. These pitfalls lead to errors being introduced early in the design process. The longer the gap between error introduction and error discovery, the higher the cost associated with the error. To address the growing cost of system development, we introduce a tool called ASSERT (TM) (Analysis of Semantic Specifications and Efficient generation of Requirements-based Tests) for capturing requirements, backed by a formal requirements analysis engine. ASSERT (TM) also automatically generates a complete set of requirements-based test cases. Capturing requirements in an unambiguous way and then formally analyzing them with an automated theorem prover eliminates errors as soon as requirements are written. It also addresses the historical problem that analysis engines are hard to use for someone without formal methods expertise and analysis results are often difficult for the end-user to understand and make actionable. ASSERT (TM)'s major contribution is to bring powerful requirements capture and analysis capability to the domain of the end-user. We provide explainable and automated formal analysis, something we found important for a tool's adoptability in industry.
引用
收藏
页码:286 / 296
页数:11
相关论文
共 50 条
  • [1] CONFLICT AND CONFLICT-FREE THEORIES
    Mikhaylenko, A. Yu
    Sudoplatov, S., V
    SIBERIAN ELECTRONIC MATHEMATICAL REPORTS-SIBIRSKIE ELEKTRONNYE MATEMATICHESKIE IZVESTIYA, 2019, 16 : 1833 - 1842
  • [2] Conflict-free chromatic number versus conflict-free chromatic index
    Debski, Michal
    Przybylo, Jakub
    JOURNAL OF GRAPH THEORY, 2022, 99 (03) : 349 - 358
  • [3] Towards building a conflict-free mobile distributed file system
    Boukerche, Azzedine
    Al-Shaikh, Raed A.
    CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2007, 19 (08): : 1237 - 1250
  • [4] ON FOSTERING DEVELOPMENT OF SOME CONFLICT-FREE EGO FUNCTIONS
    MINTZ, EE
    PSYCHOTHERAPY-THEORY RESEARCH AND PRACTICE, 1965, 2 (02): : 84 - 88
  • [5] CONFLICT-FREE CONNECTIONS OF GRAPHS
    Czap, Julius
    Jendrol, Stanislav
    Valiska, Juraj
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2018, 38 (04) : 911 - 920
  • [6] Conflict-free connection of trees
    Hong Chang
    Meng Ji
    Xueliang Li
    Jingshu Zhang
    Journal of Combinatorial Optimization, 2021, 42 : 340 - 353
  • [7] Towards Conflict-Free Collaborative Modelling using VS Code Extensions
    Saini, Rijul
    Mussbacher, Gunter
    24TH ACM/IEEE INTERNATIONAL CONFERENCE ON MODEL-DRIVEN ENGINEERING LANGUAGES AND SYSTEMS COMPANION (MODELS-C 2021), 2021, : 37 - 46
  • [8] Conflict-Free Incremental Learning
    Sun, Rong-Lei
    EMERGING INTELLIGENT COMPUTING TECHNOLOGY AND APPLICATIONS: WITH ASPECTS OF ARTIFICIAL INTELLIGENCE, 2009, 5755 : 618 - 626
  • [9] Conflict-free hypergraph matchings
    Glock, Stefan
    Joos, Felix
    Kim, Jaehoon
    Kuhn, Marcus
    Lichev, Lyuben
    JOURNAL OF THE LONDON MATHEMATICAL SOCIETY-SECOND SERIES, 2024, 109 (05):
  • [10] On conflict-free connection of graphs
    Chang, Hong
    Huang, Zhong
    Li, Xueliang
    Mao, Yaping
    Zhao, Haixing
    DISCRETE APPLIED MATHEMATICS, 2019, 255 : 167 - 182