.png){kind=icon}
.png){kind=icon}
Return
Monitoring Hypernode Logic Over Infinite Domains
.png){kind=icon}
PRE
AI
DOI：10.1007/978-3-032-05435-7_23.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We propose a monitoring approach for hyperproperties where the system's observations range over infinite domains. The specifications are given as formulas of symbolic hypernode logic, anextension of earlier versions of hypernode logic that supports events with data. We demonstrate how to translate terms of symbolic hypernode logic into multi-tape symbolic transducers and we present a monitoring algorithm for universally quantified formulas that is based on this translation. We evaluate our approach against the previous approach for monitoring hypernode logic, and we also compare it to other monitors for hyperproperties.
Keywords:
symbolic automata
symbolic transducers
hyperproperties
runtime verification
monitoring
k-safety
Journal
R
IF:
0
Papers:
27
Citations:
0