12 citations · 13 across the 2 of their papers we have counts for
3 papers
cs.LO2021★ 12 cited
Towards an Automatic Proof of Lamport's Paxos
Aman Goel, Karem A. Sakallah
Lamport's celebrated Paxos consensus protocol is generally viewed as a complex hard-to-understand algorithm. Notwithstanding its complexity, in this paper, we take a step towards a…
cs.LO2021
On Symmetry and Quantification: A New Approach to Verify Distributed Protocols
Aman Goel, Karem A. Sakallah
Proving that an unbounded distributed protocol satisfies a given safety property amounts to finding a quantified inductive invariant that implies the property for all possible inst…
cs.DS2012★ 1 cited
Conflict Anticipation in the Search for Graph Automorphisms
Hadi Katebi, Karem A. Sakallah, Igor L. Markov
Effective search for graph automorphisms allows identifying symmetries in many discrete structures, ranging from chemical molecules to microprocessor circuits. Using this type of s…