BibSLEIGH — Sumit

Travelled to:

1 × India
1 × Ireland
1 × Portugal
1 × Russia
1 × South Africa
1 × South Korea
1 × Spain
2 × Austria
2 × Canada
2 × Germany
2 × Hungary
2 × United Kingdom
21 × USA
3 × China
4 × France
4 × Italy

Collaborated with:

A.Tiwari G.C.Necula ∅ R.Singh S.Srivastava F.Zuleger O.Polozov M.Sagiv R.Venkatesan J.S.Foster S.Chaudhuri E.Andersen Z.Popovic M.Marron I.Radicek D.Perelman T.M.Chilimbi V.Le R.Lublinerman T.Lev-Ami M.Mayer D.Grossman S.Jha W.R.Harris B.S.Gulavani M.Musuvathi N.Jojic B.Cook A.Albarghouthi Z.Kincaid S.Sankaranarayanan A.Chakarov A.Solar-Lezama S.Cheema J.J.L.Jr. V.A.Korthikanti S.Jain E.Koskinen K.K.Mehra A.Taly S.Cherem B.McCloskey X.W.0006 E.O'Rourke F.Niksic R.Piskac R.Madhavan V.Kuncak D.W.Barowy T.Hart B.G.Zorn P.Provost T.Ball S.NavidPour M.Sinn H.Veith S.A.Seshia S.Itzhaky N.Immerman S.Kaleeswaran A.Santhiar A.Kanade S.Barman S.Chasins R.Bodík E.Butler A.M.Smith A.K.Menon O.Tamuz B.W.Lampson A.Kalai N.Tillmann J.d.Halleux T.Xie J.Bishop G.Barthe J.M.Crespo C.Kunz A.Rybalchenko A.Chawdhary H.Yang S.Padhi Prateek Jain 0002 T.D.Millstein D.Edge N.Milic-Frayling M.Raza R.A.Saputra C.Wang K.Yatani Anders Miltner A.Leung A.Radhakrishna G.Soares A.T.0001 A.Udupa

Talks about:

program (32) analysi (15) synthesi (12) exampl (12) abstract (10) use (10) framework (7) autom (7) data (7) spreadsheet (6)

Person: Sumit Gulwani

DBLP: Gulwani:Sumit

Contributed to:

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

2004

2003

2016

2018

2019

2016

2017

2018

Wrote 77 papers:

