| 2009 |
| 30 | EE | Sumit Gulwani,
Krishna K. Mehra,
Trishul M. Chilimbi:
SPEED: precise and efficient static estimation of program computational complexity.
POPL 2009: 127-139 |
| 29 | EE | Sumit Gulwani,
Tal Lev-Ami,
Mooly Sagiv:
A combination framework for tracking partition sizes.
POPL 2009: 239-251 |
| 28 | EE | Sumit Gulwani,
Saurabh Srivastava,
Ramarathnam Venkatesan:
Constraint-Based Invariant Inference over Predicate Abstraction.
VMCAI 2009: 120-135 |
| 27 | EE | Ankur Taly,
Sumit Gulwani,
Ashish Tiwari:
Synthesizing Switching Logic Using Constraint Solving.
VMCAI 2009: 305-319 |
| 2008 |
| 26 | EE | Sumit Gulwani,
Ashish Tiwari:
Constraint-Based Approach for Analysis of Hybrid Systems.
CAV 2008: 190-203 |
| 25 | EE | Byron Cook,
Sumit Gulwani,
Tal Lev-Ami,
Andrey Rybalchenko,
Mooly Sagiv:
Proving Conditional Termination.
CAV 2008: 328-340 |
| 24 | EE | Bhargav S. Gulavani,
Sumit Gulwani:
A Numerical Abstract Domain Based on Expression Abstraction and Max Operator with Application in Timing Analysis.
CAV 2008: 370-384 |
| 23 | EE | Aziem Chawdhary,
Byron Cook,
Sumit Gulwani,
Mooly Sagiv,
Hongseok Yang:
Ranking Abstractions.
ESOP 2008: 148-162 |
| 22 | EE | Sumit Gulwani,
Madan Musuvathi:
Cover Algorithms and Their Combination.
ESOP 2008: 193-207 |
| 21 | EE | Sumit Gulwani,
Saurabh Srivastava,
Ramarathnam Venkatesan:
Program analysis as constraint solving.
PLDI 2008: 281-292 |
| 20 | EE | Sigmund Cherem,
Trishul M. Chilimbi,
Sumit Gulwani:
Inferring locks for atomic sections.
PLDI 2008: 304-315 |
| 19 | EE | Sumit Gulwani,
Bill McCloskey,
Ashish Tiwari:
Lifting abstract interpreters to quantified logical domains.
POPL 2008: 235-246 |
| 2007 |
| 18 | EE | Ashish Tiwari,
Sumit Gulwani:
Logical Interpretation: Static Program Analysis Using Theorem Proving.
CADE 2007: 147-166 |
| 17 | EE | Sumit Gulwani,
Ashish Tiwari:
An Abstract Domain for Analyzing Heap-Manipulating Low-Level Software.
CAV 2007: 379-392 |
| 16 | EE | Sumit Gulwani,
Ashish Tiwari:
Computing Procedure Summaries for Interprocedural Analysis.
ESOP 2007: 253-267 |
| 15 | EE | Sumit Gulwani,
Nebojsa Jojic:
Program verification as probabilistic inference.
POPL 2007: 277-289 |
| 14 | EE | Sumit Gulwani,
Ashish Tiwari:
Assertion Checking Unified.
VMCAI 2007: 363-377 |
| 13 | EE | Sumit Gulwani,
George C. Necula:
A polynomial-time algorithm for global value numbering.
Sci. Comput. Program. 64(1): 97-114 (2007) |
| 2006 |
| 12 | EE | Sumit Gulwani,
Ashish Tiwari:
Assertion Checking over Combined Abstraction of Linear Arithmetic and Uninterpreted Functions.
ESOP 2006: 279-293 |
| 11 | EE | Sumit Gulwani,
Ashish Tiwari:
Combining abstract interpreters.
PLDI 2006: 376-386 |
| 2005 |
| 10 | EE | George C. Necula,
Sumit Gulwani:
Randomized Algorithms for Program Analysis and Verification.
CAV 2005: 1 |
| 9 | EE | Sumit Gulwani,
George C. Necula:
Precise interprocedural analysis using random interpretation.
POPL 2005: 324-337 |
| 8 | EE | Sumit Gulwani,
George C. Necula:
A randomized satisfiability procedure for arithmetic and uninterpreted function symbols.
Inf. Comput. 199(1-2): 107-131 (2005) |
| 2004 |
| 7 | EE | Sumit Gulwani,
Ashish Tiwari,
George C. Necula:
Join Algorithms for the Theory of Uninterpreted Functions.
FSTTCS 2004: 311-323 |
| 6 | EE | Sumit Gulwani,
George C. Necula:
Global value numbering using random interpretation.
POPL 2004: 342-352 |
| 5 | EE | Sumit Gulwani,
George C. Necula:
A Polynomial-Time Algorithm for Global Value Numbering.
SAS 2004: 212-227 |
| 4 | EE | Sumit Gulwani,
George C. Necula:
Path-Sensitive Analysis for Linear Arithmetic and Uninterpreted Functions.
SAS 2004: 328-343 |
| 2003 |
| 3 | EE | Sumit Gulwani,
George C. Necula:
A Randomized Satisfability Procedure for Arithmetic and Uninterpreted Function Symbols.
CADE 2003: 167-181 |
| 2 | EE | Sumit Gulwani,
George C. Necula:
Discovering affine equalities using random interpretation.
POPL 2003: 74-84 |
| 2001 |
| 1 | | Sumit Gulwani,
A. Tarachandani,
Deepak Gupta,
Dheeraj Sanghi,
Luciano Porto Barreto,
Gilles Muller,
Charles Consel:
WebCaL - a domain specific language for web caching.
Computer Communications 24(2): 191-201 (2001) |