Abstract: Monitoring distributed applications that do not share a global clock is

highly challenging as the monitor has to potentially deal with a combinatorial

explosion at run time. In this talk, I will present our recent efforts on runtime

monitoring of distributed systems. First, we make a practical assumption that the

distributed system under scrutiny is augmented with a clock synchronization

algorithm that guarantees bounded clock skew among all processes. Second, we do

not make any assumptions about the structure of predicates that form the specification.

This relaxation allows us to monitor a wide range of applications that was

not possible before. Subsequently, we propose a distributed monitoring algorithm by

employing SMT solving techniques. Third, given the fact that distributed applications

nowadays run on massive cloud services, we extend our solution to a parallel monitoring

algorithm to utilize the available computing infrastructure. Our focus has been on

discrete event systems as well as continuous signals. I will also present real-world case

studies and demonstrate that scalable online monitoring of distributed applications is

within our reach.

Short Bio: Borzoo Bonakdarpour is currently an Associate Professor of Computer Science
at Michigan State University. His research interests include formal methods and its
application in distributed systems, computer security, and cyber-physical systems.
He has published more than 90 articles and papers in top journals and conferences.
His work in these areas have received multiple best paper awards from highly
prestigious conferences, including, SRDS'17, SSS'14, and SIES'10. He chaired the
Technical Program Committee of the SRDS'20, SSS’16, and RV’14 conferences.