CAV-2015-SinghG #predict #programming: Predicting a Correct Program in Programming by Example (RS, SG), pp. 398–414.
CHI-2015-ButlerASGP #analysis #automation #design #game studies: Automatic Game Progression Design through Analysis of Solution Features (EB, EA, AMS, SG, ZP), pp. 2407–2416.
CHI-2015-EdgeGMRSWY #editing: Mixed-Initiative Approaches to Global Editing in Slideware (DE, SG, NMF, MR, RAS, CW, KY), pp. 3503–3512.
CHI-2015-ORourkeAGP #automation #framework #generative #interactive: A Framework for Automatically Generating Interactive Instructional Scaffolding (EO, EA, SG, ZP), pp. 1545–1554.
ICSE-v2-2015-GulwaniMNP #live programming #named #programming #synthesis: StriSynth: Synthesis for Live Programming (SG, MM, FN, RP), pp. 701–704.
OOPSLA-2015-MadhavanMGK #automation #comparison: Automating grammar comparison (RM, MM, SG, VK), pp. 183–200.
OOPSLA-2015-PolozovG #framework #induction #named #synthesis: FlashMeta: a framework for inductive program synthesis (OP, SG), pp. 107–126.
PLDI-2015-BarowyGHZ #named #relational #spreadsheet #using: FlashRelate: extracting relational data from semi-structured spreadsheets using examples (DWB, SG, TH, BGZ), pp. 218–228.
POPL-2015-Gulwani #automation: Automating Repetitive Tasks for the Masses (SG), pp. 1–2.
FSE-2014-GulwaniRZ #feedback #generative #performance #problem #programming: Feedback generation for performance problems in introductory programming assignments (SG, IR, FZ), pp. 41–51.
KDD-2014-PolozovG #automation #named #web: LaSEWeb: automating search strategies over semi-structured web data (OP, SG), pp. 741–750.
PLDI-2014-LeG #framework #named: FlashExtract: a framework for data extraction by examples (VL, SG), p. 55.
PLDI-2014-PerelmanGGP #synthesis #testing: Test-driven synthesis (DP, SG, DG, PP), p. 43.
SIGMOD-2014-GulwaniM #data analysis #interactive #named #natural language #programming #spreadsheet: NLyze: interactive programming by natural language for spreadsheet data analysis and manipulation (SG, MM), pp. 803–814.
CAV-2013-AlbarghouthiGK #recursion #synthesis: Recursive Program Synthesis (AA, SG, ZK), pp. 934–950.
CHI-2013-AndersenGP #education #framework: A trace-based framework for analyzing and synthesizing educational progressions (EA, SG, ZP), pp. 773–782.
ICML-c1-2013-MenonTGLK #framework #machine learning #programming: A Machine Learning Framework for Programming by Example (AKM, OT, SG, BWL, AK), pp. 187–195.
ICSE-2013-TillmannHXGB #education #game studies #interactive #learning #programming #re-engineering: Teaching and learning programming and software engineering via interactive gaming (NT, JdH, TX, SG, JB), pp. 1117–1126.
PLDI-2013-SankaranarayananCG #probability #source code #static analysis: Static analysis for probabilistic programs: inferring whole program properties from finitely many paths (SS, AC, SG), pp. 447–458.
PLDI-2013-SinghGS #automation #feedback #generative #programming: Automated feedback generation for introductory programming assignments (RS, SG, ASL), pp. 15–26.
PPoPP-2013-BartheCKGM #relational #synthesis #verification: From relational verification to SIMD loop synthesis (GB, JMC, SG, CK, MM), pp. 123–134.
CAV-2012-SinghG: Synthesizing Number Transformations from Input-Output Examples (RS, SG), pp. 634–651.
CHI-2012-CheemaGL #diagrams #experience #geometry #named: QuickDraw: improving drawing experience for geometric diagrams (SC, SG, JJLJ), pp. 1037–1064.
PLDI-2012-PerelmanGBG: Type-directed completion of partial expressions (DP, SG, TB, DG), pp. 275–286.
VLDB-2012-SinghG #learning #semantics #string: Learning Semantic String Transformations from Examples (RS, SG), pp. 740–751.
ESEC-FSE-2011-ChaudhuriGLN #proving #robust #source code: Proving programs robust (SC, SG, RL, SN), pp. 102–112.
PLDI-2011-GulwaniJTV #source code #synthesis: Synthesis of loop-free programs (SG, SJ, AT, RV), pp. 62–73.
PLDI-2011-GulwaniKT #geometry: Synthesizing geometry constructions (SG, VAK, AT), pp. 50–61.
PLDI-2011-HarrisG #spreadsheet: Spreadsheet table transformations from examples (WRH, SG), pp. 317–328.
PLDI-2011-SrivastavaGCF #induction #synthesis: Path-based inductive synthesis for program inversion (SS, SG, SC, JSF), pp. 492–503.
POPL-2011-Gulwani #automation #spreadsheet #string #using: Automating string processing in spreadsheets using input-output examples (SG), pp. 317–330.
SAS-2011-ZulegerGSV #abstraction #analysis #bound #imperative #source code: Bound Analysis of Imperative Programs with the Size-Change Abstraction (FZ, SG, MS, HV), pp. 280–297.
ICSE-2010-JhaGST #component #synthesis: Oracle-guided component-based program synthesis (SJ, SG, SAS, AT), pp. 215–224.
OOPSLA-2010-ItzhakyGIS #induction #synthesis: A simple inductive synthesis methodology and its applications (SI, SG, NI, MS), pp. 36–46.
PLDI-2010-GulwaniZ #bound #problem: The reachability-bound problem (SG, FZ), pp. 292–304.
POPL-2010-ChaudhuriGL #analysis #source code: Continuity analysis of programs (SC, SG, RL), pp. 57–70.
POPL-2010-SrivastavaGF #synthesis #verification: From program verification to program synthesis (SS, SG, JSF), pp. 313–326.
PPDP-2010-Gulwani #synthesis: Dimensions in program synthesis (SG), pp. 13–24.
CAV-2009-Gulwani #analysis #bound #complexity #named: SPEED: Symbolic Complexity Bound Analysis (SG), pp. 51–62.
CAV-2009-SrivastavaGF #named #smt #verification: VS3: SMT Solvers for Program Verification (SS, SG, JSF), pp. 702–708.
PLDI-2009-GulwaniJK #analysis #bound #control flow #invariant #refinement: Control-flow refinement and progress invariants for bound analysis (SG, SJ, EK), pp. 375–385.
PLDI-2009-SrivastavaG #abstraction #using #verification: Program verification using templates over predicate abstraction (SS, SG), pp. 223–234.
POPL-2009-GulwaniLS #framework: A combination framework for tracking partition sizes (SG, TLA, MS), pp. 239–251.
POPL-2009-GulwaniMC #complexity #estimation #named #performance #precise: SPEED: precise and efficient static estimation of program computational complexity (SG, KKM, TMC), pp. 127–139.
VMCAI-2009-GulwaniSV #abstraction #constraints #invariant: Constraint-Based Invariant Inference over Predicate Abstraction (SG, SS, RV), pp. 120–135.
VMCAI-2009-TalyGT #constraints #logic #theorem proving #using: Synthesizing Switching Logic Using Constraint Solving (AT, SG, AT), pp. 305–319.
CAV-2008-CookGLRS #proving #termination: Proving Conditional Termination (BC, SG, TLA, AR, MS), pp. 328–340.
CAV-2008-GulavaniG #abstract domain #abstraction #analysis: A Numerical Abstract Domain Based on Expression Abstraction and Max Operator with Application in Timing Analysis (BSG, SG), pp. 370–384.
CAV-2008-GulwaniT #analysis #approach #constraints #hybrid: Constraint-Based Approach for Analysis of Hybrid Systems (SG, AT), pp. 190–203.
ESOP-2008-ChawdharyCGSY #abstraction #ranking: Ranking Abstractions (AC, BC, SG, MS, HY), pp. 148–162.
ESOP-2008-GulwaniM #algorithm: Cover Algorithms and Their Combination (SG, MM), pp. 193–207.
PLDI-2008-CheremCG: Inferring locks for atomic sections (SC, TMC, SG), pp. 304–315.
PLDI-2008-GulwaniSV #constraints #program analysis #theorem proving: Program analysis as constraint solving (SG, SS, RV), pp. 281–292.
POPL-2008-GulwaniMT #logic #quantifier: Lifting abstract interpreters to quantified logical domains (SG, BM, AT), pp. 235–246.
CADE-2007-TiwariG #logic #program analysis #proving #theorem proving #using: Logical Interpretation: Static Program Analysis Using Theorem Proving (AT, SG), pp. 147–166.
CAV-2007-GulwaniT #abstract domain #bytecode #low level: An Abstract Domain for Analyzing Heap-Manipulating Low-Level Software (SG, AT), pp. 379–392.
ESOP-2007-GulwaniT #analysis #interprocedural #summary: Computing Procedure Summaries for Interprocedural Analysis (SG, AT), pp. 253–267.
POPL-2007-GulwaniJ #probability #verification: Program verification as probabilistic inference (SG, NJ), pp. 277–289.
VMCAI-2007-GulwaniT: Assertion Checking Unified (SG, AT), pp. 363–377.
ESOP-2006-GulwaniT #abstraction #linear: Assertion Checking over Combined Abstraction of Linear Arithmetic and Uninterpreted Functions (SG, AT), pp. 279–293.
PLDI-2006-GulwaniT: Combining abstract interpreters (SG, AT), pp. 376–386.
CAV-2005-NeculaG #algorithm #program analysis #random #verification: Randomized Algorithms for Program Analysis and Verification (GCN, SG), p. 1.
POPL-2005-GulwaniN #analysis #interprocedural #precise #random #using: Precise interprocedural analysis using random interpretation (SG, GCN), pp. 324–337.
POPL-2004-GulwaniN #random #using: Global value numbering using random interpretation (SG, GCN), pp. 342–352.
SAS-2004-GulwaniN #algorithm #polynomial: A Polynomial-Time Algorithm for Global Value Numbering (SG, GCN), pp. 212–227.
SAS-2004-GulwaniN04a #analysis #linear: Path-Sensitive Analysis for Linear Arithmetic and Uninterpreted Functions (SG, GCN), pp. 328–343.
CADE-2003-GulwaniN #random: A Randomized Satisfability Procedure for Arithmetic and Uninterpreted Function Symbols (SG, GCN), pp. 167–181.
POPL-2003-GulwaniN #random #using: Discovering affine equalities using random interpretation (SG, GCN), pp. 74–84.
FSE-2016-KaleeswaranSKG #feedback #generative: Semi-supervised verified feedback generation (SK, AS, AK, SG), pp. 739–750.
IJCAR-2016-Gulwani #algorithm #ambiguity #programming: Programming by Examples: Applications, Algorithms, and Ambiguity Resolution (SG), pp. 9–14.
OOPSLA-2016-BarmanCBG #automation #named #web: Ringer: web automation by demonstration (SB, SC, RB, SG), pp. 748–764.
OOPSLA-2016-WangGS #named #spreadsheet #using: FIDEX: filtering spreadsheet data using examples (XW0, SG, RS), pp. 195–213.
OOPSLA-2018-PadhiJPPGM #framework #named: FlashProfile: a framework for synthesizing data profiles (SP, PJ0, DP, OP, SG, TDM), p. 28.
OOPSLA-2019-MiltnerGLLRSTU #on the #on the fly #synthesis: On the fly synthesis of edit suggestions (AM, SG, VL, AL, AR, GS, AT0, AU), p. 29.
POPL-2016-SinghG #data type #spreadsheet #using: Transforming spreadsheet data types using examples (RS, SG), pp. 343–356.
PPDP-2017-Gulwani #algorithm #ambiguity #programming: Programming by examples: applications, algorithms, and ambiguity resolution (SG), p. 2.
PLDI-2018-GulwaniRZ #automation #clustering #program repair #programming: Automated clustering and program repair for introductory programming assignments (SG, IR, FZ), pp. 465–480.