5 citations · 6 across the 8 of their papers we have counts for
10 papers
Assured Automatic Programming via Large Language Models
Martin Mirchev, Andreea Costea, Abhishek Kr Singh +1
With the advent of AI-based coding engines, it is possible to convert natural language requirements to executable code in standard programming languages. However, AI-generated code…
Double Auctions: Formalization and Automated Checkers
Mohit Garg, N. Raja, Suneel Sarswat +1
Double auctions are widely used in financial markets, such as those for stocks, derivatives, currencies, and commodities, to match demand and supply. Once all buyers and sellers ha…
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…
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…
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 …
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…
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…
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…
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-…
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…