Computer says no: Verdict explainability for runtime monitors using a local proof system

Monitors in Runtime Verification are often constructed as black boxes: they provide verdicts on whether a property is satisfied or violated by the executing system under scrutiny, without much explanation as to why this is the case. In the best of cases, monitors might also return the trace observed...

Full description

Saved in:
Bibliographic Details
Published inJournal of logical and algebraic methods in programming Vol. 119; p. 100636
Main Authors Francalanza, Adrian, Cini, Clare
Format Journal Article
LanguageEnglish
Published Elsevier Inc 01.02.2021
Subjects
Online AccessGet full text

Cover

Loading…
Abstract Monitors in Runtime Verification are often constructed as black boxes: they provide verdicts on whether a property is satisfied or violated by the executing system under scrutiny, without much explanation as to why this is the case. In the best of cases, monitors might also return the trace observed, still leaving it up to the user to figure out the logic employed to reach the declared verdict from this trace. In this paper, we propose a local proof system for Linear Temporal Logic—a popular logic used in Runtime Verification—formalising the symbolic deductions within the constraints of Runtime Verification. We prove novel soundness and partial completeness results for this proof system with respect to the original semantics of the logic. Crucially, we show how such a deductive system can be used as a realistic basis for constructing online runtime monitors that provide explanations for their verdicts; we also show the resulting monitor algorithms to satisfy pleasing correctness criteria identified by other works, such as the decidability and incrementality of the analysis and the irrevocability of verdicts. Finally, we relate the expressiveness of the Linear Temporal Logic proof system to existing symbolic analysis techniques used in Runtime Verification.
AbstractList Monitors in Runtime Verification are often constructed as black boxes: they provide verdicts on whether a property is satisfied or violated by the executing system under scrutiny, without much explanation as to why this is the case. In the best of cases, monitors might also return the trace observed, still leaving it up to the user to figure out the logic employed to reach the declared verdict from this trace. In this paper, we propose a local proof system for Linear Temporal Logic—a popular logic used in Runtime Verification—formalising the symbolic deductions within the constraints of Runtime Verification. We prove novel soundness and partial completeness results for this proof system with respect to the original semantics of the logic. Crucially, we show how such a deductive system can be used as a realistic basis for constructing online runtime monitors that provide explanations for their verdicts; we also show the resulting monitor algorithms to satisfy pleasing correctness criteria identified by other works, such as the decidability and incrementality of the analysis and the irrevocability of verdicts. Finally, we relate the expressiveness of the Linear Temporal Logic proof system to existing symbolic analysis techniques used in Runtime Verification.
ArticleNumber 100636
Author Francalanza, Adrian
Cini, Clare
Author_xml – sequence: 1
  givenname: Adrian
  surname: Francalanza
  fullname: Francalanza, Adrian
  email: adrian.francalanza@um.edu.mt
  organization: CS@ICT, University of Malta, Msida, MSD2080, Malta
– sequence: 2
  givenname: Clare
  surname: Cini
  fullname: Cini, Clare
  email: clare.cini@ricston.com
  organization: Ricston Ltd., G.F. Agius De Soldanis Street, Birkirkara, BKR4850, Malta
BookMark eNqFkMtKAzEUhrOoYK19Ajd5gam5dGYyggsp3qDgRsVdOJOLZJhJhiQV5-1trSsXujrwc74f_u8MzXzwBqELSlaU0OqyW3U9DOOKEXZISMWrGZozXrKCMSJO0TKljpD9q6gFp3P0tgnDuMsm4gRTwj5c4VcTtVMZm8-xB-ehdb3LE7Yh4rjz2Q0GD8G7HGLCu-T8OwbcBwU9HmMIFqcpZTOcoxMLfTLLn7tAL3e3z5uHYvt0_7i52RaKE54LXUNj29ICF7pSNataK1QNTGkmaAO8rNZQ6lIJa2rLVbOmRDfrmgmoWFsT4AvEj70qhpSisXKMboA4SUrkwYns5LcTeXAij072VPOLUi5DdsHnCK7_h70-smY_68OZKJNyxiujXTQqSx3cn_wXy3qD5g
CitedBy_id crossref_primary_10_1007_s00236_023_00441_9
Cites_doi 10.1007/978-3-319-75632-5_1
10.1007/s00165-017-0420-8
10.1016/j.jlap.2008.02.004
10.1016/j.ic.2010.09.008
10.1016/j.jlap.2008.08.004
10.1145/2000799.2000800
10.1016/0304-3975(91)90041-Y
10.1007/978-3-319-75632-5_6
10.1145/3290365
10.1017/CBO9781139168717
10.1007/s10515-005-6205-y
10.1007/BF01782772
10.1007/s10703-019-00337-w
10.1016/j.tcs.2004.11.007
10.1016/0304-3975(90)90110-4
10.1016/j.jlap.2013.04.001
10.1023/A:1011254632723
10.1007/s10703-016-0253-8
10.1093/logcom/exn075
10.1007/s10703-017-0273-z
10.1016/j.tcs.2017.02.009
ContentType Journal Article
Copyright 2020 Elsevier Inc.
Copyright_xml – notice: 2020 Elsevier Inc.
DBID AAYXX
CITATION
DOI 10.1016/j.jlamp.2020.100636
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
ExternalDocumentID 10_1016_j_jlamp_2020_100636
S2352220820301218
GrantInformation_xml – fundername: H2020
  grantid: 778233
  funderid: https://doi.org/10.13039/100010661
– fundername: The University of Malta
  grantid: CPSRP05-04
  funderid: https://doi.org/10.13039/501100015774
