Monitoring hypernode logic over infinite domains

Chalupa M, Henzinger TA, Oliveira da Costa AA. 2025. Monitoring hypernode logic over infinite domains. 25th International Conference on Runtime Verification. RV: Runtime Verification, LNCS, vol. 16087, 417–437.

Download (ext.)

Conference Paper | Published | English

Corresponding author has ISTA affiliation

Series Title
LNCS
Abstract
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, an extension 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.
Publishing Year
Date Published
2025-09-13
Proceedings Title
25th International Conference on Runtime Verification
Publisher
Springer Nature
Acknowledgement
This work was supported in part by the ERC-2020-AdG 101020093 and in part by the FWF-2022-SFB F8502 (SPyCoDe).
Volume
16087
Page
417-437
Conference
RV: Runtime Verification
Conference Location
Graz, Austria
Conference Date
2025-09-15 – 2025-09-19
ISSN
eISSN
IST-REx-ID

Cite this

Chalupa M, Henzinger TA, Oliveira da Costa AA. Monitoring hypernode logic over infinite domains. In: 25th International Conference on Runtime Verification. Vol 16087. Springer Nature; 2025:417-437. doi:10.1007/978-3-032-05435-7_23
Chalupa, M., Henzinger, T. A., & Oliveira da Costa, A. A. (2025). Monitoring hypernode logic over infinite domains. In 25th International Conference on Runtime Verification (Vol. 16087, pp. 417–437). Graz, Austria: Springer Nature. https://doi.org/10.1007/978-3-032-05435-7_23
Chalupa, Marek, Thomas A Henzinger, and Ana A Oliveira da Costa. “Monitoring Hypernode Logic over Infinite Domains.” In 25th International Conference on Runtime Verification, 16087:417–37. Springer Nature, 2025. https://doi.org/10.1007/978-3-032-05435-7_23.
M. Chalupa, T. A. Henzinger, and A. A. Oliveira da Costa, “Monitoring hypernode logic over infinite domains,” in 25th International Conference on Runtime Verification, Graz, Austria, 2025, vol. 16087, pp. 417–437.
Chalupa M, Henzinger TA, Oliveira da Costa AA. 2025. Monitoring hypernode logic over infinite domains. 25th International Conference on Runtime Verification. RV: Runtime Verification, LNCS, vol. 16087, 417–437.
Chalupa, Marek, et al. “Monitoring Hypernode Logic over Infinite Domains.” 25th International Conference on Runtime Verification, vol. 16087, Springer Nature, 2025, pp. 417–37, doi:10.1007/978-3-032-05435-7_23.
All files available under the following license(s):
Copyright Statement:
This Item is protected by copyright and/or related rights. [...]

Link(s) to Main File(s)
Access Level
OA Open Access

Export

Marked Publications

Open Data ISTA Research Explorer

Sources

arXiv 2508.02301

Search this title in

Google Scholar