Being Correct Is Not Enough: Efficient Verification Using Robust Linear Temporal Logic

DOI10.1145/3491216zbMath1502.68178arXiv2102.11991OpenAlexW3133387630MaRDI QIDQ5034230

Matthew Philippe, Daniel Neider, Tzanis Anevlavis, Paulo Tabuada

Publication date: 24 February 2022

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2102.11991

zbMATH Keywords

robustness in temporal logicsrobustness in verification

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

Related Items (4)

Specifiable robustness in reactive synthesis ⋮ From LTL to rLTL monitoring: improved monitorability through robust semantics ⋮ Temporal Robustness of Stochastic Signals ⋮ Risk verification of stochastic systems with neural network controllers

This page was built for publication: Being Correct Is Not Enough: Efficient Verification Using Robust Linear Temporal Logic