– fundername: RANNIS
  grantid: TheoFoMon:163406-051
  funderid: https://doi.org/10.13039/501100001840
GroupedDBID --M
0R~
4.4
457
4G.
7-5
8P~
AACTN
AAEDT
AAEDW
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAXUO
AAYFN
ABBOA
ABMAC
ABVKL
ABXDB
ABYKQ
ACDAQ
ACGFS
ACRLP
ADBBV
ADEZE
AEBSH
AEKER
AENEX
AFKWA
AFTJW
AGHFR
AGUBO
AIALX
AIEXJ
AIKHN
AITUG
AJBFU
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
AOUOD
AXJTR
BKOJK
BLXMC
EBS
EFJIC
EFLBG
EJD
FDB
FIRID
FYGXN
GBLVA
GBOLZ
HZ~
KOM
M41
NCXOZ
O9-
OAUVE
RIG
ROL
SPC
SPCBC
SSV
SSZ
T5K
~G-
AATTM
AAXKI
AAYWO
AAYXX
ABJNI
ACVFH
ADCNI
ADVLN
AEIPS
AEUPX
AFJKZ
AFPUW
AFXIZ
AGCQF
AGRNS
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
BNPGV
CITATION
SSH
ID FETCH-LOGICAL-c303t-d7a9fb5fa38d6c726bf8c7a2cd2819a3564a5d5c8fe7f3c9410d94728a62b70a3
IEDL.DBID AIKHN
ISSN 2352-2208
IngestDate Tue Jul 01 00:37:50 EDT 2025
Thu Apr 24 23:06:16 EDT 2025
Fri Feb 23 02:45:43 EST 2024
IsPeerReviewed true
IsScholarly true
Keywords Proof systems
Interpretability
Explainability
Linear temporal logic
Correct monitor synthesis
Runtime verification
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c303t-d7a9fb5fa38d6c726bf8c7a2cd2819a3564a5d5c8fe7f3c9410d94728a62b70a3
ParticipantIDs crossref_primary_10_1016_j_jlamp_2020_100636
crossref_citationtrail_10_1016_j_jlamp_2020_100636
elsevier_sciencedirect_doi_10_1016_j_jlamp_2020_100636
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate February 2021
2021-02-00
PublicationDateYYYYMMDD 2021-02-01
PublicationDate_xml – month: 02
  year: 2021
  text: February 2021
