dblp.uni-trier.dewww.uni-trier.de

Shmuel Sagiv

Mooly Sagiv

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo
Home Page

2009
103EESumit Gulwani, Tal Lev-Ami, Mooly Sagiv: A combination framework for tracking partition sizes. POPL 2009: 239-251
102EEMooly Sagiv: Thread-Modular Shape Analysis. VMCAI 2009: 3
101EETal Lev-Ami, Neil Immerman, Thomas W. Reps, Mooly Sagiv, Siddharth Srivastava, Greta Yorsh: Simulating reachability using first-order logic with applications to verification of linked data structures CoRR abs/0904.4902: (2009)
2008
100EEByron Cook, Sumit Gulwani, Tal Lev-Ami, Andrey Rybalchenko, Mooly Sagiv: Proving Conditional Termination. CAV 2008: 328-340
99EEJosh Berdine, Tal Lev-Ami, Roman Manevich, G. Ramalingam, Shmuel Sagiv: Thread Quantification for Concurrent Shape Analysis. CAV 2008: 399-413
98EEAziem Chawdhary, Byron Cook, Sumit Gulwani, Mooly Sagiv, Hongseok Yang: Ranking Abstractions. ESOP 2008: 148-162
97EENurit Dor, Tal Lev-Ami, Shay Litvak, Mooly Sagiv, Dror Weiss: Customization change impact analysis for erp professionals via program slicing. ISSTA 2008: 97-108
96EERoman Manevich, Tal Lev-Ami, Mooly Sagiv, Ganesan Ramalingam, Josh Berdine: Heap Decomposition for Concurrent Shape Analysis. SAS 2008: 363-377
95EENoam Rinetzky, G. Ramalingam, Shmuel Sagiv, Eran Yahav: On the complexity of partially-flow-sensitive alias analysis. ACM Trans. Program. Lang. Syst. 30(3): (2008)
2007
94 Greg Morrisett, Mooly Sagiv: Proceedings of the 6th International Symposium on Memory Management, ISMM 2007, Montreal, Quebec, Canada, October 21-22, 2007 ACM 2007
93 Thomas W. Reps, Mooly Sagiv, Jörg Bauer: Program Analysis and Compilation, Theory and Practice, Essays Dedicated to Reinhard Wilhelm on the Occasion of His 60th Birthday Springer 2007
92EEAlexey Gotsman, Josh Berdine, Byron Cook, Noam Rinetzky, Mooly Sagiv: Local Reasoning for Storable Locks and Threads. APLAS 2007: 19-37
91EETal Lev-Ami, Christoph Weidenbach, Thomas W. Reps, Mooly Sagiv: Labelled Clauses. CADE 2007: 311-327
90EEIgor Bogudlov, Tal Lev-Ami, Thomas W. Reps, Mooly Sagiv: Revamping TVLA: Making Parametric Shape Analysis Competitive. CAV 2007: 221-225
89EEDaphna Amit, Noam Rinetzky, Thomas W. Reps, Mooly Sagiv, Eran Yahav: Comparison Under Abstraction for Verifying Linearizability. CAV 2007: 477-490
88EEThomas Ball, Orna Kupferman, Mooly Sagiv: Leaping Loops in the Presence of Abstraction. CAV 2007: 491-503
87EENoam Rinetzky, Arnd Poetzsch-Heffter, Ganesan Ramalingam, Mooly Sagiv, Eran Yahav: Modular Shape Analysis for Dynamically Encapsulated Programs. ESOP 2007: 220-236
86EEAharon Abadi, Alexander Moshe Rabinovich, Mooly Sagiv: Decidable Fragments of Many-Sorted Logic. LPAR 2007: 17-31
85EEAlexey Gotsman, Josh Berdine, Byron Cook, Mooly Sagiv: Thread-modular shape analysis. PLDI 2007: 266-277
84EEGuy Gueta, Cormac Flanagan, Eran Yahav, Mooly Sagiv: Cartesian Partial-Order Reduction. SPIN 2007: 95-112
83EERoman Manevich, Josh Berdine, Byron Cook, G. Ramalingam, Mooly Sagiv: Shape Analysis by Graph Decomposition. TACAS 2007: 3-18
82EETal Lev-Ami, Mooly Sagiv, Neil Immerman, Thomas W. Reps: Constructing Specialized Shape Analyses for Uniform Change. VMCAI 2007: 215-233
81EEGreta Yorsh, Thomas W. Reps, Mooly Sagiv, Reinhard Wilhelm: Logical characterizations of heap abstractions. ACM Trans. Comput. Log. 8(1): (2007)
80EEMooly Sagiv: Introduction to special ESOP'05 issue. ACM Trans. Program. Lang. Syst. 29(5): (2007)
79EEGreta Yorsh, Alexander Moshe Rabinovich, Mooly Sagiv, Antoine Meyer, Ahmed Bouajjani: A Logic of Reachable Patterns in Linked Data-Structures CoRR abs/0705.3610: (2007)
78EEGreta Yorsh, Alexander Moshe Rabinovich, Mooly Sagiv, Antoine Meyer, Ahmed Bouajjani: A logic of reachable patterns in linked data-structures. J. Log. Algebr. Program. 73(1-2): 111-142 (2007)
77EEOhad Shacham, Mooly Sagiv, Assaf Schuster: Scaling model checking of dataraces using dynamic information. J. Parallel Distrib. Comput. 67(5): 536-550 (2007)
2006
76EETal Lev-Ami, Neil Immerman, Shmuel Sagiv: Abstraction for Shape Analysis with Fast and Precise Transformers. CAV 2006: 547-561
75EEGreta Yorsh, Alexander Moshe Rabinovich, Mooly Sagiv, Antoine Meyer, Ahmed Bouajjani: A Logic of Reachable Patterns in Linked Data-Structures. FoSSaCS 2006: 94-110
74EEGreta Yorsh, Thomas Ball, Mooly Sagiv: Testing, abstraction, theorem proving: better together! ISSTA 2006: 145-156
73EEThomas W. Reps, Mooly Sagiv, Jörg Bauer: An Appreciation of the Work of Reinhard Wilhelm. Program Analysis and Compilation 2006: 1-11
72EEAlexey Loginov, Thomas W. Reps, Mooly Sagiv: Refinement-Based Verification for Possibly-Cyclic Lists. Program Analysis and Compilation 2006: 247-272
71EERoman Manevich, John Field, Thomas A. Henzinger, G. Ramalingam, Mooly Sagiv: Abstract Counterexample-Based Refinement for Powerset Domains. Program Analysis and Compilation 2006: 273-292
70EEAlexey Loginov, Thomas W. Reps, Mooly Sagiv: Automated Verification of the Deutsch-Schorr-Waite Tree-Traversal Algorithm. SAS 2006: 261-279
69EEGilad Arnold, Roman Manevich, Mooly Sagiv, Ran Shaham: Combining Shape Analyses by Intersecting Abstractions. VMCAI 2006: 33-48
68EEDanny Nebenzahl, Shmuel Sagiv, Avishai Wool: Install-Time Vaccination of Windows Executables to Defend against Stack Smashing Attacks. IEEE Trans. Dependable Sec. Comput. 3(1): 78-90 (2006)
67EEEran Yahav, Thomas W. Reps, Shmuel Sagiv, Reinhard Wilhelm: Verifying Temporal Heap Properties Specified via Evolution Logic. Logic Journal of the IGPL 14(5): 755-783 (2006)
2005
66 Shmuel Sagiv: Programming Languages and Systems, 14th European Symposium on Programming,ESOP 2005, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2005, Edinburgh, UK, April 4-8, 2005, Proceedings Springer 2005
65EETal 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. CADE 2005: 99-115
64EEAlexey Loginov, Thomas W. Reps, Shmuel Sagiv: Abstraction Refinement via Inductive Learning. CAV 2005: 519-533
63EEYair Sade, Shmuel Sagiv, Ran Shaham: Optimizing C Multithreaded Memory Management Using Thread-Local Storage. CC 2005: 137-155
62EENoam Rinetzky, Jörg Bauer, Thomas W. Reps, Shmuel Sagiv, Reinhard Wilhelm: A semantics for procedure local heaps and its abstractions. POPL 2005: 296-309
61EEDenis Gopan, Thomas W. Reps, Shmuel Sagiv: A framework for numeric analysis of array operations. POPL 2005: 338-350
60EEOhad Shacham, Mooly Sagiv, Assaf Schuster: Scaling model checking of dataraces using dynamic information. PPOPP 2005: 107-118
59EENoam Rinetzky, Mooly Sagiv, Eran Yahav: Interprocedural Shape Analysis for Cutpoint-Free Programs. SAS 2005: 284-302
58EEShlomi Dolev, Yinnon A. Haviv, Mooly Sagiv: Self-stabilization Preserving Compiler. Self-Stabilizing Systems 2005: 81-95
57EERoman Manevich, Eran Yahav, Ganesan Ramalingam, Shmuel Sagiv: Predicate Abstraction and Canonical Abstraction for Singly-Linked Lists. VMCAI 2005: 181-198
56EENurit Dor, John Field, Denis Gopan, Tal Lev-Ami, Alexey Loginov, Roman Manevich, G. Ramalingam, Thomas W. Reps, Noam Rinetzky, Mooly Sagiv, Reinhard Wilhelm, Eran Yahav, Greta Yorsh: Automatic Verification of Strongly Dynamic Software Systems. VSTTE 2005: 82-92
55EEGreta Yorsh, Alexey Skidanov, Thomas W. Reps, Shmuel Sagiv: Automatic Assume/Guarantee Reasoning for Heap-Manipulating Programs: Ongoing Work. Electr. Notes Theor. Comput. Sci. 131: 125-138 (2005)
54EERan Shaham, Eran Yahav, Elliot K. Kolodner, Mooly Sagiv: Establishing local temporal heap safety properties with applications to compile-time memory management. Sci. Comput. Program. 58(1-2): 264-289 (2005)
2004
53EEThomas W. Reps, Shmuel Sagiv, Reinhard Wilhelm: Static Program Analysis via 3-Valued Logic. CAV 2004: 15-30
52EENeil Immerman, Alexander Moshe Rabinovich, Thomas W. Reps, Shmuel Sagiv, Greta Yorsh: Verification via Structure Simulation. CAV 2004: 281-294
51EENeil Immerman, Alexander Moshe Rabinovich, Thomas W. Reps, Shmuel Sagiv, Greta Yorsh: The Boundary Between Decidability and Undecidability for Transitive-Closure Logics. CSL 2004: 160-174
50 Tal Lev-Ami, Roman Manevich, Shmuel Sagiv: TVLA: A system for generating abstract interpreters. IFIP Congress Topical Sessions 2004: 367-376
49EEBertrand Jeannet, Alexey Loginov, Thomas W. Reps, Shmuel Sagiv: A Relational Approach to Interprocedural Shape Analysis. SAS 2004: 246-264
48EERoman Manevich, Shmuel Sagiv, Ganesan Ramalingam, John Field: Partially Disjunctive Heap Abstraction. SAS 2004: 265-279
47EEDenis Gopan, Frank DiMaio, Nurit Dor, Thomas W. Reps, Shmuel Sagiv: Numeric Domains with Summarized Dimensions. TACAS 2004: 512-529
46EEGreta Yorsh, Thomas W. Reps, Shmuel Sagiv: Symbolically Computing Most-Precise Abstract Operations for Shape Analysis. TACAS 2004: 530-545
45EEThomas W. Reps, Shmuel Sagiv, Greta Yorsh: Symbolic Implementation of the Best Transformer. VMCAI 2004: 252-266
44EEShmuel Sagiv: On the Expressive Power of Canonical Abstraction. VMCAI 2004: 58
2003
43EEEran Yahav, Thomas W. Reps, Shmuel Sagiv, Reinhard Wilhelm: Verifying Temporal Heap Properties Specified via Evolution Logic. ESOP 2003: 204-222
42EEThomas W. Reps, Shmuel Sagiv, Alexey Loginov: Finite Differencing of Logical Formulas for Static Analysis. ESOP 2003: 380-398
41EENurit Dor, Michael Rodeh, Shmuel Sagiv: CSSV: towards a realistic tool for statically detecting all buffer overflows in C. PLDI 2003: 155-167
40EERan Shaham, Eran Yahav, Elliot K. Kolodner, Shmuel Sagiv: Establishing Local Temporal Heap Safety Properties with Applications to Compile-Time Memory Management. SAS 2003: 483-503
39EEGreta Yorsh, Thomas W. Reps, Shmuel Sagiv, Reinhard Wilhelm: Logical Characterizations of Heap Abstractions CoRR cs.LO/0312014: (2003)
38EEEran Yahav, Shmuel Sagiv: Automatically Verifying Concurrent Queue Algorithms. Electr. Notes Theor. Comput. Sci. 89(3): (2003)
2002
37EEDavid Oren, Yossi Matias, Shmuel Sagiv: Online Subpath Profiling. CC 2002: 78-94
36EEThomas W. Reps, Alexey Loginov, Shmuel Sagiv: Semantic Minimization of 3-Valued Propositional Formulae. LICS 2002: 40-
35EERan Shaham, Elliot K. Kolodner, Shmuel Sagiv: Estimating the impact of heap liveness information on space consumption in Java. MSP/ISMM 2002: 171-182
34EEG. Ramalingam, Alex Varshavsky, John Field, Deepak Goyal, Shmuel Sagiv: Deriving Specialized Program Analyses for Certifying Component-Client Conformance. PLDI 2002: 83-94
33EERoman Manevich, G. Ramalingam, John Field, Deepak Goyal, Shmuel Sagiv: Compactly Representing First-Order Structures for Static Analysis. SAS 2002: 196-212
32 Reinhard Wilhelm, Thomas W. Reps, Shmuel Sagiv: Shape Analysis and Applications. The Compiler Design Handbook 2002: 175-218
31EEShmuel Sagiv, Thomas W. Reps, Reinhard Wilhelm: Parametric shape analysis via 3-valued logic. ACM Trans. Program. Lang. Syst. 24(3): 217-298 (2002)
2001
30EENoam Rinetzky, Shmuel Sagiv: Interprocedural Shape Analysis for Recursive Programs. CC 2001: 133-149
29 Ran Shaham, Elliot K. Kolodner, Shmuel Sagiv: Heap Profiling for Space-Efficient Java. PLDI 2001: 104-113
28EENurit Dor, Michael Rodeh, Shmuel Sagiv: Cleanness Checking of String Manipulations in C Programs via Integer Analysis. SAS 2001: 194-212
27EEFlemming Nielson, Hanne Riis Nielson, Shmuel Sagiv: Kleene's Logic with Equality. Inf. Process. Lett. 80(3): 131-137 (2001)
2000
26EEReinhard Wilhelm, Shmuel Sagiv, Thomas W. Reps: Shape Analysis. CC 2000: 1-17
25EERan Shaham, Elliot K. Kolodner, Shmuel Sagiv: Automatic Removal of Array Memory Leaks in Java. CC 2000: 50-66
24EEFlemming Nielson, Hanne Riis Nielson, Shmuel Sagiv: A Kleene Analysis of Mobile Ambients. ESOP 2000: 305-319
23 Ran Shaham, Elliot K. Kolodner, Shmuel Sagiv: On the Effectiveness of GC in Java. ISMM 2000: 12-17
22EETal Lev-Ami, Thomas W. Reps, Shmuel Sagiv, Reinhard Wilhelm: Putting static analysis to work for verification: A case study. ISSTA 2000: 26-38
21 Nurit Dor, Michael Rodeh, Shmuel Sagiv: Checking Cleanness in Linked Lists. SAS 2000: 115-134
20 Tal Lev-Ami, Shmuel Sagiv: TVLA: A System for Implementing Static Analyses. SAS 2000: 280-301
1999
19EEMichael Benedikt, Thomas W. Reps, Shmuel Sagiv: A Decidable Logic for Describing Linked Data Structures. ESOP 1999: 2-19
18EEShmuel Sagiv, Thomas W. Reps, Reinhard Wilhelm: Parametric Shape Analysis via 3-Valued Logic. POPL 1999: 105-118
17EEMichael Rodeh, Shmuel Sagiv: Finding Circular Attributes in Attribute Grammars. J. ACM 46(4): 556 (1999)
1998
16EEJohn L. Ross, Shmuel Sagiv: Building a Bridge between Pointer Aliases and Program Dependences. ESOP 1998: 221-235
15EENurit Dor, Michael Rodeh, Shmuel Sagiv: Detecting Memory Errors via Static Pointer Analysis (Preliminary Experience). PASTE 1998: 27-34
14EEThomas Ball, Peter Mataga, Shmuel Sagiv: Edge Profiling versus Path Profiling: The Showdown. POPL 1998: 134-148
13EEShmuel Sagiv, Thomas W. Reps, Reinhard Wilhelm: Solving Shape-Analysis Problems in Languages with Destructive Updating. ACM Trans. Program. Lang. Syst. 20(1): 1-50 (1998)
12EEShmuel Sagiv, Nissim Francez, Michael Rodeh, Reinhard Wilhelm: A Logic-Based Approach to Program Flow Analysis. Acta Inf. 35(6): 457-504 (1998)
11 John L. Ross, Shmuel Sagiv: Building a Bridge between Pointer Aliases and Program Dependences. Nord. J. Comput. 5(4): 361- (1998)
1996
10EEShmuel Sagiv, Thomas W. Reps, Reinhard Wilhelm: Solving Shape-Analysis Problems in Languages with Destructive Updating. POPL 1996: 16-31
9EEShmuel Sagiv, Thomas W. Reps, Susan Horwitz: Precise Interprocedural Dataflow Analysis with Applications to Constant Propagation. Theor. Comput. Sci. 167(1&2): 131-170 (1996)
1995
8 Thomas W. Reps, Susan Horwitz, Shmuel Sagiv: Precise Interprocedural Dataflow Analysis via Graph Reachability. POPL 1995: 49-61
7EESusan Horwitz, Thomas W. Reps, Shmuel Sagiv: Demand Interprocedural Dataflow Analysis. SIGSOFT FSE 1995: 104-115
6 Shmuel Sagiv, Thomas W. Reps, Susan Horwitz: Precise Interprocedural Dataflow Analysis with Applications to Constant Propagation. TAPSOFT 1995: 651-665
1994
5EEThomas W. Reps, Susan Horwitz, Shmuel Sagiv, Genevieve Rosay: Speeding up Slicing. SIGSOFT FSE 1994: 11-20
1992
4 David Bernstein, Michael Rodeh, Shmuel Sagiv: Proving Safety of Speculative Load Instructions at Compile Time. ESOP 1992: 56-72
3 Johann A. Makowsky, J.-C. Gregoire, Shmuel Sagiv: The Expressive Power of Side Effects in Prolog. J. Log. Program. 12(1&2): 179-188 (1992)
1990
2 Shmuel Sagiv, Nissim Francez, Michael Rodeh, Reinhard Wilhelm: A Logic-Based Approach to Data Flow Analysis Problem. PLILP 1990: 277-292
1989
1 Shmuel Sagiv, O. Edelstein, Nissim Francez, Michael Rodeh: Resolving Circularity in Attribute Grammars with Applications to Data Flow Analysis. POPL 1989: 36-48

