Thomas Dillig

26 papers A* 11A 4B 3C 1Journal 5Unranked 1
YearRankTypeTitle / Venue / Authors
2017 J jnl
SQLizer: query synthesis from natural language.
Proc. ACM Program. Lang.
Navid Yaghmazadeh, Yuepeng Wang, Isil Dillig, Thomas Dillig
2017 J jnl
Synthesis of circular compositional program proofs via abduction.
Int. J. Softw. Tools Technol. Transf.
Isil Dillig, Thomas Dillig, Boyang Li, Kenneth L. McMillan, Mooly Sagiv
2017 J jnl
Type- and Content-Driven Synthesis of SQL Queries from Natural Language.
CoRR
Navid Yaghmazadeh, Yuepeng Wang, Isil Dillig, Thomas Dillig
2015 B conf
Bottom-Up Context-Sensitive Pointer Analysis for Java.
APLAS
Yu Feng, Xinyu Wang, Isil Dillig, Thomas Dillig
2014 A* conf
Consolidation of queries with user-defined functions.
PLDI
Marcelo Sousa, Isil Dillig, Dimitrios Vytiniotis, Thomas Dillig, Christos Gkantsidis
2014 A* conf
Optimal Guard Synthesis for Memory Safety.
CAV
Thomas Dillig, Isil Dillig, Swarat Chaudhuri
2013 B conf
Automated Inference of Library Specifications for Source-Sink Property Verification.
APLAS
Haiyan Zhu, Thomas Dillig, Isil Dillig
2013 A* conf
Explain: A Tool for Performing Abductive Inference.
CAV
Isil Dillig, Thomas Dillig
2013 A conf
Inductive invariant generation via abductive inference.
OOPSLA
Isil Dillig, Thomas Dillig, Boyang Li, Kenneth L. McMillan
2013 A conf
Synthesis of Circular Compositional Program Proofs via Abduction.
TACAS
Boyang Li, Isil Dillig, Thomas Dillig, Kenneth L. McMillan, Mooly Sagiv
2012 A* conf
Automated error diagnosis using abductive inference.
PLDI
Isil Dillig, Thomas Dillig, Alex Aiken
2012 A* conf
Minimum Satisfying Assignments for SMT.
CAV
Isil Dillig, Thomas Dillig, Kenneth L. McMillan, Alex Aiken
2011 — —
A modular and symbolic approach to static program analysis.
Thomas Dillig
2011 J jnl
Cuts from proofs: a complete and practical technique for solving linear inequalities over integers.
Formal Methods Syst. Des.
Isil Dillig, Thomas Dillig, Alex Aiken
2011 A* conf
Precise and compact modular procedure summaries for heap manipulating programs.
PLDI
Isil Dillig, Thomas Dillig, Alex Aiken, Mooly Sagiv
2011 A* conf
Precise reasoning for programs using containers.
POPL
Isil Dillig, Thomas Dillig, Alex Aiken
2011 A* conf
Simplifying Loop Invariant Generation Using Splitter Predicates.
CAV
Rahul Sharma, Isil Dillig, Thomas Dillig, Alex Aiken
2010 A conf
Fluid Updates: Beyond Strong vs. Weak Updates.
ESOP
Isil Dillig, Thomas Dillig, Alex Aiken
2010 J jnl
Reasoning about the unknown in static analysis.
Commun. ACM
Isil Dillig, Thomas Dillig, Alex Aiken
2010 B conf
Small Formulas for Large Programs: On-Line Constraint Simplification in Scalable Static Analysis.
SAS
Isil Dillig, Thomas Dillig, Alex Aiken
2010 A conf
Symbolic heap abstraction with demand-driven axiomatization of memory invariants.
OOPSLA
Isil Dillig, Thomas Dillig, Alex Aiken
2009 A* conf
Cuts from Proofs: A Complete and Practical Technique for Solving Linear Inequalities over Integers.
CAV
Isil Dillig, Thomas Dillig, Alex Aiken
2008 A* conf
Sound, complete and scalable path-sensitive analysis.
PLDI
Isil Dillig, Thomas Dillig, Alex Aiken
2008 C conf
The CLOSER: automating resource management in java.
ISMM
Isil Dillig, Thomas Dillig, Eran Yahav, Satish Chandra
2007 — conf
An overview of the saturn project.
PASTE
Alex Aiken, Suhabe Bugrara, Isil Dillig, Thomas Dillig, Brian Hackett, Peter Hawkins
2007 A* conf
Static error detection using semantic inconsistency inference.
PLDI
Isil Dillig, Thomas Dillig, Alex Aiken