๐ฎ
๐ฎ
The Ethereal
Control-Flow Residual Analysis for Symbolic Automata
August 24, 2017 ยท The Ethereal ยท ๐ PrePost@iFM
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Shaun Azzopardi, Christian Colombo, Gordon J. Pace
arXiv ID
1708.07230
Category
cs.LO: Logic in CS
Cross-listed
cs.SE
Citations
7
Venue
PrePost@iFM
Last Checked
5 months ago
Abstract
Where full static analysis of systems fails to scale up due to system size, dynamic monitoring has been increasingly used to ensure system correctness. The downside is, however, runtime overheads which are induced by the additional monitoring code instrumented. To address this issue, various approaches have been proposed in the literature to use static analysis in order to reduce monitoring overhead. In this paper we generalise existing work which uses control-flow static analysis to optimise properties specified as automata, and prove how similar analysis can be applied to more expressive symbolic automata - enabling reduction of monitoring instrumentation in the system, and also monitoring logic. We also present empirical evidence of the effectiveness of this approach through an analysis of the effect of monitoring overheads in a financial transaction system.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
๐ Similar Papers
In the same crypt โ Logic in CS
๐ฎ
๐ฎ
The Ethereal
Safe Reinforcement Learning via Shielding
๐ฎ
๐ฎ
The Ethereal
Formal Verification of Piece-Wise Linear Feed-Forward Neural Networks
๐ฎ
๐ฎ
The Ethereal
Heterogeneous substitution systems revisited
๐ฎ
๐ฎ
The Ethereal
Omega-Regular Objectives in Model-Free Reinforcement Learning
๐ฎ
๐ฎ
The Ethereal