Shmuel Sagiv - researchr alias

researchr

You are not signed in
Sign in
Sign up

2008

Thread Quantification for Concurrent Shape AnalysisJosh Berdine, Tal Lev-Ami, Roman Manevich, Ganesan Ramalingam, Shmuel Sagiv. cav 2008: 399-413 [doi]

On the complexity of partially-flow-sensitive alias analysisNoam Rinetzky, Ganesan Ramalingam, Shmuel Sagiv, Eran Yahav. TOPLAS, 30(3), 2008. [doi]

2006

Abstraction for Shape Analysis with Fast and Precise TransformersTal Lev-Ami, Neil Immerman, Shmuel Sagiv. cav 2006: 547-561 [doi]

Install-Time Vaccination of Windows Executables to Defend against Stack Smashing AttacksDanny Nebenzahl, Shmuel Sagiv, Avishai Wool. tdsc, 3(1):78-90, 2006. [doi]

Verifying Temporal Heap Properties Specified via Evolution LogicEran Yahav, Thomas W. Reps, Shmuel Sagiv, Reinhard Wilhelm. igpl, 14(5):755-783, 2006. [doi]

2005

A framework for numeric analysis of array operationsDenis Gopan, Thomas W. Reps, Shmuel Sagiv. POPL 2005: 338-350 [doi]

Simulating Reachability Using First-Order Logic with Applications to Verification of Linked Data StructuresTal Lev-Ami, Neil Immerman, Thomas W. Reps, Shmuel Sagiv, S. Srivastava, Greta Yorsh. cade 2005: 99-115 [doi]

Abstraction Refinement via Inductive LearningAlexey Loginov, Thomas W. Reps, Shmuel Sagiv. cav 2005: 519-533 [doi]

Predicate Abstraction and Canonical Abstraction for Singly-Linked ListsRoman Manevich, Eran Yahav, Ganesan Ramalingam, Shmuel Sagiv. vmcai 2005: 181-198 [doi]

A semantics for procedure local heaps and its abstractionsNoam Rinetzky, Jörg Bauer, Thomas W. Reps, Shmuel Sagiv, Reinhard Wilhelm. POPL 2005: 296-309 [doi]

Optimizing C Multithreaded Memory Management Using Thread-Local StorageYair Sade, Shmuel Sagiv, Ran Shaham. CC 2005: 137-155 [doi]

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, ProceedingsShmuel Sagiv, editor, Volume 3444 of Lecture Notes in Computer Science, Springer, 2005.

Automatic Assume/Guarantee Reasoning for Heap-Manipulating Programs: Ongoing WorkGreta Yorsh, Alexey Skidanov, Thomas W. Reps, Shmuel Sagiv. ENTCS, 131:125-138, 2005. [doi]

2004

Numeric Domains with Summarized DimensionsDenis Gopan, Frank DiMaio, Nurit Dor, Thomas W. Reps, Shmuel Sagiv. TACAS 2004: 512-529 [doi]

Verification via Structure SimulationNeil Immerman, Alexander Moshe Rabinovich, Thomas W. Reps, Shmuel Sagiv, Greta Yorsh. cav 2004: 281-294 [doi]

The Boundary Between Decidability and Undecidability for Transitive-Closure LogicsNeil Immerman, Alexander Moshe Rabinovich, Thomas W. Reps, Shmuel Sagiv, Greta Yorsh. csl 2004: 160-174 [doi]

A Relational Approach to Interprocedural Shape AnalysisBertrand Jeannet, Alexey Loginov, Thomas W. Reps, Shmuel Sagiv. SAS 2004: 246-264 [doi]

TVLA: A system for generating abstract interpretersTal Lev-Ami, Roman Manevich, Shmuel Sagiv. ifip 2004: 367-376

Partially Disjunctive Heap AbstractionRoman Manevich, Shmuel Sagiv, Ganesan Ramalingam, John Field. SAS 2004: 265-279 [doi]

Symbolic Implementation of the Best TransformerThomas W. Reps, Shmuel Sagiv, Greta Yorsh. vmcai 2004: 252-266 [doi]

