BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Austria
1 × China
1 × Cyprus
1 × Italy
1 × Russia
1 × United Kingdom
10 × USA
2 × France
Collaborated with:
I.Dillig A.Aiken K.L.McMillan B.Li M.Sagiv S.Chaudhuri R.Sharma E.Yahav S.Chandra N.Yaghmazadeh Yuepeng Wang 0001 M.Sousa D.Vytiniotis C.Gkantsidis S.Bugrara B.Hackett P.Hawkins
Talks about:
program (4) abduct (4) infer (4) use (4) synthesi (3) invari (3) scalabl (2) generat (2) complet (2) analysi (2)

Person: Thomas Dillig

DBLP DBLP: Dillig:Thomas

Contributed to:

CAV 20142014
PLDI 20142014
CAV 20132013
OOPSLA 20132013
TACAS 20132013
CAV 20122012
PLDI 20122012
CAV 20112011
PLDI 20112011
POPL 20112011
ESOP 20102010
OOPSLA 20102010
SAS 20102010
CAV 20092009
ISMM 20082008
PLDI 20082008
PASTE 20072007
PLDI 20072007
OOPSLA 20172017

Wrote 19 papers:

CAV-2014-DilligDC #memory management #safety #synthesis
Optimal Guard Synthesis for Memory Safety (TD, ID, SC), pp. 491–507.
PLDI-2014-SousaDVDG #query
Consolidation of queries with user-defined functions (MS, ID, DV, TD, CG), p. 56.
CAV-2013-DilligD #abduction #named
Explain: A Tool for Performing Abductive Inference (ID, TD), pp. 684–689.
OOPSLA-2013-DilligDLM #abduction #generative #induction #invariant
Inductive invariant generation via abductive inference (ID, TD, BL, KLM), pp. 443–456.
TACAS-2013-LiDDMS #abduction #composition #proving #synthesis
Synthesis of Circular Compositional Program Proofs via Abduction (BL, ID, TD, KLM, MS), pp. 370–384.
CAV-2012-DilligDMA #smt
Minimum Satisfying Assignments for SMT (ID, TD, KLM, AA), pp. 394–409.
PLDI-2012-DilligDA #abduction #automation #fault #using
Automated error diagnosis using abductive inference (ID, TD, AA), pp. 181–192.
CAV-2011-SharmaDDA #generative #invariant #using
Simplifying Loop Invariant Generation Using Splitter Predicates (RS, ID, TD, AA), pp. 703–719.
PLDI-2011-DilligDAS #composition #precise #source code #summary
Precise and compact modular procedure summaries for heap manipulating programs (ID, TD, AA, MS), pp. 567–577.
POPL-2011-DilligDA #precise #reasoning #source code #using
Precise reasoning for programs using containers (ID, TD, AA), pp. 187–200.
ESOP-2010-DilligDA
Fluid Updates: Beyond Strong vs. Weak Updates (ID, TD, AA), pp. 246–266.
OOPSLA-2010-DilligDA #abstraction #axiom #invariant #memory management
Symbolic heap abstraction with demand-driven axiomatization of memory invariants (ID, TD, AA), pp. 397–410.
SAS-2010-DilligDA #constraints #online #scalability #source code #static analysis
Small Formulas for Large Programs: On-Line Constraint Simplification in Scalable Static Analysis (ID, TD, AA), pp. 236–252.
CAV-2009-DilligDA #integer #linear #proving
Cuts from Proofs: A Complete and Practical Technique for Solving Linear Inequalities over Integers (ID, TD, AA), pp. 233–247.
ISMM-2008-DilligDYC #automation #java #resource management
The CLOSER: automating resource management in java (ID, TD, EY, SC), pp. 1–10.
PLDI-2008-DilligDA #analysis #scalability
Sound, complete and scalable path-sensitive analysis (ID, TD, AA), pp. 270–280.
PASTE-2007-AikenBDDHH #overview
An overview of the saturn project (AA, SB, ID, TD, BH, PH), pp. 43–48.
PLDI-2007-DilligDA #consistency #detection #fault #nondeterminism #semantics #using
Static error detection using semantic inconsistency inference (ID, TD, AA), pp. 435–445.
OOPSLA-2017-Yaghmazadeh0DD #named #natural language #query #synthesis
SQLizer: query synthesis from natural language (NY, YW0, ID, TD), p. 26.
Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.