Coauthor Index

1Aharon Abadi [86]
2Daphna Amit [89]
3Gilad Arnold [69]
4Thomas Ball [14] [74] [88]
5Michael Benedikt [19]
6Josh Berdine [83] [85] [92] [96] [99]
7David Bernstein [4]
8Igor Bogudlov [90]
9Ahmed Bouajjani [75] [78] [79]
10Aziem Chawdhary [98]
11Byron Cook [83] [85] [92] [98] [100]
12Frank DiMaio [47]
13Shlomi Dolev [58]
14Nurit Dor [15] [21] [28] [41] [47] [56] [97]
15O. Edelstein [1]
16John Field [33] [34] [48] [56] [71]
17Cormac Flanagan [84]
18Nissim Francez [1] [2] [12]
19Denis Gopan [47] [56] [61]
20Alexey Gotsman [85] [92]
21Deepak Goyal [33] [34]
22J.-C. Gregoire [3]
23Guy Gueta [84]
24Sumit Gulwani [98] [100] [103]
25Yinnon A. Haviv [58]
26Thomas A. Henzinger [71]
27Susan Horwitz [5] [6] [7] [8] [9]
28Neil Immerman [51] [52] [65] [76] [82] [101]
29Bertrand Jeannet [49]
30Elliot K. Kolodner [23] [25] [29] [35] [40] [54]
31Jörg Kreiker (Jörg Bauer) [62] [73] [93]
32Orna Kupferman [88]
33Tal Lev-Ami [20] [22] [50] [56] [65] [76] [82] [90] [91] [96] [97] [99] [100] [101] [103]
34Shay Litvak [97]
35Alexey Loginov [36] [42] [49] [56] [64] [70] [72]
36Johann A. Makowsky (Janos Makowsky) [3]
37Roman Manevich [33] [48] [50] [56] [57] [69] [71] [83] [96] [99]
38Peter Mataga [14]
39Yossi Matias [37]
40Antoine Meyer [75] [78] [79]
41J. Gregory Morrisett (Greg Morrisett) [94]
42Danny Nebenzahl [68]
43Flemming Nielson [24] [27]
44Hanne Riis Nielson [24] [27]
45David Oren [37]
46Arnd Poetzsch-Heffter [87]
47Alexander Moshe Rabinovich (Alexander Rabinovich) [51] [52] [75] [78] [79] [86]
48G. Ramalingam (Ganesan Ramalingam) [33] [34] [48] [56] [57] [71] [83] [87] [95] [96] [99]
49Thomas W. Reps [5] [6] [7] [8] [9] [10] [13] [18] [19] [22] [26] [31] [32] [36] [39] [42] [43] [45] [46] [47] [49] [51] [52] [53] [55] [56] [61] [62] [64] [65] [67] [70] [72] [73] [81] [82] [89] [90] [91] [93] [101]
50Noam Rinetzky [30] [56] [59] [62] [87] [89] [92] [95]
51Michael Rodeh [1] [2] [4] [12] [15] [17] [21] [28] [41]
52Genevieve Rosay [5]
53John L. Ross [11] [16]
54Andrey Rybalchenko [100]
55Yair Sade [63]
56Assaf Schuster [60] [77]
57Ohad Shacham [60] [77]
58Ran Shaham [23] [25] [29] [35] [40] [54] [63] [69]
59Alexey Skidanov [55]
60S. Srivastava [65]
61Siddharth Srivastava [101]
62Alex Varshavsky [34]
63Christoph Weidenbach [91]
64Dror Weiss [97]
65Reinhard Wilhelm [2] [10] [12] [13] [18] [22] [26] [31] [32] [39] [43] [53] [56] [62] [67] [81]
66Avishai Wool [68]
67Eran Yahav [38] [40] [43] [54] [56] [57] [59] [67] [84] [87] [89] [95]
68Hongseok Yang [98]
69Greta Yorsh [39] [45] [46] [51] [52] [55] [56] [65] [74] [75] [78] [79] [81] [101]

Colors in the list of coauthors

Home | Conferences | Journals | Series | FAQ — Search: Faceted | Complete | Author
Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)