Search the dblp DataBase

Publications of Author

1. Sumit Gulwani, George C. Necula
   A Randomized Satisfability Procedure for Arithmetic and Uninterpreted Function Symbols. [Citation Graph (0, 0)][DBLP]
   CADE, 2003, pp:167-181 [Conf]
   
2. George C. Necula, Sumit Gulwani
   Randomized Algorithms for Program Analysis and Verification. [Citation Graph (0, 0)][DBLP]
   CAV, 2005, pp:1- [Conf]
   
3. Sumit Gulwani, Ashish Tiwari
   Assertion Checking over Combined Abstraction of Linear Arithmetic and Uninterpreted Functions. [Citation Graph (0, 0)][DBLP]
   ESOP, 2006, pp:279-293 [Conf]
   
4. Sumit Gulwani, Ashish Tiwari, George C. Necula
   Join Algorithms for the Theory of Uninterpreted Functions. [Citation Graph (0, 0)][DBLP]
   FSTTCS, 2004, pp:311-323 [Conf]
   
5. Sumit Gulwani, Ashish Tiwari
   Combining abstract interpreters. [Citation Graph (0, 0)][DBLP]
   PLDI, 2006, pp:376-386 [Conf]
   
6. Sumit Gulwani, George C. Necula
   Discovering affine equalities using random interpretation. [Citation Graph (0, 0)][DBLP]
   POPL, 2003, pp:74-84 [Conf]
   
7. Sumit Gulwani, George C. Necula
   Global value numbering using random interpretation. [Citation Graph (0, 0)][DBLP]
   POPL, 2004, pp:342-352 [Conf]
   
8. Sumit Gulwani, George C. Necula
   Precise interprocedural analysis using random interpretation. [Citation Graph (0, 0)][DBLP]
   POPL, 2005, pp:324-337 [Conf]
   
9. Sumit Gulwani, Nebojsa Jojic
   Program verification as probabilistic inference. [Citation Graph (0, 0)][DBLP]
   POPL, 2007, pp:277-289 [Conf]
   
10. Sumit Gulwani, George C. Necula
    A Polynomial-Time Algorithm for Global Value Numbering. [Citation Graph (0, 0)][DBLP]
    SAS, 2004, pp:212-227 [Conf]
    
11. Sumit Gulwani, George C. Necula
    Path-Sensitive Analysis for Linear Arithmetic and Uninterpreted Functions. [Citation Graph (0, 0)][DBLP]
    SAS, 2004, pp:328-343 [Conf]
    
12. Sumit Gulwani, A. Tarachandani, Deepak Gupta, Dheeraj Sanghi, Luciano Porto Barreto, Gilles Muller, Charles Consel
    WebCaL - a domain specific language for web caching. [Citation Graph (0, 0)][DBLP]
    Computer Communications, 2001, v:24, n:2, pp:191-201 [Journal]
    
13. Sumit Gulwani, George C. Necula
    A randomized satisfiability procedure for arithmetic and uninterpreted function symbols. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2005, v:199, n:1-2, pp:107-131 [Journal]
    
14. Sumit Gulwani, George C. Necula
    A polynomial-time algorithm for global value numbering. [Citation Graph (0, 0)][DBLP]
    Sci. Comput. Program., 2007, v:64, n:1, pp:97-114 [Journal]
    
15. Ashish Tiwari, Sumit Gulwani
    Logical Interpretation: Static Program Analysis Using Theorem Proving. [Citation Graph (0, 0)][DBLP]
    CADE, 2007, pp:147-166 [Conf]
    
16. Sumit Gulwani, Ashish Tiwari
    An Abstract Domain for Analyzing Heap-Manipulating Low-Level Software. [Citation Graph (0, 0)][DBLP]
    CAV, 2007, pp:379-392 [Conf]
    
17. Sumit Gulwani, Ashish Tiwari
    Computing Procedure Summaries for Interprocedural Analysis. [Citation Graph (0, 0)][DBLP]
    ESOP, 2007, pp:253-267 [Conf]
    
18. 
    Constraint-Based Approach for Analysis of Hybrid Systems. [Citation Graph (, )][DBLP]
    
    
19. 
    Proving Conditional Termination. [Citation Graph (, )][DBLP]
    
    
20. 
    A Numerical Abstract Domain Based on Expression Abstraction and Max Operator with Application in Timing Analysis. [Citation Graph (, )][DBLP]
    
    
21. 
    VS3: SMT Solvers for Program Verification. [Citation Graph (, )][DBLP]
    
    
22. 
    SPEED: Symbolic Complexity Bound Analysis. [Citation Graph (, )][DBLP]
    
    
23. 
    Ranking Abstractions. [Citation Graph (, )][DBLP]
    
    
24. 
    Cover Algorithms and Their Combination. [Citation Graph (, )][DBLP]
    
    
25. 
    Oracle-guided component-based program synthesis. [Citation Graph (, )][DBLP]
    
    
26. 
    Inferring locks for atomic sections. [Citation Graph (, )][DBLP]
    
    
27. 
    Program analysis as constraint solving. [Citation Graph (, )][DBLP]
    
    
28. 
    Program verification using templates over predicate abstraction. [Citation Graph (, )][DBLP]
    
    
29. 
    Control-flow refinement and progress invariants for bound analysis. [Citation Graph (, )][DBLP]
    
    
30. 
    The reachability-bound problem. [Citation Graph (, )][DBLP]
    
    
31. 
    Lifting abstract interpreters to quantified logical domains. [Citation Graph (, )][DBLP]
    
    
32. 
    SPEED: precise and efficient static estimation of program computational complexity. [Citation Graph (, )][DBLP]
    
    
33. 
    A combination framework for tracking partition sizes. [Citation Graph (, )][DBLP]
    
    
34. 
    Continuity analysis of programs. [Citation Graph (, )][DBLP]
    
    
35. 
    From program verification to program synthesis. [Citation Graph (, )][DBLP]
    
    
36. 
    Dimensions in program synthesis. [Citation Graph (, )][DBLP]
    
    
37. 
    Assertion Checking Unified. [Citation Graph (, )][DBLP]
    
    
38. 
    Synthesizing Switching Logic Using Constraint Solving. [Citation Graph (, )][DBLP]
    
    
39. 
    Constraint-Based Invariant Inference over Predicate Abstraction. [Citation Graph (, )][DBLP]