PublicationDecade 2020
PublicationTitle Journal of logical and algebraic methods in programming
PublicationYear 2021
Publisher Elsevier Inc
Publisher_xml – name: Elsevier Inc
References Dawes, Reger (br0290) 2019
Manna, Pnueli (br0540) 1995
Bradfield, Stirling (br0220) 1992
Ahrendt, Henrio, Oortwijn (br0060) 2019
Chai, Schlingloff (br0270) 2014
Gilpin, Bau, Yuan, Bajwa, Specter, Kagal (br0420) 2018
2018, pp. 1–33
Bauer, Leucker, Schallhart (br0190) 2011; 20
Francalanza, Aceto, Ingólfsdóttir (br0370) 2017; 51
Basin, Klaedtke, Zalinescu (br0150) 2017
Bohlender, Köhl (br0210) 2019
Gabbay, Pnueli, Shelah, Stavi (br0400) 1980
Stirling, Walker (br0620) 1991; 89
Havelund, Peled (br0440) 2018
Brunnler, Lange (br0230) 2008; 76
Aceto, Achilleos, Francalanza, Ingólfsdóttir, Lehtinen (br0030) 2019; 3
Grigore, Kiefer (br0430) 2015
Cini, Francalanza (br0280) 2015
Sánchez, Schneider, Ahrendt, Bartocci, Bianculli, Colombo, Falcone, Francalanza, Krstic, Lourenço, Nickovic, Pace, Rufino, Signoles, Traytel, Weiss (br0600) 2019; 54
Aceto, Achilleos, Francalanza, Ingólfsdóttir, Kjartansson (br0020) 2017
Eisner, Fisman, Havlicek, Lustig, McIsaac, Campenhout (br0320) 2003
Geilen (br0410) 2001
Francalanza, Gauci, Pace (br0380) 2013; 82
(br0110) 2018; vol. 10457
Francalanza (br0340) 2016
Havelund, Rosu (br0450) 2001
Jia, Gommerstadt, Pfenning (br0470) 2016
Francalanza, Aceto, Achilleos, Attard, Cassar, Monica, Ingólfsdóttir (br0360) 2017
Desai, Dreossi, Seshia (br0300) 2017
Troelstra, Schwichtenberg (br0640) 2000
Edwards, Veale (br0310) 2017; 16
Alpern, Schneider (br0070) 1987; 2
.
Bauer, Leucker, Schallhart (br0170) 2007
Cassar, Francalanza, Aceto, Ingólfsdóttir (br0260) 2017
Roşu, Havelund (br0590) 2005; 12
Aceto, Achilleos, Francalanza, Ingólfsdóttir, Lehtinen (br0050) 2019
Attard, Francalanza (br0090) 2017
(br0250) 1998
Kejstová, Rockai, Barnat (br0480) 2017
A. Francalanza, A Theory of Monitors. Information and Computation (in press).
Neykova, Bocchi, Yoshida (br0550) 2017; 29
Artho, Barringer, Goldberg, Havelund, Khurshid, Lowry, Pasareanu, Rosu, Sen, Visser, Washington (br0080) 2005; 336
A. Francalanza, J.A. Pérez, C. Sánchez, Runtime verification for decentralised and distributed systems, in
Kupferman, Vardi (br0500) 2001; 19
Baier, Katoen (br0100) 2008
Tabakov, Vardi (br0630) 2010
Basin, Bhatt, Traytel (br0140) 2018
Pnueli (br0570) 1977
2018, pp. 176–210
Francalanza (br0350) 2017
Pnueli, Zaks (br0580) 2006
Bartocci, Manjunath, Mariani, Mateis, Nickovic (br0130) 2019
Neykova, Hu, Yoshida, Abdeljallal (br0560) 2018
Hinrichs, Sistla, Zuck (br0460) 2014; vol. 42
Bauer, Leucker, Schallhart (br0180) 2010; 20
Leucker, Schallhart (br0510) 2009; 78
E. Bartocci, Y. Falcone, A. Francalanza, G. Reger, Introduction to runtime verification, in
Manna, Pnueli (br0530) 1991; 83
Bocchi, Chen, Demangeon, Honda, Yoshida (br0200) 2017; 669
Bauer, Falcone (br0160) 2016; 48
Burlò, Francalanza, Scalas (br0240) 2020
Aceto, Achilleos, Francalanza, Ingólfsdóttir (br0010) 2018
Sen, Rosu, Agha (br0610) 2003
Aceto, Achilleos, Francalanza, Ingólfsdóttir, Lehtinen (br0040) 2019
Kojima, Igarashi (br0490) 2011; 209
10.1016/j.jlamp.2020.100636_br0390
Roşu (10.1016/j.jlamp.2020.100636_br0590) 2005; 12
Sen (10.1016/j.jlamp.2020.100636_br0610) 2003
Brunnler (10.1016/j.jlamp.2020.100636_br0230) 2008; 76
Francalanza (10.1016/j.jlamp.2020.100636_br0370) 2017; 51
Aceto (10.1016/j.jlamp.2020.100636_br0010) 2018
Aceto (10.1016/j.jlamp.2020.100636_br0020) 2017
(10.1016/j.jlamp.2020.100636_br0110) 2018; vol. 10457
Pnueli (10.1016/j.jlamp.2020.100636_br0580) 2006
Aceto (10.1016/j.jlamp.2020.100636_br0040) 2019
Stirling (10.1016/j.jlamp.2020.100636_br0620) 1991; 89
Bauer (10.1016/j.jlamp.2020.100636_br0190) 2011; 20
Dawes (10.1016/j.jlamp.2020.100636_br0290) 2019
Burlò (10.1016/j.jlamp.2020.100636_br0240) 2020
Bohlender (10.1016/j.jlamp.2020.100636_br0210)
Grigore (10.1016/j.jlamp.2020.100636_br0430) 2015
Attard (10.1016/j.jlamp.2020.100636_br0090) 2017
Kejstová (10.1016/j.jlamp.2020.100636_br0480) 2017
Edwards (10.1016/j.jlamp.2020.100636_br0310) 2017; 16
Hinrichs (10.1016/j.jlamp.2020.100636_br0460) 2014; vol. 42
(10.1016/j.jlamp.2020.100636_br0250) 1998
Leucker (10.1016/j.jlamp.2020.100636_br0510) 2009; 78
Desai (10.1016/j.jlamp.2020.100636_br0300) 2017
Troelstra (10.1016/j.jlamp.2020.100636_br0640) 2000
Gilpin (10.1016/j.jlamp.2020.100636_br0420) 2018
Tabakov (10.1016/j.jlamp.2020.100636_br0630) 2010
Bauer (10.1016/j.jlamp.2020.100636_br0180) 2010; 20
Francalanza (10.1016/j.jlamp.2020.100636_br0340) 2016
Neykova (10.1016/j.jlamp.2020.100636_br0560) 2018
Basin (10.1016/j.jlamp.2020.100636_br0140) 2018
Bauer (10.1016/j.jlamp.2020.100636_br0160) 2016; 48
Francalanza (10.1016/j.jlamp.2020.100636_br0360) 2017
Alpern (10.1016/j.jlamp.2020.100636_br0070) 1987; 2
Bauer (10.1016/j.jlamp.2020.100636_br0170) 2007
Cini (10.1016/j.jlamp.2020.100636_br0280) 2015
Cassar (10.1016/j.jlamp.2020.100636_br0260) 2017
Pnueli (10.1016/j.jlamp.2020.100636_br0570) 1977
Aceto (10.1016/j.jlamp.2020.100636_br0030) 2019; 3
Manna (10.1016/j.jlamp.2020.100636_br0540) 1995
Geilen (10.1016/j.jlamp.2020.100636_br0410) 2001
Havelund (10.1016/j.jlamp.2020.100636_br0440) 2018
Baier (10.1016/j.jlamp.2020.100636_br0100) 2008
Eisner (10.1016/j.jlamp.2020.100636_br0320) 2003
Gabbay (10.1016/j.jlamp.2020.100636_br0400) 1980
Sánchez (10.1016/j.jlamp.2020.100636_br0600) 2019; 54
Bartocci (10.1016/j.jlamp.2020.100636_br0130) 2019
10.1016/j.jlamp.2020.100636_br0120
Bradfield (10.1016/j.jlamp.2020.100636_br0220) 1992
Kojima (10.1016/j.jlamp.2020.100636_br0490) 2011; 209
Aceto (10.1016/j.jlamp.2020.100636_br0050) 2019
Bocchi (10.1016/j.jlamp.2020.100636_br0200) 2017; 669
Manna (10.1016/j.jlamp.2020.100636_br0530) 1991; 83
Basin (10.1016/j.jlamp.2020.100636_br0150) 2017
Chai (10.1016/j.jlamp.2020.100636_br0270) 2014
Artho (10.1016/j.jlamp.2020.100636_br0080) 2005; 336
Ahrendt (10.1016/j.jlamp.2020.100636_br0060)
Kupferman (10.1016/j.jlamp.2020.100636_br0500) 2001; 19
10.1016/j.jlamp.2020.100636_br0330
Francalanza (10.1016/j.jlamp.2020.100636_br0350) 2017
Neykova (10.1016/j.jlamp.2020.100636_br0550) 2017; 29
Jia (10.1016/j.jlamp.2020.100636_br0470) 2016
Havelund (10.1016/j.jlamp.2020.100636_br0450) 2001
Francalanza (10.1016/j.jlamp.2020.100636_br0380) 2013; 82
References_xml – start-page: 126
  year: 2007
  end-page: 138
  ident: br0170
  article-title: The good, the bad, and the ugly, but how ugly is ugly?
  publication-title: Runtime Verification
