Cardinalities and Universal Quantifiers for Verifying Parameterized Systems
Parallel and distributed systems rely on intricate protocols to manage shared resources and synchronize, i.e., to manage how many processes are in a particular state. Effective verification of such systems requires universally quantification to reason about parameterized state and cardinalities tracking sets of processes, messages, failures to adequately capture protocol logic. In this paper we present \Tool, an automatic invariant synthesis method that integrates cardinality-based reasoning and universal quantification. The resulting increase of expressiveness allows \Tool to verify, for the first time, a representative collection of intricate parameterized protocols.
Fri 17 Jun
|09:00 - 09:30|
Nikolaj BjørnerMicrosoft Research, Klaus GleissenthallTechnische Universität München, Andrey RybalchenkoMicrosoft ResearchMedia Attached
|09:30 - 10:00|
Oded PadonTel Aviv University, Kenneth L. McMillanMicrosoft Research, Aurojit Panda, Mooly SagivTel Aviv University, Sharon ShohamMedia Attached