Compositional Branching-Time Measurements

被引:0
|
作者
Grosu, Radu [1 ]
Peled, Doron [2 ]
Ramakrishnan, C. R. [3 ]
Smolka, Scott A. [3 ]
Stoller, Scott D. [3 ]
Yang, Junxing [3 ]
机构
[1] Vienna Univ Technol, Vienna, Austria
[2] Bar Ilan Univ, Ramat Gan, Israel
[3] SUNY Stony Brook, Stony Brook, NY USA
关键词
VERIFICATION;
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Formal methods are used to increase the reliability of software and hardware systems. Methods such as model checking, verification and testing are used to search for design and coding errors, integrated in the process of system design. Beyond checking whether a system satisfies a particular specification, we may want to measure some of its quantitative properties. Earlier works on system measurements suggest extending model checking techniques to measure quantitative artifacts, based on weights associated with the transitions of a transition system. Other works allow counting while performing model checking or runtime verification. This paper presents a simple and efficient compositional measuring framework based on quantitative state testers. The framework allows combining multiple measures, such as distance and power consumption, using a variety of functions, such as min, max, and average. This supports calculation of interesting compound measures that quantitatively characterize a system's behavior.
引用
收藏
页码:118 / +
页数:2
相关论文
共 50 条
  • [1] Mining Branching-Time Scenarios
    Fahland, Dirk
    Lo, David
    Maoz, Shahar
    2013 28TH IEEE/ACM INTERNATIONAL CONFERENCE ON AUTOMATED SOFTWARE ENGINEERING (ASE), 2013, : 443 - 453
  • [2] Memoryful branching-time logic
    Kupferman, Orna
    Vardi, Moshe Y.
    21ST ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS, 2006, : 265 - +
  • [3] On the Complexity of Branching-Time Logics
    Weber, Volker
    COMPUTER SCIENCE LOGIC, PROCEEDINGS, 2009, 5771 : 530 - 545
  • [4] Branching-time logics with path relativisation
    Latte, Markus
    Lange, Martin
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2014, 80 (02) : 375 - 389
  • [5] Topological Aspects of Branching-Time Semantics
    Michela Sabbadin
    Alberto Zanardo
    Studia Logica, 2003, 75 (3) : 271 - 286
  • [6] Branching-time logics and fairness, revisited
    Latte, Markus
    MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE, 2021, 31 (09) : 1135 - 1144
  • [7] A Monitoring Tool for a Branching-Time Logic
    Attard, Duncan Paul
    Francalanza, Adrian
    RUNTIME VERIFICATION, (RV 2016), 2016, 10012 : 473 - 481
  • [8] SATISFIABILITY GAMES FOR BRANCHING-TIME LOGICS
    Friedmann, Oliver
    Latte, Markus
    Lange, Martin
    LOGICAL METHODS IN COMPUTER SCIENCE, 2013, 9 (04)
  • [9] Possible events in branching-time model
    Klinowski, Mateusz
    DIAMETROS, 2005, 3 : 1 - 26
  • [10] On the expressive power of hybrid branching-time logics
    Kernberger, Daniel
    Lange, Martin
    THEORETICAL COMPUTER SCIENCE, 2020, 813 : 362 - 374