Static Program Analysis via 3-Valued LogicThomas W. Reps, Shmuel Sagiv, Reinhard Wilhelm. cav 2004: 15-30 [doi]

On the Expressive Power of Canonical AbstractionShmuel Sagiv. vmcai 2004: 58 [doi]

Symbolically Computing Most-Precise Abstract Operations for Shape AnalysisGreta Yorsh, Thomas W. Reps, Shmuel Sagiv. TACAS 2004: 530-545 [doi]

2003

2002

Compactly Representing First-Order Structures for Static AnalysisRoman Manevich, Ganesan Ramalingam, John Field, Deepak Goyal, Shmuel Sagiv. SAS 2002: 196-212 [doi]

Online Subpath ProfilingDavid Oren, Yossi Matias, Shmuel Sagiv. CC 2002: 78-94 [doi]

Deriving Specialized Program Analyses for Certifying Component-Client ConformanceGanesan Ramalingam, Alex Varshavsky, John Field, Deepak Goyal, Shmuel Sagiv. PLDI 2002: 83-94 [doi]

Semantic Minimization of 3-Valued Propositional FormulaeThomas W. Reps, Alexey Loginov, Shmuel Sagiv. lics 2002: 40 [doi]

Parametric shape analysis via 3-valued logicShmuel Sagiv, Thomas W. Reps, Reinhard Wilhelm. TOPLAS, 24(3):217-298, 2002. [doi]

Estimating the impact of heap liveness information on space consumption in JavaRan Shaham, Elliot K. Kolodner, Shmuel Sagiv. iwmm 2002: 171-182 [doi]

Shape Analysis and ApplicationsReinhard Wilhelm, Thomas W. Reps, Shmuel Sagiv. In The Compiler Design Handbook. pages 175-218, 2002.

2001

2000

1999

A Decidable Logic for Describing Linked Data StructuresMichael Benedikt, Thomas W. Reps, Shmuel Sagiv. ESOP 1999: 2-19 [doi]

Finding Circular Attributes in Attribute GrammarsMichael Rodeh, Shmuel Sagiv. JACM, 46(4):556, 1999. [doi]

Parametric Shape Analysis via 3-Valued LogicShmuel Sagiv, Thomas W. Reps, Reinhard Wilhelm. POPL 1999: 105-118 [doi]

1998

1996

Solving Shape-Analysis Problems in Languages with Destructive UpdatingShmuel Sagiv, Thomas W. Reps, Reinhard Wilhelm. POPL 1996: 16-31 [doi]

1995

Demand Interprocedural Dataflow AnalysisSusan Horwitz, Thomas W. Reps, Shmuel Sagiv. ESEC/FSE 1995: 104-115 [doi]

Precise Interprocedural Dataflow Analysis via Graph ReachabilityThomas W. Reps, Susan Horwitz, Shmuel Sagiv. POPL 1995: 49-61

Precise Interprocedural Dataflow Analysis with Applications to Constant PropagationShmuel Sagiv, Thomas W. Reps, Susan Horwitz. tapsoft 1995: 651-665

1994

Speeding up SlicingThomas W. Reps, Susan Horwitz, Shmuel Sagiv, Genevieve Rosay. ESEC/FSE 1994: 11-20 [doi]

1992

Proving Safety of Speculative Load Instructions at Compile TimeDavid Bernstein, Michael Rodeh, Shmuel Sagiv. ESOP 1992: 56-72

The Expressive Power of Side Effects in PrologJohann A. Makowsky, J.-C. Gregoire, Shmuel Sagiv. jlp, 12(1&2):179-188, 1992.

1990

A Logic-Based Approach to Data Flow Analysis ProblemShmuel Sagiv, Nissim Francez, Michael Rodeh, Reinhard Wilhelm. plilp 1990: 277-292

1989

Resolving Circularity in Attribute Grammars with Applications to Data Flow AnalysisShmuel Sagiv, O. Edelstein, Nissim Francez, Michael Rodeh. POPL 1989: 36-48