2026 Mooly Sagiv: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	60	3254	3160	54	51	196	13695

Mooly Sagiv publication distribution in Computer Science in 2026

The chart shows the distribution of publications by all Research.com ranked scientists in the field of Computer Science in 2026. The highlighted bar marks where Mooly Sagiv sits on this spectrum.

32 publications 991+

This scientist: 196 publications — 45th percentile

45% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 991 publications or more.

Mooly Sagiv D-index placement in Computer Science in 2026

The chart shows the D-index (discipline H-index) distribution of Computer Science scientists ranked by Research.com in 2026. The highlighted bar marks where Mooly Sagiv sits on this spectrum.

30 D-Index 131+

This scientist: 60 D-Index — 78th percentile

78% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 131 D-Index or more.

Research.com Recognitions

2015 - ACM Fellow For contributions to the theory and practice of automated analysis and verification of software.

Overview

Mooly Sagiv is affiliated with Tel Aviv University in Israel and has contributed extensively to the field of computer science. Their research spans multiple subfields, with a strong focus on formal methods, security, and distributed systems.

The main field of study is Computer Science, encompassing various specialized domains. Their subfields of study include:

Artificial Intelligence
Computer Networks and Communications
Computational Theory and Mathematics
Information Systems
Signal Processing

The primary topics covered in their work involve:

Formal Methods in Verification
Security and Verification in Computing
Distributed Systems and Fault Tolerance
Logic, Programming, and Type Systems
Blockchain Technology Applications and Security
Advanced Malware Detection Techniques
Machine Learning and Algorithms

Several papers reflect the scope and depth of their research, including:

"Taming callbacks for smart contract modularity," 2020, Proceedings of the ACM on Programming Languages
"Relaxed Effective Callback Freedom: A Parametric Correctness Condition for Sequential Modules With Callbacks," 2022, IEEE Transactions on Dependable and Secure Computing
"Property-directed reachability as abstract interpretation in the monotone theory," 2022, Proceedings of the ACM on Programming Languages
"Blockaid: Data Access Policy Enforcement for Web Applications," 2022, arXiv (Cornell University)
"Practical Verification of Smart Contracts using Memory Splitting," 2024, Proceedings of the ACM on Programming Languages

Frequent collaborators in their research include:

Sharon Shoham
Shelly Grossman
Yotam M. Y. Feldman
James R. Wilcox
Kenneth L. McMillan

Publishing venues where Mooly Sagiv frequently appears include:

arXiv (Cornell University)
Proceedings of the ACM on Programming Languages
IEEE Transactions on Dependable and Secure Computing
Annals of the Rheumatic Diseases
Lecture Notes in Computer Science

Mooly Sagiv was recognized as an ACM Fellow in 2015 for contributions to the theory and practice of automated analysis and verification of software.

Best Publications

Precise interprocedural dataflow analysis via graph reachability

Thomas Reps;Susan Horwitz;Mooly Sagiv

1510
Citations
Parametric shape analysis via 3-valued logic

Mooly Sagiv;Thomas Reps;Reinhard Wilhelm

1422
Citations
Parametric shape analysis via 3-valued logic

Mooly Sagiv;Thomas Reps;Reinhard Wilhelm

1402
Citations
Solving shape-analysis problems in languages with destructive updating

Mooly Sagiv;Thomas Reps;Reinhard Wilhelm

558
Citations
Precise interprocedural dataflow analysis with applications to constant propagation

Mooly Sagiv;Thomas Reps;Susan Horwitz

368
Citations
CSSV: towards a realistic tool for statically detecting all buffer overflows in C

Nurit Dor;Michael Rodeh;Mooly Sagiv

353
Citations
Speeding up slicing

Thomas Reps;Susan Horwitz;Mooly Sagiv;Genevieve Rosay

262
Citations
VeriCon: towards verifying controller programs in software-defined networks

Thomas Ball;Nikolaj Bjørner;Aaron Gember;Shachar Itzhaky

249
Citations
Demand interprocedural dataflow analysis

Susan Horwitz;Thomas Reps;Mooly Sagiv

233
Citations
Verifying Properties of Binarized Deep Neural Networks.

Nina Narodytska;Shiva Prasad Kasiviswanathan;Leonid Ryzhyk;Mooly Sagiv

213
Citations
A framework for numeric analysis of array operations

Denis Gopan;Thomas Reps;Mooly Sagiv

212
Citations
Ivy: safety verification by interactive generalization

Oded Padon;Kenneth L. McMillan;Aurojit Panda;Mooly Sagiv

204
Citations
Online Detection of Effectively Callback Free Objects with Applications to Smart Contracts

Shelly Grossman;Ittai Abraham;Guy Golan-Gueta;Yan Michalevsky

204
Citations
Symbolic Implementation of the Best Transformer

Thomas Reps;Mooly Sagiv;Greta Yorsh

195
Citations
Putting static analysis to work for verification: A case study

Tal Lev-Ami;Thomas Reps;Mooly Sagiv;Reinhard Wilhelm

168
Citations
Local reasoning for storable locks and threads

Alexey Gotsman;Josh Berdine;Byron Cook;Noam Rinetzky

165
Citations
A semantics for procedure local heaps and its abstractions

Noam Rinetzky;Jörg Bauer;Thomas Reps;Mooly Sagiv

153
Citations
Edge profiling versus path profiling: the showdown

Thomas Ball;Peter Mataga;Mooly Sagiv

146
Citations
Comparison under abstraction for verifying linearizability

Daphna Amit;Noam Rinetzky;Thomas Reps;Mooly Sagiv

141
Citations
Predicate abstraction and canonical abstraction for singly-linked lists

Roman Manevich;E. Yahav;G. Ramalingam;Mooly Sagiv

138
Citations

Frequent Co-Authors

Thomas Reps University of Wisconsin–Madison

Eran Yahav Technion – Israel Institute of Technology

Reinhard Wilhelm Saarland University

Neil Immerman University of Massachusetts Amherst

Alex Aiken Stanford University

Aurojit Panda New York University

Scott Shenker University of California, Berkeley

Kenneth L. McMillan Microsoft (United States)

Martin Rinard MIT

Elliot K. Kolodner IBM (United States)

External Links

Wikipedia of Mooly Sagiv Personal website of Mooly Sagiv Google Scholar page

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

A Computer Science education unlocks diverse career possibilities beyond traditional programming roles. For students seeking closely related or interdisciplinary fields, numerous flexible online degree options are now available at affordable rates.

Those looking to explore the ever-growing tech security sector may benefit from a cyber security degree, which prepares graduates for roles in defending digital infrastructure. Similarly, leadership and technology skills intersect in construction management. An online construction management masters can lead to lucrative project management opportunities as technology transforms the building industry.

For those interested in law, technology, and societal safety, a criminal justice degree online cost comparison helps future professionals evaluate paths in cybersecurity, forensics, and law enforcement. Meanwhile, aspiring tech-driven accountants can boost career prospects by enrolling in comprehensive accounting classes online to develop advanced analytics and auditing skills.

These alternatives allow students to tailor their skills to rapidly evolving industries, expand career options, and pursue affordable, high-quality education online.