Decomposing integrated specifications for verification

被引:0
|
作者
Metzler, Bjoern [1 ]
机构
[1] Univ Gesamthsch Paderborn, Dept Comp Sci, D-33098 Paderborn, Germany
来源
关键词
integrated formal specifications; decomposition; compositional verification; program slicing; model checking;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Integrated formal specifications are intrinsically difficult to (automatically) verify due to the combination of complex data and behaviour. In this paper, we present a method for decomposing specifications into several smaller parts which can be independently verified. Verification results can then be combined to make a global result according to the original specification. Instead of relying on an a priori given structure of the system such as a parallel composition of components, we compute the decomposition by ourselves using the technique of slicing. With less effort, significant properties can be verified for the resulting specification parts and be applied to the full specification. We prove correctness of our method and exemplify it according to a specification from the rail domain.
引用
收藏
页码:459 / 479
页数:21
相关论文
共 50 条
  • [1] DECOMPOSING SPECIFICATIONS OF CONCURRENT SYSTEMS
    ABADI, M
    LAMPORT, L
    PROGRAMMING CONCEPTS, METHODS AND CALCULI, 1994, 56 : 327 - 340
  • [2] ON DECOMPOSING AND REFINING SPECIFICATIONS OF DISTRIBUTED SYSTEMS
    JONSSON, B
    LECTURE NOTES IN COMPUTER SCIENCE, 1990, 430 : 361 - 385
  • [3] Decomposing Controller Synthesis for Safety Specifications
    Dallal, Eric
    Tabuada, Paulo
    2016 IEEE 55TH CONFERENCE ON DECISION AND CONTROL (CDC), 2016, : 5720 - 5725
  • [4] Decomposing real-time specifications
    Olderog, ER
    Dierks, H
    COMPOSITIONALITY: THE SIGNIFICANT DIFFERENCE, 1998, 1536 : 465 - 489
  • [5] Decomposing the Verification of Interlocking Systems
    Haxthausen, Anne E.
    Fantechi, Alessandro
    Gori, Gloria
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2023, 14165 LNCS : 96 - 113
  • [6] Challenges in Decomposing Encodings of Verification Problems
    Schrammel, Peter
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2016, (219): : 29 - 32
  • [7] Visual specifications of policies and their verification
    Koch, M
    Parisi-Presicce, F
    FUNDAMENTAL APPROACHES TO SOFTWARE ENGINEERING, PROCEEDINGS, 2003, 2621 : 278 - 293
  • [8] PARTIAL SPECIFICATIONS AND COMPOSITIONAL VERIFICATION
    LARSEN, KG
    THOMSEN, B
    THEORETICAL COMPUTER SCIENCE, 1991, 88 (01) : 15 - 32
  • [9] Automatic verification of requirement specifications
    Kwon, GH
    Jeong, CJ
    Chung, YD
    INTELLIGENT INFORMATION SYSTEMS, (IIS'97) PROCEEDINGS, 1997, : 277 - 281
  • [10] Decomposing Bytecode Verification by Abstract Interpretation
    Bernardeschi, C.
    De Francesco, N.
    Lettieri, G.
    Martini, L.
    Masci, P.
    ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 2008, 31 (01):