We present two fully mechanized proofs of Dilworthâ€™s and Mirskyâ€™s theorems in the Coq proof assistant. Dilworthâ€™s Theorem states that in any finite partially ordered set (poset), the size of aâ€¦ (More)

Separation Logic is an effective Program Logic for proving programs that involve pointers. Reasoning with pointers becomes difficult especially when there is aliasing arising due to several pointersâ€¦ (More)

We present fully formalized proofs of some central theorems from combinatorics. These are Dilworthâ€™s decomposition theorem, Mirskyâ€™s theorem, Hallâ€™s marriage theorem and the ErdÅ‘s-Szekeres theorem.â€¦ (More)