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 条
  • [21] Conflict-Free Self-Routing for a Three-Dimensional Complete Multiring
    Podlazov, V. S.
    AUTOMATION AND REMOTE CONTROL, 2019, 80 (05) : 936 - 945
  • [22] Conflict-Free Evacuation Route Planner
    Herschelman, Roxana
    Yang, KwangSoo
    27TH ACM SIGSPATIAL INTERNATIONAL CONFERENCE ON ADVANCES IN GEOGRAPHIC INFORMATION SYSTEMS (ACM SIGSPATIAL GIS 2019), 2019, : 480 - 483
  • [23] Extremal Results on Conflict-Free Coloring
    Bhyravarapu, Sriram
    Gupta, Shiwali
    Kalyanasundaram, Subrahmanyam
    Mathew, Rogers
    JOURNAL OF GRAPH THEORY, 2025,
  • [24] Strong conflict-free connection of graphs
    Ji, Meng
    Li, Xueliang
    APPLIED MATHEMATICS AND COMPUTATION, 2020, 364
  • [25] Priority conflict-free Petri nets
    Hsu-Chun Yen
    Acta Informatica, 1998, 35 : 673 - 688
  • [26] Priority conflict-free Petri nets
    Yen, HC
    ACTA INFORMATICA, 1998, 35 (08) : 673 - 688
  • [27] Complexity of conflict-free colorings of graphs
    Gargano, Luisa
    Rescigno, Adele A.
    THEORETICAL COMPUTER SCIENCE, 2015, 566 : 39 - 49
  • [28] CONFLICT-FREE COLORINGS OF SHALLOW DISCS
    Alon, Noga
    Smorodinsky, Shakhar
    INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 2008, 18 (06) : 599 - 604
  • [29] Separability in conflict-free Petri nets
    Best, Eike
    Esparza, Javier
    Wimmel, Harro
    Wolf, Karsten
    PERSPECTIVES OF SYSTEMS INFORMATICS, 2007, 4378 : 1 - +
  • [30] Online conflict-free coloring of intervals
    Abam, M. A.
    Seraji, M. J. Rezaei
    Shadravan, M.
    SCIENTIA IRANICA, 2014, 21 (06) : 2138 - 2141