Formal Verification of Trading in Financial Markets

Speaker: 

Time: 

Friday, 19 July 2019, 16:00 to 17:00

Venue: 

  • A-201 (STCS Seminar Room)

Organisers: 

Abstract: In this talk, 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 computer algorithms that implement double sided auctions to match buy and sell requests and these algorithms must abide by certain regulatory guidelines. For example, market regulators enforce that a matching produced by exchanges should be fair, uniform and individual rational. To verify these properties of trades, we first formally define these notions in a theorem prover and then give formal proofs of relevant results on matchings. Finally, we use this framework to verify properties of two important classes of double sided auctions. All the definitions and results presented in this paper are completely formalized in the Coq proof assistant without adding any additional axioms to it. This is joint work with Abhishek Kr Singh.