Xiaokang Qiu

Assistant Professor

I am an assistant professor with the School of Electrical and Computer Engineering at Purdue University. I used to be a postdoc at MIT CSAIL, sponsored by ExCAPE and working with Jeff Foster and Armando Solar-Lezama. I received my Ph.D. in Computer Science in 2013 from the University of Illinois at Urbana-Champaign, where I was advised by 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.

My research interests span a range of areas in Programming Languages and Software Engineering, with focus on theories, algorithms and tools of Programming Systems, including program logics, decision procedures, automated deduction, program verification, and program synthesis.

I look for smart, motivated, hard-working Ph.D. students and undergraduate interns. Please apply to Purdue's strong Computer Engineering Programs. If you are interested in working with me, I will be more than happy to talk with you!

If you need to contact me, the easiest way to do that is by email to "xkqiu" at the domain "purdue.edu". You can also visit me at my office:

EE 329
Purdue University
School of Electrical and Computer Engineering
465 Northwestern Avenue
West Lafayette, IN 47907-2035
phone: +1 765 494 9987

Recent News

February 2020:
Our paper on Cooperative Synthesis (implemented as the DryadSynth solver) (conditionally) accepted to PLDI 2020.
September 2019:
Our paper on Comparative Synthesis accepted to HotNets 2019.
August 2019:
Received a seed grant (PI, ~$30K) from PurPL.
Invited to serve on CAV 2020 Program Committee. Consider submitting a paper!
July 2019:
Our paper on JLibSketch accepted to OOPSLA 2019.
Received a SPX award (co-PI, $1.25M) from the NSF.
Our SyGuS solver DryadSynth wins the CLIA track of SyGuS-COMP 2019!
January 2019:
Invited to serve on PLDI 2019 SRC Program Committee. Consider submitting your (or your student's) unpublished work!
November 2018:
Our paper on Decidable Logics for Tree Data-Structures accepted to VMCAI 2019.
August 2018:
Received a FMitF award (PI, $742K) from the NSF.

Selected Publications


Purdue ECE663: Advanced Compilation and Automatic Programming (Spring 2018)
Purdue ECE573: Compilers and Translator Writing Systems (Fall 2017, Spring 2017, Fall 2018, Fall 2019)
Purdue ECE468: Introduction to Compiler and Translation Systems Engineering (
Fall 2016, Fall 2018, Fall 2019)
MIT 6.885: Introduction to Principles and Practice of Software Synthesis (Spring 2015)
Guest Instructor
MIT 6.820: Foundations of Program Analysis (Fall 2015)

Professional Service

Program Committee
CAV 2020, SATE 2019, PLDI 2019 SRC, APLAS 2018, ATVA 2018, SATE 2018, NASAC 2018 (Safety and Security of System Software track), PLDI 2018 (ERC), VMCAI 2018, NASAC 2017, APLAS 2017, ATVA 2017, ICSE 2017 (Demonstrations), SATE 2016, TrustSoft 2016, POPL 2016 (ERC), PLDI 2015 (ERC), VMCAI 2015
Conference Session Chair
CAV 2020, VMCAI 2019, VMCAI 2015
Journal Reviewer
ACM TACO, ACM TOPLAS, Software: Practice and Experience

Software Projects

STRAND Logic Solver
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 at
VCDryad Program Verifier
VCDryad extends the VCC framework to provide an automated deductive framework against separation logic specifications for C programs based on natural proofs. The tool is available at:
ImpSynt Program Synthesizer
ImpSynt is a syntax-guided program synthesizer that can automatically synthesizes data-structure manipulations and their correctness proofs in tandem, from bare-bones control flow skeletons. Some examples can be found here.
PASKET Model Synthesizer
PASKET ("PAttern SKETcher") is a tool for automatically generating Java framework models for symbolic execution. The tool is available at:
JSketch Java Program Synthesizer
JSketch is a sketch-based Java program synthesizer built on top of Sketch. The tool was presented at ESEC/FSE 2015 and available at:
DryadSynth SyGuS Solver
DryadSynth is a Syntax-Guided Synthesis (SyGuS) solver that combines enumerative synthesis and deductive synthesis algorithms. DryadSynth won the CLIA track of SyGuS-COMP in 2018 and 2019. The solver was presented at PLDI 2020 and available at:


My Erdös number is at most 3.