Handbook of theoretical computer science (vol. B)
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Theoretical Computer Science
Handbook of formal languages, vol. 3
A lightweight architecture for program execution monitoring
Proceedings of the 1998 ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering
Verisim: Formal Analysis of Network Simulations
IEEE Transactions on Software Engineering
A Configurable Automatic Instrumentation Tool for ANSI C
ASE '98 Proceedings of the 13th IEEE international conference on Automated software engineering
Early detection of timing constraint violation at runtime
RTSS '97 Proceedings of the 18th IEEE Real-Time Systems Symposium
Enforceable Security Policies
Foundations for the run-time analysis of software systems
Foundations for the run-time analysis of software systems
Information extraction for run-time formal analysis
Information extraction for run-time formal analysis
Java-MaC: A Run-Time Assurance Approach for Java Programs
Formal Methods in System Design
Computability classes for enforcement mechanisms
ACM Transactions on Programming Languages and Systems (TOPLAS)
You should better enforce than verify
RV'10 Proceedings of the First international conference on Runtime verification
Monitorability of stochastic dynamical systems
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
| Hi-index | 0.00 |
As the complexity of systems grows, the correctness of systems becomes harder to achieve. This difficulty promotes a run-time monitoring technique as a promising complementary methodology for higher system assurance. To formalize and understand the computational nature of run-time monitoring is a key to utilize this valuable technique. In this paper, we formalize the notion of run-time monitoring of reactive systems in terms of ω-languages and show that the language of Monitoring and Checking (MaC) architecture, called MEDL, is expressive enough for the run-time monitoring. First, we provide a descriptive theory for the class of monitorable languages and show that this class of languages coincides with the class Π01 of the Arithmetic hierarchy. Second, we introduce a class of automata with storage that can be used to describe the class of monitorable languages using connections to the Arithmetic hierarchy. Finally, we show that MEDL can express the class of monitorable languages via the correspondence between MEDL and the automata with storage.