Theoretical Computer Science
Synthesizing Monitors for Safety Properties
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
CIL: Intermediate Language and Tools for Analysis and Transformation of C Programs
CC '02 Proceedings of the 11th International Conference on Compiler Construction
Model Checking of Safety Properties
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Automata-Based Verification of Temporal Properties on Running Programs
Proceedings of the 16th IEEE international conference on Automated software engineering
Monitoring Programs Using Rewriting
Proceedings of the 16th IEEE international conference on Automated software engineering
Java-MaC: A Run-Time Assurance Approach for Java Programs
Formal Methods in System Design
Efficient monitoring of safety properties
International Journal on Software Tools for Technology Transfer (STTT) - Special section on tools and algorithms for the construction and analysis of systems
MiBench: A free, commercially representative embedded benchmark suite
WWC '01 Proceedings of the Workload Characterization, 2001. WWC-4. 2001 IEEE International Workshop
Synthesizing Monitors for Safety Properties: This Time with Calls and Returns
Runtime Verification
DMaC: Distributed Monitoring and Checking
Runtime Verification
Temporal Assertions using AspectJ
Electronic Notes in Theoretical Computer Science (ENTCS)
Sampling-based program execution monitoring
Proceedings of the ACM SIGPLAN/SIGBED 2010 conference on Languages, compilers, and tools for embedded systems
Comparing LTL Semantics for Runtime Verification
Journal of Logic and Computation
Copilot: a hard real-time runtime monitor
RV'10 Proceedings of the First international conference on Runtime verification
Runtime Verification for LTL and TLTL
ACM Transactions on Software Engineering and Methodology (TOSEM)
Efficient monitoring of ω-languages
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
PSL model checking and run-time verification via testers
FM'06 Proceedings of the 14th international conference on Formal Methods
Software monitoring with controllable overhead
International Journal on Software Tools for Technology Transfer (STTT) - Runtime Verification
Runtime monitoring of time-sensitive systems
RV'11 Proceedings of the Second international conference on Runtime verification
Runtime verification with state estimation
RV'11 Proceedings of the Second international conference on Runtime verification
Efficient techniques for near-optimal instrumentation in time-triggered runtime verification
RV'11 Proceedings of the Second international conference on Runtime verification
Runtime verification for ultra-critical systems
RV'11 Proceedings of the Second international conference on Runtime verification
Runtime verification of real-time embedded systems
Proceedings of the tenth ACM international conference on Embedded software
RiTHM: a tool for enabling time-triggered runtime verification for C programs
Proceedings of the 2013 9th Joint Meeting on Foundations of Software Engineering
DIME: time-aware dynamic binary instrumentation using rate-based resource allocation
Proceedings of the Eleventh ACM International Conference on Embedded Software
Copilot: monitoring embedded systems
Innovations in Systems and Software Engineering
Runtime verification of microcontroller binary code
Science of Computer Programming
Hi-index | 0.00 |
The literature of runtime verification mostly focuses on event-triggered solutions, where a monitor is invoked by every change in the state of the system and evaluates properties of the system. This constant invocation introduces two major drawbacks to the system under scrutiny at run time: (1) significant overhead and (2) unpredictability. To circumvent the latter drawback, in this paper, we introduce a time-triggered approach, where the monitor frequently takes samples from the system to analyze the system's health. We propose formal semantics of sampling-based monitoring and discuss how to optimize the sampling period using minimum auxiliary memory. We show that such optimization is NP-complete and consequently introduce a mapping to Integer Linear Programming. Experiments on benchmark applications show that our approach introduces bounded overhead and effectively reduces involvement of the monitor at run time using negligible auxiliary memory.