37 citations · 71 across the 4 of their papers we have counts for
5 papers
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…
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…
Graph Symmetry Detection and Canonical Labeling: Differences and Synergies
Hadi Katebi, Karem A. Sakallah, Igor L. Markov
Symmetries of combinatorial objects are known to complicate search algorithms, but such obstacles can often be removed by detecting symmetries early and discarding symmetric subpro…
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…
Breaking Instance-Independent Symmetries In Exact Graph Coloring
F. A. Aloul, I. L. Markov, A. Ramani +1
Code optimization and high level synthesis can be posed as constraint satisfaction and optimization problems, such as graph coloring used in register allocation. Graph coloring is…