The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Shmuel Sagiv: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Tal Lev-Ami, Neil Immerman, Thomas W. Reps, Shmuel Sagiv, S. Srivastava, Greta Yorsh
    Simulating Reachability Using First-Order Logic with Applications to Verification of Linked Data Structures. [Citation Graph (0, 0)][DBLP]
    CADE, 2005, pp:99-115 [Conf]
  2. Neil Immerman, Alexander Moshe Rabinovich, Thomas W. Reps, Shmuel Sagiv, Greta Yorsh
    Verification via Structure Simulation. [Citation Graph (0, 0)][DBLP]
    CAV, 2004, pp:281-294 [Conf]
  3. Tal Lev-Ami, Neil Immerman, Shmuel Sagiv
    Abstraction for Shape Analysis with Fast and Precise Transformers. [Citation Graph (0, 0)][DBLP]
    CAV, 2006, pp:547-561 [Conf]
  4. Alexey Loginov, Thomas W. Reps, Shmuel Sagiv
    Abstraction Refinement via Inductive Learning. [Citation Graph (0, 0)][DBLP]
    CAV, 2005, pp:519-533 [Conf]
  5. Thomas W. Reps, Shmuel Sagiv, Reinhard Wilhelm
    Static Program Analysis via 3-Valued Logic. [Citation Graph (0, 0)][DBLP]
    CAV, 2004, pp:15-30 [Conf]
  6. David Oren, Yossi Matias, Shmuel Sagiv
    Online Subpath Profiling. [Citation Graph (0, 0)][DBLP]
    CC, 2002, pp:78-94 [Conf]
  7. Noam Rinetzky, Shmuel Sagiv
    Interprocedural Shape Analysis for Recursive Programs. [Citation Graph (0, 0)][DBLP]
    CC, 2001, pp:133-149 [Conf]
  8. Yair Sade, Shmuel Sagiv, Ran Shaham
    Optimizing C Multithreaded Memory Management Using Thread-Local Storage. [Citation Graph (0, 0)][DBLP]
    CC, 2005, pp:137-155 [Conf]
  9. Ran Shaham, Elliot K. Kolodner, Shmuel Sagiv
    Automatic Removal of Array Memory Leaks in Java. [Citation Graph (0, 0)][DBLP]
    CC, 2000, pp:50-66 [Conf]
  10. Reinhard Wilhelm, Shmuel Sagiv, Thomas W. Reps
    Shape Analysis. [Citation Graph (0, 0)][DBLP]
    CC, 2000, pp:1-17 [Conf]
  11. Neil Immerman, Alexander Moshe Rabinovich, Thomas W. Reps, Shmuel Sagiv, Greta Yorsh
    The Boundary Between Decidability and Undecidability for Transitive-Closure Logics. [Citation Graph (0, 0)][DBLP]
    CSL, 2004, pp:160-174 [Conf]
  12. Michael Benedikt, Thomas W. Reps, Shmuel Sagiv
    A Decidable Logic for Describing Linked Data Structures. [Citation Graph (0, 0)][DBLP]
    ESOP, 1999, pp:2-19 [Conf]
  13. David Bernstein, Michael Rodeh, Shmuel Sagiv
    Proving Safety of Speculative Load Instructions at Compile Time. [Citation Graph (0, 0)][DBLP]
    ESOP, 1992, pp:56-72 [Conf]
  14. Flemming Nielson, Hanne Riis Nielson, Shmuel Sagiv
    A Kleene Analysis of Mobile Ambients. [Citation Graph (0, 0)][DBLP]
    ESOP, 2000, pp:305-319 [Conf]
  15. Thomas W. Reps, Shmuel Sagiv, Alexey Loginov
    Finite Differencing of Logical Formulas for Static Analysis. [Citation Graph (0, 0)][DBLP]
    ESOP, 2003, pp:380-398 [Conf]
  16. John L. Ross, Shmuel Sagiv
    Building a Bridge between Pointer Aliases and Program Dependences. [Citation Graph (0, 0)][DBLP]
    ESOP, 1998, pp:221-235 [Conf]
  17. Eran Yahav, Thomas W. Reps, Shmuel Sagiv, Reinhard Wilhelm
    Verifying Temporal Heap Properties Specified via Evolution Logic. [Citation Graph (0, 0)][DBLP]
    ESOP, 2003, pp:204-222 [Conf]
  18. Tal Lev-Ami, Roman Manevich, Shmuel Sagiv
    TVLA: A system for generating abstract interpreters. [Citation Graph (0, 0)][DBLP]
    IFIP Congress Topical Sessions, 2004, pp:367-376 [Conf]
  19. Tal Lev-Ami, Thomas W. Reps, Shmuel Sagiv, Reinhard Wilhelm
    Putting static analysis to work for verification: A case study. [Citation Graph (0, 0)][DBLP]
    ISSTA, 2000, pp:26-38 [Conf]
  20. Ran Shaham, Elliot K. Kolodner, Shmuel Sagiv
    On the Effectiveness of GC in Java. [Citation Graph (0, 0)][DBLP]
    ISMM, 2000, pp:12-17 [Conf]
  21. Ran Shaham, Elliot K. Kolodner, Shmuel Sagiv
    Estimating the impact of heap liveness information on space consumption in Java. [Citation Graph (0, 0)][DBLP]
    MSP/ISMM, 2002, pp:171-182 [Conf]
  22. Thomas W. Reps, Alexey Loginov, Shmuel Sagiv
    Semantic Minimization of 3-Valued Propositional Formulae. [Citation Graph (0, 0)][DBLP]
    LICS, 2002, pp:40-0 [Conf]
  23. Nurit Dor, Michael Rodeh, Shmuel Sagiv
    Detecting Memory Errors via Static Pointer Analysis (Preliminary Experience). [Citation Graph (0, 0)][DBLP]
    PASTE, 1998, pp:27-34 [Conf]
  24. Nurit Dor, Michael Rodeh, Shmuel Sagiv
    CSSV: towards a realistic tool for statically detecting all buffer overflows in C. [Citation Graph (0, 0)][DBLP]
    PLDI, 2003, pp:155-167 [Conf]
  25. G. Ramalingam, Alex Varshavsky, John Field, Deepak Goyal, Shmuel Sagiv
    Deriving Specialized Program Analyses for Certifying Component-Client Conformance. [Citation Graph (0, 0)][DBLP]
    PLDI, 2002, pp:83-94 [Conf]
  26. Ran Shaham, Elliot K. Kolodner, Shmuel Sagiv
    Heap Profiling for Space-Efficient Java. [Citation Graph (0, 0)][DBLP]
    PLDI, 2001, pp:104-113 [Conf]
  27. Shmuel Sagiv, Nissim Francez, Michael Rodeh, Reinhard Wilhelm
    A Logic-Based Approach to Data Flow Analysis Problem. [Citation Graph (0, 0)][DBLP]
    PLILP, 1990, pp:277-292 [Conf]
  28. Thomas Ball, Peter Mataga, Shmuel Sagiv
    Edge Profiling versus Path Profiling: The Showdown. [Citation Graph (0, 0)][DBLP]
    POPL, 1998, pp:134-148 [Conf]
  29. Denis Gopan, Thomas W. Reps, Shmuel Sagiv
    A framework for numeric analysis of array operations. [Citation Graph (0, 0)][DBLP]
    POPL, 2005, pp:338-350 [Conf]
  30. Thomas W. Reps, Susan Horwitz, Shmuel Sagiv
    Precise Interprocedural Dataflow Analysis via Graph Reachability. [Citation Graph (0, 0)][DBLP]
    POPL, 1995, pp:49-61 [Conf]
  31. Noam Rinetzky, Jörg Bauer, Thomas W. Reps, Shmuel Sagiv, Reinhard Wilhelm
    A semantics for procedure local heaps and its abstractions. [Citation Graph (0, 0)][DBLP]
    POPL, 2005, pp:296-309 [Conf]
  32. Shmuel Sagiv, O. Edelstein, Nissim Francez, Michael Rodeh
    Resolving Circularity in Attribute Grammars with Applications to Data Flow Analysis. [Citation Graph (0, 0)][DBLP]
    POPL, 1989, pp:36-48 [Conf]
  33. Shmuel Sagiv, Thomas W. Reps, Reinhard Wilhelm
    Solving Shape-Analysis Problems in Languages with Destructive Updating. [Citation Graph (0, 0)][DBLP]
    POPL, 1996, pp:16-31 [Conf]
  34. Shmuel Sagiv, Thomas W. Reps, Reinhard Wilhelm
    Parametric Shape Analysis via 3-Valued Logic. [Citation Graph (0, 0)][DBLP]
    POPL, 1999, pp:105-118 [Conf]
  35. Nurit Dor, Michael Rodeh, Shmuel Sagiv
    Checking Cleanness in Linked Lists. [Citation Graph (0, 0)][DBLP]
    SAS, 2000, pp:115-134 [Conf]
  36. Nurit Dor, Michael Rodeh, Shmuel Sagiv
    Cleanness Checking of String Manipulations in C Programs via Integer Analysis. [Citation Graph (0, 0)][DBLP]
    SAS, 2001, pp:194-212 [Conf]
  37. Bertrand Jeannet, Alexey Loginov, Thomas W. Reps, Shmuel Sagiv
    A Relational Approach to Interprocedural Shape Analysis. [Citation Graph (0, 0)][DBLP]
    SAS, 2004, pp:246-264 [Conf]
  38. Tal Lev-Ami, Shmuel Sagiv
    TVLA: A System for Implementing Static Analyses. [Citation Graph (0, 0)][DBLP]
    SAS, 2000, pp:280-301 [Conf]
  39. Roman Manevich, G. Ramalingam, John Field, Deepak Goyal, Shmuel Sagiv
    Compactly Representing First-Order Structures for Static Analysis. [Citation Graph (0, 0)][DBLP]
    SAS, 2002, pp:196-212 [Conf]
  40. Roman Manevich, Shmuel Sagiv, Ganesan Ramalingam, John Field
    Partially Disjunctive Heap Abstraction. [Citation Graph (0, 0)][DBLP]
    SAS, 2004, pp:265-279 [Conf]
  41. Ran Shaham, Eran Yahav, Elliot K. Kolodner, Shmuel Sagiv
    Establishing Local Temporal Heap Safety Properties with Applications to Compile-Time Memory Management. [Citation Graph (0, 0)][DBLP]
    SAS, 2003, pp:483-503 [Conf]
  42. Susan Horwitz, Thomas W. Reps, Shmuel Sagiv
    Demand Interprocedural Dataflow Analysis. [Citation Graph (0, 0)][DBLP]
    SIGSOFT FSE, 1995, pp:104-115 [Conf]
  43. Thomas W. Reps, Susan Horwitz, Shmuel Sagiv, Genevieve Rosay
    Speeding up Slicing. [Citation Graph (0, 0)][DBLP]
    SIGSOFT FSE, 1994, pp:11-20 [Conf]
  44. Denis Gopan, Frank DiMaio, Nurit Dor, Thomas W. Reps, Shmuel Sagiv
    Numeric Domains with Summarized Dimensions. [Citation Graph (0, 0)][DBLP]
    TACAS, 2004, pp:512-529 [Conf]
  45. Greta Yorsh, Thomas W. Reps, Shmuel Sagiv
    Symbolically Computing Most-Precise Abstract Operations for Shape Analysis. [Citation Graph (0, 0)][DBLP]
    TACAS, 2004, pp:530-545 [Conf]
  46. Shmuel Sagiv, Thomas W. Reps, Susan Horwitz
    Precise Interprocedural Dataflow Analysis with Applications to Constant Propagation. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1995, pp:651-665 [Conf]
  47. Roman Manevich, Eran Yahav, Ganesan Ramalingam, Shmuel Sagiv
    Predicate Abstraction and Canonical Abstraction for Singly-Linked Lists. [Citation Graph (0, 0)][DBLP]
    VMCAI, 2005, pp:181-198 [Conf]
  48. Thomas W. Reps, Shmuel Sagiv, Greta Yorsh
    Symbolic Implementation of the Best Transformer. [Citation Graph (0, 0)][DBLP]
    VMCAI, 2004, pp:252-266 [Conf]
  49. Shmuel Sagiv
    On the Expressive Power of Canonical Abstraction. [Citation Graph (0, 0)][DBLP]
    VMCAI, 2004, pp:58- [Conf]
  50. Shmuel Sagiv, Nissim Francez, Michael Rodeh, Reinhard Wilhelm
    A Logic-Based Approach to Program Flow Analysis. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1998, v:35, n:6, pp:457-504 [Journal]
  51. Greta Yorsh, Thomas W. Reps, Shmuel Sagiv, Reinhard Wilhelm
    Logical Characterizations of Heap Abstractions [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  52. Eran Yahav, Shmuel Sagiv
    Automatically Verifying Concurrent Queue Algorithms. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2003, v:89, n:3, pp:- [Journal]
  53. Greta Yorsh, Alexey Skidanov, Thomas W. Reps, Shmuel Sagiv
    Automatic Assume/Guarantee Reasoning for Heap-Manipulating Programs: Ongoing Work. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2005, v:131, n:, pp:125-138 [Journal]
  54. Eran Yahav, Thomas W. Reps, Shmuel Sagiv, Reinhard Wilhelm
    Verifying Temporal Heap Properties Specified via Evolution Logic. [Citation Graph (0, 0)][DBLP]
    Logic Journal of the IGPL, 2006, v:14, n:5, pp:755-783 [Journal]
  55. Flemming Nielson, Hanne Riis Nielson, Shmuel Sagiv
    Kleene's Logic with Equality. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2001, v:80, n:3, pp:131-137 [Journal]
  56. Michael Rodeh, Shmuel Sagiv
    Finding Circular Attributes in Attribute Grammars. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1999, v:46, n:4, pp:556- [Journal]
  57. Johann A. Makowsky, J.-C. Gregoire, Shmuel Sagiv
    The Expressive Power of Side Effects in Prolog. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1992, v:12, n:1&2, pp:179-188 [Journal]
  58. John L. Ross, Shmuel Sagiv
    Building a Bridge between Pointer Aliases and Program Dependences. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1998, v:5, n:4, pp:361-0 [Journal]
  59. Shmuel Sagiv, Thomas W. Reps, Susan Horwitz
    Precise Interprocedural Dataflow Analysis with Applications to Constant Propagation. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:167, n:1&2, pp:131-170 [Journal]
  60. Danny Nebenzahl, Shmuel Sagiv, Avishai Wool
    Install-Time Vaccination of Windows Executables to Defend against Stack Smashing Attacks. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Dependable Sec. Comput., 2006, v:3, n:1, pp:78-90 [Journal]
  61. Shmuel Sagiv, Thomas W. Reps, Reinhard Wilhelm
    Parametric shape analysis via 3-valued logic. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 2002, v:24, n:3, pp:217-298 [Journal]
  62. Shmuel Sagiv, Thomas W. Reps, Reinhard Wilhelm
    Solving Shape-Analysis Problems in Languages with Destructive Updating. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1998, v:20, n:1, pp:1-50 [Journal]

  63. Thread Quantification for Concurrent Shape Analysis. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.006secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002