5 citations · 6 across the 8 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
cs.LO2017
An Outline of Separation Logic
Abhishek Kr Singh, Raja Natrajan
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 t…
cs.LO2017
Formalization of some central theorems in combinatorics of finite sets
Abhishek Kr Singh
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-…
cs.LO2017
Fully Mechanized Proofs of Dilworths Theorem and Mirskys Theorem
Abhishek Kr Singh
We present two fully mechanized proofs of Dilworths and Mirskys theorems in the Coq proof assistant. Dilworths Theorem states that in any finite partially ordered set (poset), the…