Our group just got two papers (conditionally) accepted at PLDI’19. One of the papers, co-authored by Greg and Shankara, describes a new technique for verifying robustness of deep neural networks. The other paper, co-authored by Yuepeng, James, and Rushi, presents a synthesis … Read More
Two UToPiA papers will appear at OOPSLA this year! One of the papers is on “Relational Program Synthesis” and is co-authored by Yuepeng, Xinyu, and Isil. The other paper called “Verified Three Way Merge” is co-authored by Isil and two … Read More
The Singularity work led by Jiayi Wei gets accepted to FSE’18! Here is the abstract: We describe a new blackbox complexity testing technique for determining the worst-case asymptotic complexity of a given application. The key idea is to look … Read More
Our paper titled “Program Synthesis using Conflict-Driven Learning” wins a Distinguished Paper Award at PLDI’18!
Our group won a Google Award to pursue research on malware detection! We will be collaborating with the Google Play Protect team to develop techniques for finding potentially harmful Android applications.
Navid and Xinyu’s paper on converting hierarchical datasets to relational format has been accepted to VLDB’18 in Rio de Janeiro, Brazil!
Xinyu’s paper on “Program Synthesis using Abstraction Refinement” and Yuepeng’s paper on “Verifying Equivalence of Database-Driven Applications” have been accepted to POPL’18 in Los Angeles, CA!
Congratulations to Xinyu, Navid, and Yuepeng for having their papers accepted to OOPSLA’17! The two papers are “SQLizer: Query Synthesis from Natural Language” (Navid & Yuepeng’s paper) and “Synthesis of Data Completion Scripts using Finite Tree Automata” (Xinyu’s paper).
This paper presents Themis, an end-to-end static analysis tool for finding resource-usage side-channel vulnerabilities in Java applications. We introduce the notion of ε-bounded non-interference, a variant and relaxation of Goguen and Meseguer’s well-known non-interference principle. We then present Quantitative Cartesian … Read More
Kostas’s work on “Failure-Directed Program Trimming” will appear at FSE’17! Here is the abstract of the upcoming paper: We present a new program simplification technique called program trimming that aims to improve the scalability and precision of safety checking tools. … Read More