Quantitative and Approximate Monitoring

In runtime verification, a monitor watches a trace of a system and, if possible, decides after observing each finite prefix whether or not the unknown infinite trace satisfies a given specification. We generalize the theory of runtime verification to monitors that attempt to estimate numerical value...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science s. 1 - 14
Hlavní autori: Henzinger, Thomas A., Ege Sarac, N.
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 29.06.2021
Predmet:
Computer science
Monitoring
Registers
Runtime
Time factors
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract In runtime verification, a monitor watches a trace of a system and, if possible, decides after observing each finite prefix whether or not the unknown infinite trace satisfies a given specification. We generalize the theory of runtime verification to monitors that attempt to estimate numerical values of quantitative trace properties (instead of attempting to conclude boolean values of trace specifications), such as maximal or average response time along a trace. Quantitative monitors are approximate: with every finite prefix, they can improve their estimate of the infinite trace's unknown property value. Consequently, quantitative monitors can be compared with regard to a precision-cost trade-off: better approximations of the property value require more monitor resources, such as states (in the case of finite-state monitors) or registers, and additional resources yield better approximations. We introduce a formal framework for quantitative and approximate monitoring, show how it conservatively generalizes the classical boolean setting for monitoring, and give several precision-cost trade-offs for monitors. For example, we prove that there are quantitative properties for which every additional register improves monitoring precision.
AbstractList In runtime verification, a monitor watches a trace of a system and, if possible, decides after observing each finite prefix whether or not the unknown infinite trace satisfies a given specification. We generalize the theory of runtime verification to monitors that attempt to estimate numerical values of quantitative trace properties (instead of attempting to conclude boolean values of trace specifications), such as maximal or average response time along a trace. Quantitative monitors are approximate: with every finite prefix, they can improve their estimate of the infinite trace's unknown property value. Consequently, quantitative monitors can be compared with regard to a precision-cost trade-off: better approximations of the property value require more monitor resources, such as states (in the case of finite-state monitors) or registers, and additional resources yield better approximations. We introduce a formal framework for quantitative and approximate monitoring, show how it conservatively generalizes the classical boolean setting for monitoring, and give several precision-cost trade-offs for monitors. For example, we prove that there are quantitative properties for which every additional register improves monitoring precision.
Author Henzinger, Thomas A.
Ege Sarac, N.
Author_xml – sequence: 1
  givenname: Thomas A.
  surname: Henzinger
  fullname: Henzinger, Thomas A.
  email: tah@ist.ac.at
  organization: IST,Austria
– sequence: 2
  givenname: N.
  surname: Ege Sarac
  fullname: Ege Sarac, N.
  email: ege.sarac@ist.ac.at
  organization: IST,Austria
BookMark eNotj81Kw0AURkdQUGueQJDsXCXeezM_mWUJWgsREXVdbptbGdFJSEbRtzdgV9_unPOdq-PYR1HqCqFEBH_TrptnQ2R1SUBYeu3AaHekMu9qtNZoXXtjT1U2Te8AQLVD0P5MXT99cUwhcQrfknPs8uUwjP1P-OQk-UMfQ-rHEN8u1MmePybJDrtQr3e3L8190T6u1s2yLZhqnwoU6khrEdKVuI7NjmcvgLW0Bdxpb2okBouGiedAC8Y4s_WC1R5BpFqoy39uEJHNMM4d4-_mcKf6A0uiQTU
ContentType Conference Proceeding
DBID 6IE
6IH
CBEJK
RIE
RIO
DOI 10.1109/LICS52264.2021.9470547
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan (POP) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP) 1998-present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISBN 9781665448956
1665448954
EndPage 14
ExternalDocumentID 9470547
Genre orig-research
GrantInformation_xml – fundername: Austrian Science Fund
  funderid: 10.13039/501100002428
