I am a graduate student in computer science at the University of Illinois at Urbana-Champaign. I started in Fall 2007 and I am studying logic, automated deduction and program verification with Madhusudan Parthasarathy.
Before starting my studies at the University of Illinois I completed my
Master studies at Nanjing University, China in the group of Xuandong Li.
If you need to contact me, the easiest way to do that is by email to "qiu2" at the domain "illinois.edu". You can also visit me at my office:
3240 Siebel Center
201 N Goodwin Ave
Urbana, IL 61801
Natural Proofs for Structure, Data, and Separation
To appear on 34th ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI '13), 2013.
Recursive Proofs for Inductive Tree Data-Structures
In Proc. 39th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL '12), 2012. (Acc rate for PC submissions: 18%)
(PDF via ACM Author-izer
(ACM DL via DOI
Efficient Decision Procedures for Heaps Using STRAND
In Proc. 18th International Static Analysis Symposium (SAS '11), LNCS 6887, 2011. (Acc rate: 33%)
(SpringerLink via DOI
Decidable Logics Combining Heap Structures and Data
In Proc. 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL '11), 2011. (Acc rate: 23%)
UML Interaction Model-Driven Runtime Verification of Java Programs
IET Software, 5(2):142-156, 2011.
A Formal Architecture Pattern for Real-Time Distributed Systems
In Proc. 30th IEEE Real-Time System Symposium (RTSS '09), 2009. (Acc rate: 21%)
(IEEE Xplore via DOI
UML Activity Diagram-Based Automatic Test Case Generation for Java Programs
The Computer Journal, 52(5):545-556, 2009.
UML State Machine Diagram Driven Runtime Verification of Java Programs for Message Interaction Consistency
In Proc. 23rd ACM Symposium on Applied Computing (SAC '08), 2008. (Acc rate: 29%)
Runtime Verification of Java Programs for Scenario-Based Specifications
In Proc. 11th Ada-Europe International Conference on Reliable Software Technologies (Ada-Europe '06), LNCS 4006, 2006.
Automatic Test Case Generation for UML Activity Diagrams
In Proc. 1st International Workshop on Automation of Software Test (AST '06), 2006.
- Strand: A logic combining heap structures and data
- Strand ("STRucture ANd Data") is a logic that allows reasoning with heap-manipulating programs using deductive verification and SMT solvers. More details can be found here).
- Dryad: Recursive proofs for inductive tree data-structures
- Dryad is a dialect of separation logic with recursive definitions. Dryad provides natural proofs for general properties of structure, data, and separation. More details can be found here).
- My Erdös number is at most 4.