English

Control-Flow Residual Analysis for Symbolic Automata

Logic in Computer Science 2017-08-25 v1 Software Engineering

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.

Keywords

Cite

@article{arxiv.1708.07230,
  title  = {Control-Flow Residual Analysis for Symbolic Automata},
  author = {Shaun Azzopardi and Christian Colombo and Gordon J. Pace},
  journal= {arXiv preprint arXiv:1708.07230},
  year   = {2017}
}

Comments

In Proceedings PrePost 2017, arXiv:1708.06889

R2 v1 2026-06-22T21:22:17.732Z