activity
20172021
most citedA Constructive Formalization of the Weak Perfect Graph Theorem

5 citations · 5 across the 4 of their papers we have counts for

collaborators

6 papers

cs.GT2021

Verified Double Sided Auctions for Financial Markets

Raja Natarajan, Suneel Sarswat, Abhishek Kr Singh

Double sided auctions are widely used in financial markets to match demand and supply. Prior works on double sided auctions have focused primarily on single quantity trade requests…

cs.LO2020

Formally Verified Trades in Financial Markets

Suneel Sarswat, Abhishek Kr Singh

We introduce a formal framework for analyzing trades in financial markets. These days, all big exchanges use computer algorithms to match buy and sell requests and these algorithms…

cs.LO20195 cited

A Constructive Formalization of the Weak Perfect Graph Theorem

Abhishek Kr Singh, Raja Natarajan

The Perfect Graph Theorems are important results in graph theory describing the relationship between clique number and chromatic number of a graph . A graph

cs.LO2019

Formal verification of trading in financial markets

Suneel Sarswat, Abhishek Kr Singh

We introduce a formal framework for analyzing trades in financial markets. An exchange is where multiple buyers and sellers participate to trade. These days, all big exchanges use…

cs.LO2018

Towards a constructive formalization of Perfect Graph Theorems

Abhishek Kr Singh, Raja Natarajan

Interaction between clique number and chromatic number of a graph is a well studied topic in graph theory. Perfect Graph Theorems are probably the most important re…

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…