proof system working with matching logic, (in other words, a matching logic prover), is not only feasible but promising.

proof system working with matching logic, (in other words, a matching logic prover), is not only feasible but promising.

−

I keep updating my research progress in my [[Research_Diary | research diary]].

+

I keep updating my research progress in my [[research diary]].

Revision as of 05:13, 5 October 2016

Simple Biography

2016 to present. PhD student. University of Illinois at Urbana-Champaign, USA

2015 to 2016. Research assistant. Singapore University of Technology and Design, Singapore

2014 to 2015. Teaching assistant. Birmingham City University, UK

2010 to 2014. Undergraduate student. Peking University, China

Research Interests

I hold a general interest in mathematics and computer science, and that is part of the reason why I am focusing on
formal methods.

I am currently carrying out a short-term survey study on
separation logic, with a specific focus on
some historic views, its relationship towards other major logics, and the status quo of tools support. I will cover some
interesting discussions about the frame problem, one of the main problem that separation logic tries to solve. The survey
will examine a number of major variances of separation logic, and compare them with other logics that take the frame problem
into account, especially matching logic. The aim of establishing such a co-relationship between separation logic and
matching logic is to borrow as many as "fruits" in the separation logic community and innovate research on matching logic.
I believe the design of matching logic makes it as flexible and powerful as separation logic, and an efficient automatic
proof system working with matching logic, (in other words, a matching logic prover), is not only feasible but promising.