Formalization of some central theorems in combinatorics of finite sets. - Abhishek Kr Singh (LPAR (Short Presentations), 2017)

Fully Mechanized Proofs of Dilworths Theorem and Mirskys Theorem. - Abhishek Kr Singh (CoRR, 2017)

An Outline of Separation Logic. - Abhishek Kr Singh; Raja Natarajan (CoRR, 2017)

Towards a Constructive Formalization of Perfect Graph Theorems. - Abhishek Kr Singh; Raja Natarajan (ICLA, 2019)

Formal verification of trading in financial markets. - Suneel Sarswat; Abhishek Kr Singh (CoRR, 2019)

A constructive formalization of the weak perfect graph theorem. - Abhishek Kr Singh; Raja Natarajan (CPP, 2020)

Formally Verified Trades in Financial Markets. - Suneel Sarswat; Abhishek Kr Singh (ICFEM, 2020)

Verified Double Sided Auctions for Financial Markets. - Raja Natarajan; Suneel Sarswat; Abhishek Kr Singh (ITP, 2021)

An Operational Approach to Library Abstraction under Relaxed Memory Concurrency. - Abhishek Kr Singh; Ori Lahav 001 (Proc. ACM Program. Lang., 2023)

Decidable Verification under Localized Release-Acquire Concurrency. - Abhishek Kr Singh; Ori Lahav 001 (TACAS (3), 2024)

Assured Automatic Programming via Large Language Models. - Martin Mirchev; Andreea Costea; Abhishek Kr Singh; Abhik Roychoudhury (CoRR, 2024)

Double Auctions: Formalization and Automated Checkers. - Mohit Garg 003; N. Raja 001; Suneel Sarswat; Abhishek Kr Singh (J. Autom. Reason., 2025)