– volume: 12
  start-page: 151
  year: 2005
  end-page: 197
  ident: br0590
  article-title: Rewriting-based techniques for runtime verification
  publication-title: Autom. Softw. Eng.
– start-page: 181
  year: 2001
  end-page: 199
  ident: br0410
  article-title: On the construction of monitors for temporal logic properties
  publication-title: Runtime Verification
– start-page: 581
  year: 2015
  end-page: 595
  ident: br0280
  article-title: An LTL proof system for runtime verification
  publication-title: TACAS
– volume: 82
  start-page: 186
  year: 2013
  end-page: 215
  ident: br0380
  article-title: Distributed system contract monitoring
  publication-title: J. Log. Algebraic Methods Program.
– reference: , 2018, pp. 1–33,
– volume: 51
  start-page: 87
  year: 2017
  end-page: 116
  ident: br0370
  article-title: Monitorability for the Hennessy-Milner logic with recursion
  publication-title: Form. Methods Syst. Des.
– volume: 16
  start-page: 1
  year: 2017
  end-page: 65
  ident: br0310
  article-title: Slave to the algorithm? Why a ‘right to an explanation’ is probably not the remedy you are looking for
  publication-title: Duke Law Technol. Rev.
– start-page: 135
  year: 2001
  end-page: 143
  ident: br0450
  article-title: Monitoring programs using rewriting
  publication-title: Automated Software Engineering
– start-page: 69
  year: 2019
  end-page: 86
  ident: br0130
  article-title: Automatic failure explanation in CPS models
  publication-title: Software Engineering and Formal Methods - 17th International Conference
– volume: 2
  start-page: 117
  year: 1987
  end-page: 126
  ident: br0070
  article-title: Recognizing safety and liveness
  publication-title: Distrib. Comput.
– reference: A. Francalanza, J.A. Pérez, C. Sánchez, Runtime verification for decentralised and distributed systems, in:
– volume: vol. 10457
  year: 2018
  ident: br0110
  publication-title: Lectures on Runtime Verification - Introductory and Advanced Topics
– volume: 83
  start-page: 97
  year: 1991
  end-page: 130
  ident: br0530
  article-title: Completing the temporal picture
  publication-title: Theor. Comput. Sci.
– start-page: 163
  year: 1980
  end-page: 173
  ident: br0400
  article-title: On the temporal analysis of fairness
  publication-title: Principles of Programming Languages
– year: 2000
  ident: br0640
  article-title: Basic Proof Theory
  publication-title: Cambridge Tracts in Theoretical Computer Science
– start-page: 145
  year: 2016
  end-page: 161
  ident: br0340
  article-title: A theory of monitors (extended abstract)
  publication-title: Foundations of Software Science and Computation Structures - 19th International Conference
– volume: 78
  start-page: 293
  year: 2009
  end-page: 303
  ident: br0510
  article-title: A brief account of runtime verification
  publication-title: J. Log. Algebraic Program.
– year: 2019
  ident: br0290
  article-title: Explaining violations of properties in control-flow temporal logic
  publication-title: Runtime Verification - 19th International Conference
– reference: A. Francalanza, A Theory of Monitors. Information and Computation (in press).
– start-page: 356
  year: 2017
  end-page: 376
  ident: br0150
  article-title: Runtime verification of temporal properties over out-of-order data streams
  publication-title: Computer Aided Verification - 29th International Conference
– start-page: 436
  year: 2010
  end-page: 451
  ident: br0630
  article-title: Optimized temporal monitors for SystemC
  publication-title: Runtime Verification
– year: 1992
  ident: br0220
  article-title: Local Model-Checking for Infinite State Spaces
– reference: , 2018, pp. 176–210,
– start-page: 433
  year: 2019
  end-page: 453
  ident: br0050
  article-title: An operational guide to monitorability
  publication-title: Software Engineering and Formal Methods - 17th International Conference
– volume: 336
  start-page: 209
  year: 2005
  end-page: 234
  ident: br0080
  article-title: Combining test case generation and runtime verification
  publication-title: Theor. Comput. Sci.
– start-page: 15
  year: 2017
  end-page: 28
  ident: br0260
  article-title: A survey of runtime monitoring instrumentation techniques
  publication-title: Proceedings Second International Workshop on Pre- and Post-Deployment Verification Techniques, PrePost@iFM 2017
– start-page: 219
  year: 2017
  end-page: 235
  ident: br0090
  article-title: Trace partitioning and local monitoring for asynchronous components
  publication-title: Software Engineering and Formal Methods - 15th International Conference
– volume: 29
  start-page: 877
  year: 2017
  end-page: 910
  ident: br0550
  article-title: Timed runtime monitoring for multiparty conversations
  publication-title: Form. Asp. Comput.
