Keynotes
By Borzoo Bonakdarpour
Monitoring distributed applications that do not share a global clock is highly challenging as the monitor has to potentially deal with a combinatorial enumeration at run time. We also have every reason to believe that distributed monitors are not necessarily perfect and monitors are subject to all types of faults that normal distributed processes are. In this talk, I will present our results on runtime verification of distributed systems and discuss a landscape of solved and open problems for different models of distributed computation. I will also discuss real-world case studies and demonstrate that scalable online monitoring of distributed applications is within our reach.
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 120 articles and papers in top journals and conferences. His work in these areas have received multiple best paper awards from highly prestigious conferences, including, RV’21, SRDS'17, SSS'14, and SIES'10. He chaired the Technical Program Committee of the SRDS'20, SSS’16, and RV’14 conferences.
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 120 articles and papers in top journals and conferences. His work in these areas have received multiple best paper awards from highly prestigious conferences, including, RV’21, SRDS'17, SSS'14, and SIES'10. He chaired the Technical Program Committee of the SRDS'20, SSS’16, and RV’14 conferences.