Abstract Monitors for Quantitative Specifications

被引:3
|
作者
Henzinger, Thomas A. [1 ]
Mazzocchi, Nicolas [1 ]
Sarac, N. Ege [1 ]
机构
[1] Inst Sci & Technol Austria ISTA, Klosterneuburg, Austria
来源
关键词
Abstract monitor; Approximate monitoring; Quantitative monitoring; Monitor resources;
D O I
10.1007/978-3-031-17196-3_11
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Quantitative monitoring can be universal and approximate: For every finite sequence of observations, the specification provides a value and the monitor outputs a best-effort approximation of it. The quality of the approximation may depend on the resources that are available to the monitor. By taking to the limit the sequences of specification values and monitor outputs, we obtain precision-resource trade-offs also for limit monitoring. This paper provides a formal framework for studying such trade-offs using an abstract interpretation for monitors: For each natural number n, the aggregate semantics of a monitor at time n is an equivalence relation over all sequences of at most n observations so that two equivalent sequences are indistinguishable to the monitor and thus mapped to the same output. This abstract interpretation of quantitative monitors allows us to measure the number of equivalence classes (or "resource use") that is necessary for a certain precision up to a certain time, or at any time. Our framework offers several insights. For example, we identify a family of specifications for which any resource-optimal exact limit monitor is independent of any error permitted over finite traces. Moreover, we present a specification for which any resource-optimal approximate limit monitor does not minimize its resource use at any time.
引用
收藏
页码:200 / 220
页数:21
相关论文
共 50 条
  • [31] Reasoning about proof search specifications: An abstract
    Miller, D
    THEOREM PROVING IN HIGHER ORDER LOGICS, PROCEEDINGS, 2003, 2758 : 204 - 204
  • [32] COMMUNICATION PROTOCOL SPECIFICATIONS AND MODELS WITH ABSTRACT MACHINES
    POTIN, P
    TSI-TECHNIQUE ET SCIENCE INFORMATIQUES, 1983, 2 (03): : 191 - 206
  • [33] Probabilistic Modal Specifications (Invited Extended Abstract)
    Larsen, Kim G.
    Legay, Axel
    FORMAL ASPECTS OF COMPONENT SOFTWARE, 2014, 8348 : 1 - 4
  • [34] Formal verification of abstract system and protocol specifications
    Schneider, Axel
    Bluhm, Thomas
    Renner, Tobias
    Heinkel, Ulrich
    Knaeblein, Joachim
    Zavala, Reynaldo
    30TH ANNUAL IEEE/NASA SOFTWARE ENGINEERING WORKSHOP, PROCEEDINGS, 2006, : 207 - +
  • [35] Synthesising Correct Concurrent Runtime Monitors (Extended Abstract)
    Francalanza, Adrian
    Seychell, Aldrin
    RUNTIME VERIFICATION, RV 2013, 2013, 8174 : 112 - 129
  • [36] Representing abstract architectures with axiomatic specifications and activation conditions
    Baraona, P
    Alexander, P
    INTERNATIONAL CONFERENCE AND WORKSHOP ON ENGINEERING OF COMPUTER-BASED SYSTEMS, PROCEEDINGS, 1997, : 161 - 168
  • [37] Mind the gap! Abstract versus concrete models of specifications
    Sannella, D.
    Tarlecki, A.
    Lecture Notes in Computer Science, 1113
  • [38] BEHAVIOURAL CATEGORICITY OF ABSTRACT DATA TYPE SPECIFICATIONS.
    Lescanne, Pierre
    1600, (26):
  • [39] AbsSynthe: abstract synthesis from succinct safety specifications
    Brenguier, Romain
    Perez, Guillermo A.
    Raskin, Jean-Francois
    Sankur, Ocan
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2014, (157): : 100 - 116
  • [40] GATE SPLITTING IN LOTOS SPECIFICATIONS USING ABSTRACT INTERPRETATION
    GIANNOTTI, F
    LATELLA, D
    SCIENCE OF COMPUTER PROGRAMMING, 1994, 23 (2-3) : 127 - 149