– volume: 20
  start-page: 651
  year: 2010
  end-page: 674
  ident: br0180
  article-title: Comparing LTL semantics for runtime verification
  publication-title: J. Log. Comput.
– start-page: 573
  year: 2006
  end-page: 586
  ident: br0580
  article-title: PSL model checking and run-time verification via testers
  publication-title: FM 2006: Formal Methods, 14th International Symposium on Formal Methods
– volume: 669
  start-page: 33
  year: 2017
  end-page: 58
  ident: br0200
  article-title: Monitoring networks through multiparty session types
  publication-title: Theor. Comput. Sci.
– start-page: 226
  year: 2014
  end-page: 231
  ident: br0270
  article-title: Online monitoring of distributed systems with a five-valued LTL
  publication-title: International Symposium on Multiple-Valued Logic
– start-page: 259
  year: 2019
  end-page: 275
  ident: br0040
  article-title: The cost of monitoring alone
  publication-title: From Reactive Systems to Cyber-Physical Systems - Essays Dedicated to Scott A. Smolka on the Occasion of His 65th Birthday
– start-page: 90
  year: 2018
  end-page: 112
  ident: br0440
  article-title: Runtime verification: from propositional to first-order temporal logic
  publication-title: Runtime Verification - 18th International Conference
– volume: 3
  start-page: 52:1
  year: 2019
  end-page: 52:29
  ident: br0030
  article-title: Adventures in monitorability: from branching to linear time and back again
  publication-title: Proc. ACM Program. Lang.
– start-page: 1
  year: 2017
  end-page: 13
  ident: br0020
  article-title: On the complexity of determinizing monitors
  publication-title: Implementation and Application of Automata - 22nd International Conference
– year: 2019
  ident: br0060
  article-title: Who is to blame? Runtime verification of distributed objects with active monitors
– start-page: 260
  year: 2003
  end-page: 275
  ident: br0610
  article-title: Generating optimal linear temporal logic monitors by coinduction
  publication-title: Advances in Computing Science
– start-page: 46
  year: 1977
  end-page: 57
  ident: br0570
  article-title: The temporal logic of programs
  publication-title: Symposium on Foundations of Computer Science
– start-page: 37
  year: 2018
  end-page: 55
  ident: br0140
  article-title: Optimal proofs for linear temporal logic on lasso words
  publication-title: Automated Technology for Verification and Analysis - 16th International Symposium
– start-page: 172
  year: 2017
  end-page: 189
  ident: br0300
  article-title: Combining model checking and runtime verification for safe robotics
  publication-title: Runtime Verification - 17th International Conference
– start-page: 8
  year: 2017
  end-page: 29
  ident: br0360
  article-title: A foundation for runtime monitoring
  publication-title: Runtime Verification - 17th International Conference
– reference: E. Bartocci, Y. Falcone, A. Francalanza, G. Reger, Introduction to runtime verification, in:
– year: 1998
  ident: br0250
  publication-title: Handbook of Proof Theory
– start-page: 128
  year: 2018
  end-page: 138
  ident: br0560
  article-title: A session type provider: compile-time API generation of distributed protocols with refinements in f#
  publication-title: Proceedings of the 27th International Conference on Compiler Construction
– start-page: 203
  year: 2018
  end-page: 220
  ident: br0010
  article-title: A framework for parametrized monitorability
  publication-title: Foundations of Software Science and Computation Structures - 21st International Conference
– volume: 209
  start-page: 1491
  year: 2011
  end-page: 1503
  ident: br0490
  article-title: Constructive linear-time temporal logic: proof systems and Kripke semantics
  publication-title: Inf. Comput.
– volume: vol. 42
  start-page: 234
  year: 2014
  end-page: 244
  ident: br0460
  article-title: Model check what you can, runtime verify the rest
  publication-title: HOWARD-60: a Festschrift on the Occasion of Howard Barringer's 60th Birthday. EasyChair
– volume: 19
  start-page: 291
  year: 2001
  end-page: 314
  ident: br0500
  article-title: Model checking of safety properties
  publication-title: Form. Methods Syst. Des.
– start-page: 225
  year: 2017
  end-page: 240
  ident: br0480
  article-title: From model checking to runtime verification and back
  publication-title: Runtime Verification - 17th International Conference
– year: 1995
  ident: br0540
  article-title: Temporal Verification of Reactive Systems: Safety
– start-page: 290
  year: 2015
  end-page: 306
  ident: br0430
  article-title: Tree buffers
  publication-title: Computer Aided Verification - 27th International Conference
– start-page: 27
  year: 2003
  end-page: 39
  ident: br0320
  article-title: Reasoning with temporal logic on truncated paths
  publication-title: Computer Aided Verification
– year: 2019
  ident: br0210
  article-title: Towards a characterization of explainable systems
– volume: 76
  start-page: 216
  year: 2008
  end-page: 225
  ident: br0230
  article-title: Cut-free sequent systems for temporal logic
  publication-title: J. Log. Algebraic Program.
– volume: 20
  start-page: 14
  year: 2011
  ident: br0190
  article-title: Runtime verification for LTL and TLTL
  publication-title: ACM Trans. Softw. Eng. Methodol.
– start-page: 227
  year: 2020
  end-page: 235
  ident: br0240
  article-title: Towards a hybrid verification methodology for communication protocols (short paper)
  publication-title: Formal Techniques for Distributed Objects, Components, and Systems - 40th IFIP WG 6.1 International Conference, FORTE 2020, Held as Part of the 15th International Federated Conference on Distributed Computing Techniques
