Travelled to:1 × Austria
1 × Cyprus
1 × Italy
1 × Russia
1 × United Kingdom
12 × USA
2 × China
2 × France
Collaborated with:T.Dillig A.Aiken Y.Feng S.Chaudhuri M.Sousa K.L.McMillan Yuepeng Wang 0001 X.W.0006 C.Lin R.Martins K.Ferles R.Singh J.Chen X.Wang O.Olivo S.K.Lahiri Y.Wang G.Anderson N.Yaghmazadeh B.Li M.Sagiv O.Bastani Jacob Van Geffen J.Wei J.K.Feser A.Albarghouthi A.Gurfinkel S.Anand R.Sharma E.Yahav S.Chandra V.Wüstholz M.Christakis Christian Klinger Y.Smaragdakis W.R.Cook James Dong Rushi Shah Shankara Pailoor D.Vytiniotis C.Gkantsidis T.W.Reps C.Wang R.Bodík A.Cheung S.Bugrara B.Hackett P.Hawkins A.Kaushik S.P.Reiss
Talks about:synthesi (11) program (11) use (8) static (5) abstract (4) driven (4) detect (4) abduct (4) infer (4) transform (3)
Person: Isil Dillig
DBLP: Dillig:Isil
Facilitated 2 volumes:
EdEdContributed to:
2015
20152014
2014201420132013
20132012201220112011
2011
20102010
20102009
20082008
200720072016
2017
20172018201820172018201920162016201720172018201820192020Wrote 44 papers:
- OOPSLA-2015-FengWDL #control flow #interprocedural
- EXPLORER : query- and demand-driven exploration of interprocedural control flow properties (YF, XW, ID, CL), pp. 520–534.
- PLDI-2015-FeserCD #data type
- Synthesizing data structure transformations from input-output examples (JKF, SC, ID), pp. 229–239.
- PLDI-2015-OlivoDL #debugging #detection #performance #static analysis #traversal
- Static detection of asymptotic performance bugs in collection traversals (OO, ID, CL), pp. 369–378.
- CAV-2014-DilligDC #memory management #safety #synthesis
- Optimal Guard Synthesis for Memory Safety (TD, ID, SC), pp. 491–507.
- FSE-2014-FengADA #android #detection #named #semantics #static analysis
- Apposcopy: semantics-based detection of Android malware through static analysis (YF, SA, ID, AA), pp. 576–587.
- 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.
- FSE-2016-WangFMKDR #java #named #reuse
- Hunter: next-generation code reuse for Java (YW, YF, RM, AK, ID, SPR), pp. 1028–1032.
- ASE-2017-ChenODL #detection #static analysis #web
- Static detection of asymptotic resource side-channel vulnerabilities in web applications (JC, OO, ID, CL), pp. 229–239.
- ESEC-FSE-2017-FerlesWCD
- Failure-directed program trimming (KF, VW, MC, ID), pp. 174–185.
- ESEC-FSE-2018-WeiCFFD #complexity #fuzzing #named
- Singularity: pattern fuzzing for worst case complexity (JW, JC, YF, KF, ID), pp. 213–223.
- CAV-2018-WangADM #abstraction #learning #synthesis
- Learning Abstractions for Program Synthesis (XW0, GA, ID, KLM), pp. 407–426.
- OOPSLA-2017-WangDS #automaton #finite #synthesis #using
- Synthesis of data completion scripts using finite tree automata (XW0, ID, RS), p. 26.
- OOPSLA-2017-Yaghmazadeh0DD #named #natural language #query #synthesis
- SQLizer: query synthesis from natural language (NY, YW0, ID, TD), p. 26.
- OOPSLA-2018-SousaDL
- Verified three-way program merge (MS, ID, SKL), p. 29.
- OOPSLA-2018-WangWD #relational #synthesis
- Relational program synthesis (YW, XW, ID), p. 27.
- OOPSLA-2019-ChenWFBD #learning #relational #using #verification
- Relational verification using reinforcement learning (JC, JW, YF, OB, ID), p. 30.
- PLDI-2016-SousaD #hoare #logic #verification
- Cartesian hoare logic for verifying k-safety properties (MS, ID), pp. 57–69.
- PLDI-2016-YaghmazadehKDC
- Synthesizing transformations on hierarchically structured data (NY, CK, ID, SC), pp. 508–521.
- POPL-2016-AlbarghouthiDG #specification #synthesis
- Maximal specification synthesis (AA, ID, AG), pp. 789–801.
- PLDI-2017-FengMGDC #component #synthesis
- Component-based synthesis of table consolidation and transformation tasks from examples (YF, RM, JVG, ID, SC), pp. 422–436.
- POPL-2017-FengM0DR #api #component #synthesis
- Component-based synthesis for complex APIs (YF, RM, YW0, ID, TWR), pp. 599–612.
- PLDI-2018-FengMBD #learning #synthesis #using
- Program synthesis using conflict-driven learning (YF, RM, OB, ID), pp. 420–435.
- PLDI-2018-FerlesGDS #automation #reasoning
- Symbolic reasoning for automatic signal placement (KF, JVG, ID, YS), pp. 120–134.
- POPL-2018-0001DLC #equivalence #verification
- Verifying equivalence of database-driven applications (YW0, ID, SKL, WRC), p. 29.
- POPL-2018-WangDS #abstraction #refinement #synthesis #using
- Program synthesis using abstraction refinement (XW0, ID, RS), p. 30.
- PLDI-2019-0001DSD #database #refactoring #source code
- Synthesizing database programs for schema refactoring (YW0, JD, RS, ID), pp. 286–300.
- PLDI-2019-AndersonPDC #abstraction #approach #network #optimisation #robust
- Optimization and abstraction: a synergistic approach for analyzing neural network robustness (GA, SP, ID, SC), pp. 731–744.
- POPL-2020-WangFBCD #visualisation
- Visualization by example (CW, YF, RB, AC, ID), p. 28.