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 条
  • [41] Extensions of the branching-time logic programming language Cactus
    Gergatsoulis, M
    INTENSIONAL PROGRAMMING II: BASED ON THE PAPERS AT ISLIP'99, 2000, : 117 - 132
  • [42] State/event software verification for branching-time specifications
    Chaki, S
    Clarke, E
    Grumberg, O
    Ouaknine, J
    Sharygina, N
    Touili, T
    Veith, H
    INTEGRATED FORMAL METHODS, PROCEEDINGS, 2005, 3771 : 53 - 69
  • [43] On the expressivity and complexity of quantitative branching-time temporal logics
    Laroussinie, F
    Schnoebelen, P
    Turuani, M
    THEORETICAL COMPUTER SCIENCE, 2003, 297 (1-3) : 297 - 315
  • [44] The Branching-Time Transformation Technique for Chain Datalog Programs
    Panos Rondogiannis
    Manolis Gergatsoulis
    Journal of Intelligent Information Systems, 2001, 17 : 71 - 94
  • [45] Branching-time property preservation between real-time systems
    Huang, Jinfeng
    Geilen, Marc
    Voeten, Jeroen
    Corporaal, Henk
    AUTOMATED TECHNOLOGY FOR VERIFICATION AND ANALYSIS, PROCEEDINGS, 2006, 4218 : 260 - 275
  • [46] On first-order runtime enforcement of branching-time properties
    Aceto, Luca
    Cassar, Ian
    Francalanza, Adrian
    Ingolfsdottir, Anna
    ACTA INFORMATICA, 2023, 60 (04) : 385 - 451
  • [47] A clausal resolution method for CTL branching-time temporal logic
    Bolotov, A
    Fisher, M
    JOURNAL OF EXPERIMENTAL & THEORETICAL ARTIFICIAL INTELLIGENCE, 1999, 11 (01) : 77 - 93
  • [48] Correction to: A linear-time branching-time perspective on interface automata
    Walter Vogler
    Gerald Lüttgen
    Acta Informatica, 2021, 58 : 677 - 677
  • [49] BRANCHING-TIME VERSUS LINEAR-TIME A Cooperative and Feasible Approach
    Kamide, Norihiro
    ICAART 2010: PROCEEDINGS OF THE 2ND INTERNATIONAL CONFERENCE ON AGENTS AND ARTIFICIAL INTELLIGENCE, VOL 1: ARTIFICIAL INTELLIGENCE, 2010, : 522 - 526
  • [50] Freedom, weakness, and determinism: From linear-time to branching-time
    Kupferman, O
    Vardi, MY
    THIRTEENTH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS, 1998, : 81 - 92