– start-page: 8:1
  year: 2017
  end-page: 8:19
  ident: br0350
  article-title: Consistently-detecting monitors
  publication-title: 28th International Conference on Concurrency Theory (CONCUR), Schloss Dagstuhl
– reference: .
– volume: 89
  start-page: 161
  year: 1991
  end-page: 177
  ident: br0620
  article-title: Local model-checking in the modal mu-calculus
  publication-title: Theor. Comput. Sci.
– volume: 48
  start-page: 46
  year: 2016
  end-page: 93
  ident: br0160
  article-title: Decentralised LTL monitoring
  publication-title: Form. Methods Syst. Des.
– volume: 54
  start-page: 279
  year: 2019
  end-page: 335
  ident: br0600
  article-title: A survey of challenges for runtime verification from advanced application domains (beyond software)
  publication-title: Form. Methods Syst. Des.
– year: 2008
  ident: br0100
  article-title: Principles of Model Checking
  publication-title: Representation and Mind Series
– start-page: 80
  year: 2018
  end-page: 89
  ident: br0420
  article-title: Explaining explanations: an overview of interpretability of machine learning
  publication-title: 2018 IEEE 5th International Conference on Data Science and Advanced Analytics
– start-page: 582
  year: 2016
  end-page: 594
  ident: br0470
  article-title: Monitors and blame assignment for higher-order session types
  publication-title: Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
– ident: 10.1016/j.jlamp.2020.100636_br0120
  doi: 10.1007/978-3-319-75632-5_1
– volume: 29
  start-page: 877
  year: 2017
  ident: 10.1016/j.jlamp.2020.100636_br0550
  article-title: Timed runtime monitoring for multiparty conversations
  publication-title: Form. Asp. Comput.
  doi: 10.1007/s00165-017-0420-8
– start-page: 181
  year: 2001
  ident: 10.1016/j.jlamp.2020.100636_br0410
  article-title: On the construction of monitors for temporal logic properties
– start-page: 27
  year: 2003
  ident: 10.1016/j.jlamp.2020.100636_br0320
  article-title: Reasoning with temporal logic on truncated paths
– year: 2015
  ident: 10.1016/j.jlamp.2020.100636_br0430
  article-title: Tree buffers
– ident: 10.1016/j.jlamp.2020.100636_br0210
– year: 1992
  ident: 10.1016/j.jlamp.2020.100636_br0220
– start-page: 582
  year: 2016
  ident: 10.1016/j.jlamp.2020.100636_br0470
  article-title: Monitors and blame assignment for higher-order session types
– volume: 76
  start-page: 216
  year: 2008
  ident: 10.1016/j.jlamp.2020.100636_br0230
  article-title: Cut-free sequent systems for temporal logic
  publication-title: J. Log. Algebraic Program.
  doi: 10.1016/j.jlap.2008.02.004
– start-page: 227
  year: 2020
  ident: 10.1016/j.jlamp.2020.100636_br0240
  article-title: Towards a hybrid verification methodology for communication protocols (short paper)
– start-page: 126
  year: 2007
  ident: 10.1016/j.jlamp.2020.100636_br0170
  article-title: The good, the bad, and the ugly, but how ugly is ugly?
– start-page: 163
  year: 1980
  ident: 10.1016/j.jlamp.2020.100636_br0400
  article-title: On the temporal analysis of fairness
– volume: 209
  start-page: 1491
  year: 2011
  ident: 10.1016/j.jlamp.2020.100636_br0490
  article-title: Constructive linear-time temporal logic: proof systems and Kripke semantics
  publication-title: Inf. Comput.
  doi: 10.1016/j.ic.2010.09.008
– volume: 78
  start-page: 293
  year: 2009
  ident: 10.1016/j.jlamp.2020.100636_br0510
  article-title: A brief account of runtime verification
  publication-title: J. Log. Algebraic Program.
  doi: 10.1016/j.jlap.2008.08.004
– volume: 20
  start-page: 14
  year: 2011
  ident: 10.1016/j.jlamp.2020.100636_br0190
  article-title: Runtime verification for LTL and TLTL
  publication-title: ACM Trans. Softw. Eng. Methodol.
  doi: 10.1145/2000799.2000800
– volume: 83
  start-page: 97
  year: 1991
  ident: 10.1016/j.jlamp.2020.100636_br0530
  article-title: Completing the temporal picture
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/0304-3975(91)90041-Y
– year: 2019
  ident: 10.1016/j.jlamp.2020.100636_br0290
  article-title: Explaining violations of properties in control-flow temporal logic
– ident: 10.1016/j.jlamp.2020.100636_br0390
  doi: 10.1007/978-3-319-75632-5_6
– start-page: 260
  year: 2003
  ident: 10.1016/j.jlamp.2020.100636_br0610
  article-title: Generating optimal linear temporal logic monitors by coinduction
– start-page: 1
  year: 2017
  ident: 10.1016/j.jlamp.2020.100636_br0020
  article-title: On the complexity of determinizing monitors
– start-page: 8:1
  year: 2017
  ident: 10.1016/j.jlamp.2020.100636_br0350
  article-title: Consistently-detecting monitors
– start-page: 135
  year: 2001
  ident: 10.1016/j.jlamp.2020.100636_br0450
  article-title: Monitoring programs using rewriting
– volume: 3
  start-page: 52:1
  issue: POPL
  year: 2019
  ident: 10.1016/j.jlamp.2020.100636_br0030
  article-title: Adventures in monitorability: from branching to linear time and back again
  publication-title: Proc. ACM Program. Lang.
  doi: 10.1145/3290365