GroupedDBID 6IE
6IH
ACM
ALMA_UNASSIGNED_HOLDINGS
APO
CBEJK
GUFHI
LHSKQ
RIE
RIO
ID FETCH-LOGICAL-a289t-1e2d244ee243e7da5ca89500662b01c495812a0615a2a547605575b9e13f10ee3
IEDL.DBID RIE
ISICitedReferencesCount 10
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000947350400021&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
IngestDate Wed Aug 27 02:26:37 EDT 2025
IsPeerReviewed false
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-a289t-1e2d244ee243e7da5ca89500662b01c495812a0615a2a547605575b9e13f10ee3
PageCount 14
ParticipantIDs ieee_primary_9470547
PublicationCentury 2000
PublicationDate 2021-June-29
PublicationDateYYYYMMDD 2021-06-29
PublicationDate_xml – month: 06
  year: 2021
  text: 2021-June-29
  day: 29
PublicationDecade 2020
PublicationTitle Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science
PublicationTitleAbbrev LICS
PublicationYear 2021
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0002871049
Score 2.277103
Snippet In runtime verification, a monitor watches a trace of a system and, if possible, decides after observing each finite prefix whether or not the unknown infinite...
SourceID ieee
SourceType Publisher
StartPage 1
SubjectTerms Computer science
Monitoring
Registers
Runtime
Time factors
Title Quantitative and Approximate Monitoring
URI https://ieeexplore.ieee.org/document/9470547
WOSCitedRecordID wos000947350400021&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PS8MwFH5sw4OnqZv4mx4EL3ZrmrRpjjIcCmNM_MFuI2neYJdOtlX8881La0Xw4i0UQpqG1-_LS77vAVxzdLCtYxlakYlQYMrokNCGXKOUOsqN9WbPbxM5nWbzuZq14LbRwiCiv3yGA2r6s3y7zktKlQ2VkI5hyDa0pUwrrVaTTyHm79huLQJmkRpOHkfPxC4ocxKzQd35VxUVDyLj7v-GP4D-jxovmDU4cwgtLI6g-12OIaijswc3T6UuvGbM_cECXdjgjgzDP1eOlGJQBS9l8frwOr5_GT2EdR2EULvt0C5kGFuHwoix4CitTnKdqcR7t5uI5W6L41BaEzfRsXYvmJKvVmIUMr5kESI_hk6xLvAEAotkA8ptRrola7gSRiljXBgnKrJ2eQo9mvfivbK6WNRTPvv78Tns06elm1OxuoDOblPiJezlH7vVdnPl1-cL-uOPNg
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PS8MwFH7MKehp6ib-tgfBi93aJF2aowzHhnVMnLLbSJo32KWTuYl_vnlZnQhevJVA4aXl5fvyku97ANccHWxrJkMrUhEKbMd0SGhDrlFKHeXGerPn10wOBul4rIYVuN1oYRDRXz7DJj36s3w7z1dUKmspIR3DkFuwnQjBorVaa1NRIe7v-G4pA44j1cr6nWfiF1Q7YXGzfP1XHxUPI93a_wLYh8aPHi8YbpDmACpYHELtuyFDUOZnHW6eVrrwqjG3hgW6sMEdWYZ_zhwtxWCdvlTHa8BL937U6YVlJ4RQuw3RMoyRWYfDiExwlFYnuU5V4t3bTRTnbpPjcFoTO9FMuwDb5KyVGIUxn8YRIj-CajEv8BgCi2QEym1KyiVruBJGKWNcIicqsnZ6AnWa9-RtbXYxKad8-vfwFez2Ro_ZJOsPHs5gjz4z3aNi6hyqy8UKL2An_1jO3heX_l99AaKNkn0
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%3Abook&rft.genre=proceeding&rft.title=Proceedings+of+the+36th+Annual+ACM%2FIEEE+Symposium+on+Logic+in+Computer+Science&rft.atitle=Quantitative+and+Approximate+Monitoring&rft.au=Henzinger%2C+Thomas+A.&rft.au=Ege+Sarac%2C+N.&rft.date=2021-06-29&rft.pub=IEEE&rft.spage=1&rft.epage=14&rft_id=info:doi/10.1109%2FLICS52264.2021.9470547&rft.externalDocID=9470547