Title: Crash-Resilient Decentralized Synchronous Runtime Verification
Abstract: Runtime verification is a technique, where a monitor process extracts information from a running system in order to detect executions violating or satisfying a given correctness specification. In this paper, we consider runtime verification of synchronous distributed systems, where a decentralized set of monitors that only have a partial view of the system are subject to crash failures. In this context, it is unavoidable that monitors may have different views of the underlying system, and, therefore, have different opinions about the correctness property. We propose an automata-based synchronous monitoring algorithm that copes with t crash monitor failures. Moreover, local monitors do not communicate their explicit reading of the underlying system. Rather, they emit a symbolic verdict that efficiently encodes their partial views. This significantly reduces the communication overhead. To this end, we also introduce an (offline) SMT-based monitor synthesis algorithm, which results in minimizing the size of monitoring messages
Bio: Ritam Ganguly is a PhD student at Iowa State University, Department of Computer Science. Previously he attended St. Thomas College of Engineering and Technology (aff. Maulana Abul Alam Azad University of Technology f.k.a. West Bengal University of Technology) from 2013-2017 where he received his Bachelors of Technology (B.Tech) in July 2017. In his undergraduate years his research was on Data privacy, specifically on Secret sharing of data. Now, his research involves Runtime Verification of Distributed System.