– start-page: 259
  year: 2019
  ident: 10.1016/j.jlamp.2020.100636_br0040
  article-title: The cost of monitoring alone
– year: 2000
  ident: 10.1016/j.jlamp.2020.100636_br0640
  article-title: Basic Proof Theory
  doi: 10.1017/CBO9781139168717
– ident: 10.1016/j.jlamp.2020.100636_br0060
– start-page: 8
  year: 2017
  ident: 10.1016/j.jlamp.2020.100636_br0360
  article-title: A foundation for runtime monitoring
– year: 1998
  ident: 10.1016/j.jlamp.2020.100636_br0250
– start-page: 433
  year: 2019
  ident: 10.1016/j.jlamp.2020.100636_br0050
  article-title: An operational guide to monitorability
– start-page: 128
  year: 2018
  ident: 10.1016/j.jlamp.2020.100636_br0560
  article-title: A session type provider: compile-time API generation of distributed protocols with refinements in f#
– volume: 12
  start-page: 151
  year: 2005
  ident: 10.1016/j.jlamp.2020.100636_br0590
  article-title: Rewriting-based techniques for runtime verification
  publication-title: Autom. Softw. Eng.
  doi: 10.1007/s10515-005-6205-y
– start-page: 203
  year: 2018
  ident: 10.1016/j.jlamp.2020.100636_br0010
  article-title: A framework for parametrized monitorability
– volume: vol. 10457
  year: 2018
  ident: 10.1016/j.jlamp.2020.100636_br0110
– volume: 16
  start-page: 1
  year: 2017
  ident: 10.1016/j.jlamp.2020.100636_br0310
  article-title: Slave to the algorithm? Why a ‘right to an explanation’ is probably not the remedy you are looking for
  publication-title: Duke Law Technol. Rev.
– volume: 2
  start-page: 117
  year: 1987
  ident: 10.1016/j.jlamp.2020.100636_br0070
  article-title: Recognizing safety and liveness
  publication-title: Distrib. Comput.
  doi: 10.1007/BF01782772
– start-page: 145
  year: 2016
  ident: 10.1016/j.jlamp.2020.100636_br0340
  article-title: A theory of monitors (extended abstract)
– volume: 54
  start-page: 279
  year: 2019
  ident: 10.1016/j.jlamp.2020.100636_br0600
  article-title: A survey of challenges for runtime verification from advanced application domains (beyond software)
  publication-title: Form. Methods Syst. Des.
  doi: 10.1007/s10703-019-00337-w
– start-page: 69
  year: 2019
  ident: 10.1016/j.jlamp.2020.100636_br0130
  article-title: Automatic failure explanation in CPS models
– volume: 336
  start-page: 209
  year: 2005
  ident: 10.1016/j.jlamp.2020.100636_br0080
  article-title: Combining test case generation and runtime verification
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/j.tcs.2004.11.007
– start-page: 581
  year: 2015
  ident: 10.1016/j.jlamp.2020.100636_br0280
  article-title: An LTL proof system for runtime verification
– start-page: 226
  year: 2014
  ident: 10.1016/j.jlamp.2020.100636_br0270
  article-title: Online monitoring of distributed systems with a five-valued LTL
– ident: 10.1016/j.jlamp.2020.100636_br0330
– year: 2008
  ident: 10.1016/j.jlamp.2020.100636_br0100
  article-title: Principles of Model Checking
– start-page: 219
  year: 2017
  ident: 10.1016/j.jlamp.2020.100636_br0090
  article-title: Trace partitioning and local monitoring for asynchronous components
– volume: 89
  start-page: 161
  year: 1991
  ident: 10.1016/j.jlamp.2020.100636_br0620
  article-title: Local model-checking in the modal mu-calculus
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/0304-3975(90)90110-4
– start-page: 37
  year: 2018
  ident: 10.1016/j.jlamp.2020.100636_br0140
  article-title: Optimal proofs for linear temporal logic on lasso words
– start-page: 573
  year: 2006
  ident: 10.1016/j.jlamp.2020.100636_br0580
  article-title: PSL model checking and run-time verification via testers
– start-page: 90
  year: 2018
  ident: 10.1016/j.jlamp.2020.100636_br0440
  article-title: Runtime verification: from propositional to first-order temporal logic
– volume: 82
  start-page: 186
  year: 2013
  ident: 10.1016/j.jlamp.2020.100636_br0380
  article-title: Distributed system contract monitoring
  publication-title: J. Log. Algebraic Methods Program.
  doi: 10.1016/j.jlap.2013.04.001
– start-page: 436
  year: 2010
  ident: 10.1016/j.jlamp.2020.100636_br0630
  article-title: Optimized temporal monitors for SystemC
– start-page: 356
  year: 2017
  ident: 10.1016/j.jlamp.2020.100636_br0150
  article-title: Runtime verification of temporal properties over out-of-order data streams
– start-page: 225
  year: 2017
  ident: 10.1016/j.jlamp.2020.100636_br0480
  article-title: From model checking to runtime verification and back
– volume: 19
  start-page: 291
  year: 2001
  ident: 10.1016/j.jlamp.2020.100636_br0500
  article-title: Model checking of safety properties
  publication-title: Form. Methods Syst. Des.
  doi: 10.1023/A:1011254632723
– start-page: 172
  year: 2017
  ident: 10.1016/j.jlamp.2020.100636_br0300
  article-title: Combining model checking and runtime verification for safe robotics
– volume: vol. 42
  start-page: 234
  year: 2014
  ident: 10.1016/j.jlamp.2020.100636_br0460
  article-title: Model check what you can, runtime verify the rest
