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 条
  • [31] Conflict-Free Coloring of String Graphs
    Chaya Keller
    Alexandre Rok
    Shakhar Smorodinsky
    Discrete & Computational Geometry, 2021, 65 : 1337 - 1372
  • [32] Conflict-Free Replicated Data Types
    Shapiro, Marc
    Preguica, Nuno
    Baquero, Carlos
    Zawirski, Marek
    STABILIZATION, SAFETY, AND SECURITY OF DISTRIBUTED SYSTEMS, 2011, 6976 : 386 - +
  • [33] Building Conflict-Free FFT Schedules
    Richardson, Stephen
    Markovic, Dejan
    Danowitz, Andrew
    Brunhaver, John
    Horowitz, Mark
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS, 2015, 62 (04) : 1146 - 1155
  • [34] Dynamic conflict-free colorings in the plane
    de Berg, Mark
    Markovic, Aleksandar
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2019, 78 : 61 - 73
  • [35] Strong Conflict-Free Coloring for Intervals
    Cheilaris, Panagiotis
    Gargano, Luisa
    Rescigno, Adele A.
    Smorodinsky, Shakhar
    ALGORITHMS AND COMPUTATION, ISAAC 2012, 2012, 7676 : 4 - 13
  • [36] Conflict-free trajectory planning scheme
    School of Automobile and Traffic Engineering, Jiangsu University of Technology, Changzhou
    Jiangsu
    213000, China
    不详
    Jiangsu
    210016, China
    Kong Zhi Li Lun Yu Ying Yong, 7 (918-924):
  • [37] Online conflict-free colorings for hypergraphs
    Bar-Noy, Amotz
    Cheilaris, Panagiotis
    Olonetsky, Svetlana
    Smorodinsky, Shakhar
    AUTOMATA, LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2007, 4596 : 219 - +
  • [38] Online Conflict-Free Coloring for Intervals
    Fiat, Amos
    Levy, Meital
    Matousek, Jiri
    Mossel, Elchanan
    Pach, Janos
    Sharir, Micha
    Smorodinsky, Shakhar
    Wagner, Uli
    Welzl, Emo
    PROCEEDINGS OF THE SIXTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2005, : 545 - 554
  • [39] Conflict-free coloring of unit disks
    Lev-Tov, Nissan
    Meg, David
    DISCRETE APPLIED MATHEMATICS, 2009, 157 (07) : 1521 - 1532
  • [40] PARALLEL CONFLICT-FREE OPTIMAL ACCESS TO COMPLETE EXTENDED Q-ARY TREES
    CREUTZBURG, R
    LECTURE NOTES IN COMPUTER SCIENCE, 1989, 342 : 248 - 255