Two papers accepted to OOPSLA!

with No Comments

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

Two papers accepted to OOPSLA’17!

with No Comments

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).

CCS’17 paper accepted!

with No Comments

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

FSE’17 paper accepted!

with No Comments

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

1 2