– start-page: 80
  year: 2018
  ident: 10.1016/j.jlamp.2020.100636_br0420
  article-title: Explaining explanations: an overview of interpretability of machine learning
– volume: 48
  start-page: 46
  year: 2016
  ident: 10.1016/j.jlamp.2020.100636_br0160
  article-title: Decentralised LTL monitoring
  publication-title: Form. Methods Syst. Des.
  doi: 10.1007/s10703-016-0253-8
– start-page: 46
  year: 1977
  ident: 10.1016/j.jlamp.2020.100636_br0570
  article-title: The temporal logic of programs
– start-page: 15
  year: 2017
  ident: 10.1016/j.jlamp.2020.100636_br0260
  article-title: A survey of runtime monitoring instrumentation techniques
– volume: 20
  start-page: 651
  year: 2010
  ident: 10.1016/j.jlamp.2020.100636_br0180
  article-title: Comparing LTL semantics for runtime verification
  publication-title: J. Log. Comput.
  doi: 10.1093/logcom/exn075
– volume: 51
  start-page: 87
  year: 2017
  ident: 10.1016/j.jlamp.2020.100636_br0370
  article-title: Monitorability for the Hennessy-Milner logic with recursion
  publication-title: Form. Methods Syst. Des.
  doi: 10.1007/s10703-017-0273-z
– volume: 669
  start-page: 33
  year: 2017
  ident: 10.1016/j.jlamp.2020.100636_br0200
  article-title: Monitoring networks through multiparty session types
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/j.tcs.2017.02.009
– year: 1995
  ident: 10.1016/j.jlamp.2020.100636_br0540
SSID ssj0001687831
Score 2.2173932
Snippet Monitors in Runtime Verification are often constructed as black boxes: they provide verdicts on whether a property is satisfied or violated by the executing...
SourceID crossref
elsevier
SourceType Enrichment Source
Index Database
Publisher
StartPage 100636
SubjectTerms Correct monitor synthesis
Explainability
Interpretability
Linear temporal logic
Proof systems
Runtime verification
Title Computer says no: Verdict explainability for runtime monitors using a local proof system
URI https://dx.doi.org/10.1016/j.jlamp.2020.100636
Volume 119
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LTwIxEG4QLl58G_GVHjy6Abq7bdcbIRLUyEUx3DbdPgyEV2BN5N_b6XZRE8PBa7OTNDPtzLft128QulGKGWgeEPA4EXDNmAVCKxHYv7CWzGyF4Rkc6D_3aW8QPQ7jYQV1yrcwQKv0ub_I6S5b-5GG92ZjMRo1XghgBwIlLARhMr6DaiRMqF3atfbDU6__fdRCOeOuMyGYBGBT6g85ptfY-h6kK4njDFCn1vxHjfpRd7oHaM8DRtwu5nSIKnp2hPbLZgzY781jNNwMrcR6hWfzO_ymbfRljvXnYuIeSQEPdo0tTMWgNzCaajx1W3q5wsB_f8cCu9qGbVqdG1yoPJ-gQff-tdMLfNuEQNp6lAeKicRksREhV1QyQjPDJRNEKrg0E2FMIxGrWHKjmQllErWaKokY4YKSjDVFeIqqs_lMnyEcUWMRWEx1RHlkQ2gxLlEtCSiRgPRfHZHSUan0muLQ2mKSluSxceq8m4J308K7dXS7MVoUkhrbP6dlBNJfKyO1SX-b4fl_DS_QLgHmiuNmX6JqvvzQVxZ65Nm1X1pfm_7W5Q
linkProvider Elsevier
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LTwIxEJ4gHPTi24jPHjy6Abq73eKNEAnI4yIYbptu2zUQXgFM5N_b6e6iJoaD12YnaWbamW_br98APCgVxNg8wOF-VeA1Y-QIrYRj_sIqMjIVhkd4oN_tsebAexn6wxzUs7cwSKtMc3-S0222TkdKqTdLi9Go9EoRO1AsYS4Kk_E9KKA6lZ-HQq3Vbva-j1oYD7jtTIgmDtpk-kOW6TU2vkfpSmo5A8yqNf9Ro37UncYxHKaAkdSSOZ1ATs9O4ShrxkDSvXkGw-3QSmxWZDZ_Im_aRF-uif5cTOwjKeTBboiBqQT1BkZTTaZ2Sy9XBPnv70QQW9uISavzmCQqz-cwaDz3600nbZvgSFOP1o4KRDWO_Fi4XDEZUBbFXAaCSoWXZsL1mSd85Use6yB2ZdWrlFXVCygXjEZBWbgXkJ_NZ_oSiMdig8B8pj3GPRNCg3GpqkhEiRSl_4pAM0eFMtUUx9YWkzAjj41D690QvRsm3i3C49ZokUhq7P6cZREIf62M0CT9XYZX_zW8h_1mv9sJO61e-xoOKLJYLE_7BvLr5Ye-NTBkHd2ly-wLxc_Zyw
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Computer+says+no%3A+Verdict+explainability+for+runtime+monitors+using+a+local+proof+system&rft.jtitle=Journal+of+logical+and+algebraic+methods+in+programming&rft.au=Francalanza%2C+Adrian&rft.au=Cini%2C+Clare&rft.date=2021-02-01&rft.pub=Elsevier+Inc&rft.issn=2352-2208&rft.volume=119&rft_id=info:doi/10.1016%2Fj.jlamp.2020.100636&rft.externalDocID=S2352220820301218
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2352-2208&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2352-2208&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2352-2208&client=summon