Thomas Dillig

According to our database1, Thomas Dillig authored at least 23 papers between 2007 and 2017.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2017
Synthesis of circular compositional program proofs via abduction.
Int. J. Softw. Tools Technol. Transf., 2017

SQLizer: query synthesis from natural language.
Proc. ACM Program. Lang., 2017

Type- and Content-Driven Synthesis of SQL Queries from Natural Language.
CoRR, 2017

2015
Bottom-Up Context-Sensitive Pointer Analysis for Java.
Proceedings of the Programming Languages and Systems - 13th Asian Symposium, 2015

2014
Consolidation of queries with user-defined functions.
Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, 2014

Optimal Guard Synthesis for Memory Safety.
Proceedings of the Computer Aided Verification - 26th International Conference, 2014

2013
Inductive invariant generation via abductive inference.
Proceedings of the 2013 ACM SIGPLAN International Conference on Object Oriented Programming Systems Languages & Applications, 2013

Explain: A Tool for Performing Abductive Inference.
Proceedings of the Computer Aided Verification - 25th International Conference, 2013

Automated Inference of Library Specifications for Source-Sink Property Verification.
Proceedings of the Programming Languages and Systems - 11th Asian Symposium, 2013

2012
Automated error diagnosis using abductive inference.
Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, 2012

Minimum Satisfying Assignments for SMT.
Proceedings of the Computer Aided Verification - 24th International Conference, 2012

2011
Cuts from proofs: a complete and practical technique for solving linear inequalities over integers.
Formal Methods Syst. Des., 2011

Precise reasoning for programs using containers.
Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2011

Precise and compact modular procedure summaries for heap manipulating programs.
Proceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design and Implementation, 2011

Simplifying Loop Invariant Generation Using Splitter Predicates.
Proceedings of the Computer Aided Verification - 23rd International Conference, 2011

2010
Reasoning about the unknown in static analysis.
Commun. ACM, 2010

Small Formulas for Large Programs: On-Line Constraint Simplification in Scalable Static Analysis.
Proceedings of the Static Analysis - 17th International Symposium, 2010

Symbolic heap abstraction with demand-driven axiomatization of memory invariants.
Proceedings of the 25th Annual ACM SIGPLAN Conference on Object-Oriented Programming, 2010

Fluid Updates: Beyond Strong vs. Weak Updates.
Proceedings of the Programming Languages and Systems, 2010

2008
Sound, complete and scalable path-sensitive analysis.
Proceedings of the ACM SIGPLAN 2008 Conference on Programming Language Design and Implementation, 2008

The CLOSER: automating resource management in java.
Proceedings of the 7th International Symposium on Memory Management, 2008

2007
Static error detection using semantic inconsistency inference.
Proceedings of the ACM SIGPLAN 2007 Conference on Programming Language Design and Implementation, 2007

An overview of the saturn project.
Proceedings of the 7th ACM SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and Engineering, 2007


  Loading...