Difference between revisions of "Xiaohong Chen"

From FSL
Jump to: navigation, search
(50 intermediate revisions by one user not shown)
Line 1: Line 1:
[[Image:Xiaohong-full.jpg|158px|Xiaohong Chen]]
+
[[Image:Xiaohong-full.jpg|200px|Xiaohong Chen]]
  
 +
{{Header | Contact}}
 +
* xc3@illinois.edu
  
 
{{Header | Simple Biography}}
 
{{Header | Simple Biography}}
Line 7: Line 9:
 
* 2014 to 2015. Teaching assistant. Birmingham City University, UK
 
* 2014 to 2015. Teaching assistant. Birmingham City University, UK
 
* 2010 to 2014. Undergraduate student. Peking University, China
 
* 2010 to 2014. Undergraduate student. Peking University, China
 
  
 
{{Header | Research Interests}}
 
{{Header | Research Interests}}
I hold a general interest in mathematics and computer science, and that is part of the reason why I am focusing on
+
* Programming Languages, Program Semantics, Program Logic and Verification
<span class="plainlinks">[https://en.wikipedia.org/wiki/Formal_methods formal methods]</span>.  
+
* [http://www.matching-logic.org/index.php/Open_Problems Open Problems in Matching Logic]
 
+
I am currently carrying out a short-term survey study on
+
<span class="plainlinks">[https://en.wikipedia.org/wiki/Separation_logic separation logic]</span>, 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 | 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.
+
 
+
I keep update my research progress in my [[research diary]].
+
 
+
  
 
{{Header | Publications}}
 
{{Header | Publications}}
 +
* [[Matching mu-Logic | Matching mu-logic]], ''To appear in LICS'19
 +
* [[A Language-Independent Program Verification Framework | A language-independent program verification framework]], ''Proceedings of the 8th International Symposium On Leveraging Applications of Formal Methods, Verification and Validation (ISoLA'18)''
 +
* [[A Language-Independent Approach to Smart Contract Verification | A language-independent approach to smart contract verification]], ''Proceedings of the 8th International Symposium On Leveraging Applications of Formal Methods, Verification and Validation (ISoLA'18)''
 +
* Improving probability estimation through active probabilistic model learning, ''Proceedings of the 19th International Conference on Formal Engineering Methods (ICFEM'17)''
 +
* Component-based modelling for scalable smart city systems interoperability: A case study on integrating energy demand response systems, ''Sensors 2016, 16(11), 1810''
 
* Towards concolic testing for hybrid systems, ''Proceedings of the 21st International Symposium on Formal Methods (FM'16)''
 
* Towards concolic testing for hybrid systems, ''Proceedings of the 21st International Symposium on Formal Methods (FM'16)''
 +
* Model-driven design of object and component systems, ''Chapter of The First International School on Engineering Trustworthy Software Systems''
 
* A framework for off-line conformance testing of timed connectors, ''Proceedings of the 9th International Symposium on Theoretical Aspects of Software Engineering (TASE'15)''
 
* A framework for off-line conformance testing of timed connectors, ''Proceedings of the 9th International Symposium on Theoretical Aspects of Software Engineering (TASE'15)''
 
* A hybrid model of connectors in cyber-physical systems, ''Proceedings of the 16th International Conference on Formal Engineering Methods (ICFEM'14)''
 
* A hybrid model of connectors in cyber-physical systems, ''Proceedings of the 16th International Conference on Formal Engineering Methods (ICFEM'14)''
 +
 +
{{Header | Selected Awards}}
 +
* Yunni & Maxine Pao Memorial Fellowship (2018-2019)
 +
* China National Scholarship (2012-2013)
 +
 +
{{Header | Activities}}
 +
* The 8th International Symposium On Leveraging Applications of Formal Methods, Verification and Validation ''(ISoLA'18)'', Cyprus
 +
* Volunteered the 32nd IEEE/ACM International Conference on Automated Software Engineering ''(ASE'17)'', Illinois, USA
 +
* The 21st International Symposium on Formal Methods ''(FM'16)'', Cyprus
 +
* Marktoberdorf Summer School 2015, Marktoberdorf, Germany
 +
* The 9th Theoretical Aspects of Software Engineering Conference ''(TASE'15)'', Nanjing, China
 +
 +
{{Header | Quotes}}
 +
* ''What can be said at all can be said clearly, and what we cannot talk about we must pass over in silence.'' --- Ludwig Wittgenstein.
 +
* ''Young man, in mathematics you don't understand things. You just get used to them.'' --- John von Neumann.
 +
 +
{{Header | Fun}}
 +
* I am a dan player of <span class="plainlinks">[https://en.wikipedia.org/wiki/Go_(game) the game of Go]</span>.
 +
 +
{{Header | Links}}
 +
* [https://github.com/hreada Github] / [https://scholar.google.com/citations?user=4LP6Y64AAAAJ&hl=en Google Scholar] / [https://dblp.org/pid/02/1438-2 dblp]
 +
* Some <span class="plainlinks">[https://terrytao.wordpress.com/advice-on-writing-papers/ advice on writing]</span> by <span class="plainlinks">[https://www.math.ucla.edu/~tao/ Terence Tao]</span>.

Revision as of 19:53, 13 September 2019

Xiaohong Chen

Contact
  • xc3@illinois.edu
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
Publications
  • Matching mu-logic, To appear in LICS'19
  • A language-independent program verification framework, Proceedings of the 8th International Symposium On Leveraging Applications of Formal Methods, Verification and Validation (ISoLA'18)
  • A language-independent approach to smart contract verification, Proceedings of the 8th International Symposium On Leveraging Applications of Formal Methods, Verification and Validation (ISoLA'18)
  • Improving probability estimation through active probabilistic model learning, Proceedings of the 19th International Conference on Formal Engineering Methods (ICFEM'17)
  • Component-based modelling for scalable smart city systems interoperability: A case study on integrating energy demand response systems, Sensors 2016, 16(11), 1810
  • Towards concolic testing for hybrid systems, Proceedings of the 21st International Symposium on Formal Methods (FM'16)
  • Model-driven design of object and component systems, Chapter of The First International School on Engineering Trustworthy Software Systems
  • A framework for off-line conformance testing of timed connectors, Proceedings of the 9th International Symposium on Theoretical Aspects of Software Engineering (TASE'15)
  • A hybrid model of connectors in cyber-physical systems, Proceedings of the 16th International Conference on Formal Engineering Methods (ICFEM'14)
Selected Awards
  • Yunni & Maxine Pao Memorial Fellowship (2018-2019)
  • China National Scholarship (2012-2013)
Activities
  • The 8th International Symposium On Leveraging Applications of Formal Methods, Verification and Validation (ISoLA'18), Cyprus
  • Volunteered the 32nd IEEE/ACM International Conference on Automated Software Engineering (ASE'17), Illinois, USA
  • The 21st International Symposium on Formal Methods (FM'16), Cyprus
  • Marktoberdorf Summer School 2015, Marktoberdorf, Germany
  • The 9th Theoretical Aspects of Software Engineering Conference (TASE'15), Nanjing, China
Quotes
  • What can be said at all can be said clearly, and what we cannot talk about we must pass over in silence. --- Ludwig Wittgenstein.
  • Young man, in mathematics you don't understand things. You just get used to them. --- John von Neumann.
Fun
Links
Personal tools
Namespaces

Variants
Actions
Navigation