Shmuel Sagiv's AcademicInfluence.com Rankings Shmuel Sagiv's Degrees Similar Degrees You Can Earn Why Is Shmuel Sagiv Influential? (Suggest an Edit or Addition)
According to Wikipedia , Mooly Sagiv is an Israeli computer scientist known for his work on static program analysis. He is currently Chair of Software Systems in the School of Computer Science at Tel Aviv University, and CEO of Certora, a startup company providing formal verification of smart contracts.
(See a Problem?) Shmuel Sagiv's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
2000 2010 2020 0 25 50 75 100 125 150 175 200 225 250 275 300 325 Published Works A framework for numeric analysis of array operations (2005) A semantics for procedure local heaps and its abstractions (2005) Modularity for decidability of deductive verification with applications to distributed systems (2018) Program Analysis and Compilation, Theory and Practice, Essays Dedicated to Reinhard Wilhelm on the Occasion of His 60th Birthday (2007) On effectiveness of GC in Java (2000) Abstractions from tests (2012) A dynamic evaluation of the precision of static heap abstractions (2010) Concurrent libraries with foresight (2013) Detecting memory errors via static pointer analysis (1998) (17)Interprocedural Dataflow Analysis via Graph Reachability (2008) (16)LTL Model Checking for Systems with Unbounded Number of Dynamically Created Threads and Objects (2001) (14)A decidable logic for linked data structures (1999) (13)Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (2011) Abstraction Refinement for 3-Valued-Logic Analysis (2004) (10)Interprocedural Functional Shape Analysis using Local Heaps (2004) (10)Deriving specialized heap analyses for verifying component-client conformance (2001) (7)Automatic Fine-Grain Locking using Shape Properties Guy Golan-Gueta (2011) (7)Precise Interprocedural Dataaow Analysis with Applications to Constant Propagation 1 (1995) (6)Automatic verification of a simple mark and sweep garbabge collector (2001) (5)WIP: Finding Bugs Automatically in Smart Contracts with Parameterized Invariants (2020) (5)Finite differencing of logical formulas with applications to program analysis (2003) (5)Revamping TVLA : Making Parametric Shape Analysis Competitive ( Tool Paper ) (2007) (5)Learning Abstractions for Verifying Data-Structure Properties (2004) (4)Intersecting Heap Abstractions with Applications to Compile-time Memory Management (2005) (3)Numeric Analysis of Array Operations (3)Efficient Memory Management for Long-Lived Objects (2009) (2)Decidable logics for expressing heap connectivity (2003) (2)Automatic Scalable Atomicity via Semantic Locking (2017) Proceedings of the 6th international symposium on Memory management (2007) (2)Property-directed reachability as abstract interpretation in the monotone theory (2021) Making Parametric Shape Analysis Competitive (Tool Paper) (2007) (1)Self-stabilization Preserving Compiler (Extended Abstract) (2005) (1)Automatic Verification of Temporal Properties of Concurrent Heap-Manipulating Programs using Evolution Logic (2002) (1)Eventually Consistent Transactions (full version) (2011) (1)POPL’11 Program Chair Report (2011) (1)Programming Languages and Systems (1998) On the Utility of Canonical Abstraction (2005) Modular Lattices for Compositional Interprocedural Analysis (2012) (1)Abstract Bounded Quantifier Instantiation for Checking Inductive Invariants (2017) (1)A Combination Framework for Tracking Partition Sizes (Full Version) (2009) (0)Program Analysis (Dagstuhl Seminar 99151) (2021) Dagstuhl Seminar on Program Analysis (2008) (0)Relaxed Effective Callback Freedom: A Parametric Correctness Condition for Sequential Modules with Callbacks (2022) Proceedings of the 14th European conference on Programming Languages and Systems (2005) (0)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 (2005) Modular Shape Analysis for View-Serializable Libraries (2008) (0)Some complexity results for stateful network verification (2019) Proceedings of the 6th International Symposium on Memory Management, ISMM 2007, Montreal, Quebec, Canada, October 21-22, 2007 (2007) Counterexample-based Refinement for Powerset Domains (2007) (0)Efficiently Inferring Thread Correlations Technical Report TR-09-59203 (2009) (0)Synthesis of circular compositional program proofs via abduction (2015) Session details: Medley (2010) Programming Languages and Systems (vol. # 3444) : 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) (0)Table of Contents (2004) Counterexample-based Refinement for Relational Domains (2006) (0)Programs with Recursively Defined Data Structures Using Pointers (1998) (0)Concurrent data representation synthesis Citation (2012) (0)Lightweight Analysis of Acyclic Unshared Lists (2006) (0)Componentized heap abstraction (2016) (0)Session details: Race detection (2006) Programs with Recursively Defined Data Structures (Dagstuhl Seminar 98161) (2021) Combining Quantified Domains ( Full Version ) (2009) (0)Abstractions for Verifying Isolation Properties in Stateful Networks (2017) (0)Verifying Equivalence of Spark Programs Technical Report 1-Nov-2016 (2016) (0)Session details: Invited talk (2011) Garbage collection with live memory list and leakage detection (2000) (0)More Papers This paper list is powered by the following services:
Other Resources About Shmuel Sagiv What Schools Are Affiliated With Shmuel Sagiv? Shmuel Sagiv is affiliated with the following schools:
