Candidate: Sean Kauffman
Title: Monitorability Over Unreliable Channels
Date: November 25, 2019
Time: 3:00 PM
Place: EIT 3142
Supervisor(s): Fischmeister, Sebastian
Abstract:
In Runtime Verification (RV), monitoring a system means checking an execution trace of a program for satisfactions and violations of properties. The question of which properties can be effectively monitored over ideal channels has mostly been answered in the literature. However, program monitoring is often deployed for remote systems where communications may be unreliable. In this talk, I address the question of what properties are monitorable over an unreliable communication channel. I describe the different types of mutations that may be introduced to an execution trace and examine their effects on program monitoring. I propose a fixed-parameter tractable algorithm for determining the immunity of a finite automaton to a trace mutation and show how it can be used to classify w-regular properties as monitorable over channels with that mutation.