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 条
  • [41] A note on the conflict-free chromatic index
    Kamyczura, Mateusz
    Meszka, Mariusz
    Przybylo, Jakub
    DISCRETE MATHEMATICS, 2024, 347 (04)
  • [42] Trace nets and conflict-free computations
    Ochmanski, Edward
    Pieckowska, Joanna
    FUNDAMENTA INFORMATICAE, 2006, 72 (1-3) : 311 - 321
  • [43] Internal Conflict-Free Projection Sets
    Mikulski, Lukasz
    MAN-MACHINE INTERACTIONS, 2009, 59 : 497 - 504
  • [44] Conflict-free colorings of rectangles ranges
    Elbassioni, K
    Mustafa, NH
    STACS 2006, PROCEEDINGS, 2006, 3884 : 254 - 263
  • [45] Strong Conflict-Free Coloring for Intervals
    Cheilaris, Panagiotis
    Gargano, Luisa
    Rescigno, Adele A.
    Smorodinsky, Shakhar
    ALGORITHMICA, 2014, 70 (04) : 732 - 749
  • [46] Online conflict-free coloring for intervals
    Chen, Ke
    Fiat, Amos
    Kaplan, Haim
    Levy, Meital
    Matousek, Jiri
    Mossel, Elchanan
    Pach, Janos
    Sharir, Micha
    Smorodinsky, Shakhar
    Wagner, Uli
    Welzl, Emo
    SIAM JOURNAL ON COMPUTING, 2006, 36 (05) : 1342 - 1359
  • [47] Conflict-Free Evacuation Route Planning
    Herschelman, Roxana
    Qutbuddin, Ahmad
    Yang, KwangSoo
    GEOINFORMATICA, 2021, 25 (04) : 655 - 678
  • [48] Plan Repair in Conflict-Free Routing
    ter Mors, Adriaan
    Witteveen, Cees
    NEXT-GENERATION APPLIED INTELLIGENCE, PROCEEDINGS, 2009, 5579 : 46 - +
  • [49] Strong Conflict-Free Coloring for Intervals
    Panagiotis Cheilaris
    Luisa Gargano
    Adele A. Rescigno
    Shakhar Smorodinsky
    Algorithmica, 2014, 70 : 732 - 749
  • [50] CONFLICT-FREE ACCESS TO PARALLEL MEMORIES
    COLBOURN, CJ
    HEINRICH, K
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1992, 14 (02) : 193 - 200