D-Index & Metrics Best Publications

D-Index & Metrics

Discipline name D-index D-index (Discipline H-index) only includes papers and citation values for an examined discipline in contrast to General H-index which accounts for publications across all disciplines. Citations Publications World Ranking National Ranking
Computer Science D-index 53 Citations 12,185 143 World Ranking 2482 National Ranking 42

Research.com Recognitions

Awards & Achievements

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

Overview

What is he best known for?

The fields of study he is best known for:

  • Programming language
  • Operating system
  • Algorithm

His primary scientific interests are in Theoretical computer science, Programming language, Static analysis, Algorithm and Shape analysis. Mooly Sagiv has included themes like Correctness, Open problem, World Wide Web, Intersection and Typestate analysis in his Theoretical computer science study. His research investigates the connection between Programming language and topics such as Counterexample that intersect with problems in Negation and Formal verification.

His Static analysis research is multidisciplinary, incorporating perspectives in Program analysis, Abstract interpretation, Software, String and Error detection and correction. Mooly Sagiv combines subjects such as Single assignment, Data structure and Fortran with his study of Algorithm. His research integrates issues of Semantics, Alias analysis and Pointer analysis in his study of Shape analysis.

His most cited work include:

  • Precise interprocedural dataflow analysis via graph reachability (908 citations)
  • Parametric shape analysis via 3-valued logic (735 citations)
  • Solving shape-analysis problems in languages with destructive updating (300 citations)

What are the main themes of his work throughout his whole career to date?

Theoretical computer science, Programming language, Abstract interpretation, Algorithm and Static analysis are his primary areas of study. His Theoretical computer science research is multidisciplinary, relying on both Correctness and Data structure. His Correctness research includes elements of Scalability and Distributed computing.

His biological study spans a wide range of topics, including Model checking, Predicate abstraction and Shape analysis. His work carried out in the field of Algorithm brings together such families of science as Process and Solver. His research in Reachability intersects with topics in Set, Loop invariant and Linked list.

He most often published in these fields:

  • Theoretical computer science (37.38%)
  • Programming language (33.18%)
  • Abstract interpretation (18.22%)

What were the highlights of his more recent work (between 2014-2021)?

  • Theoretical computer science (37.38%)
  • Programming language (33.18%)
  • Distributed computing (11.68%)

In recent papers he was focusing on the following fields of study:

His primary areas of study are Theoretical computer science, Programming language, Distributed computing, Invariant and Scalability. He works mostly in the field of Theoretical computer science, limiting it down to topics relating to Soundness and, in certain cases, First-order logic and Liveness. His Programming language study frequently intersects with other fields, such as Decidability.

His Distributed computing study also includes

  • Correctness, which have a strong connection to Datapath, Invariant, Reachability, Software and Solidity,
  • Control which is related to area like Persistent data structure, Cloud computing and Overhead. His Scalability study incorporates themes from Abstract interpretation, Mathematical proof, Packet processing and Top-down and bottom-up design. His studies deal with areas such as Computer network and Static analysis as well as Abstract interpretation.

Between 2014 and 2021, his most popular works were:

  • Ivy: safety verification by interactive generalization (78 citations)
  • Verifying Properties of Binarized Deep Neural Networks. (64 citations)
  • Online detection of effectively callback free objects with applications to smart contracts (54 citations)

In his most recent research, the most cited papers focused on:

  • Programming language
  • Operating system
  • Algorithm

His scientific interests lie mostly in Programming language, Decidability, Distributed computing, Theoretical computer science and Modularity. His research on Programming language frequently links to adjacent areas such as Null. The Decidability study combines topics in areas such as Paxos and Invariant.

The concepts of his Invariant study are interwoven with issues in Abstract interpretation, Algorithm, Propositional calculus and Inference. His Distributed computing study combines topics from a wide range of disciplines, such as Scalability, Network packet, Correctness, Verification problem and Software. His studies link Equivalence with Theoretical computer science.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Best Publications

Parametric shape analysis via 3-valued logic

Mooly Sagiv;Thomas Reps;Reinhard Wilhelm.
ACM Transactions on Programming Languages and Systems (2002)

1348 Citations

Precise interprocedural dataflow analysis via graph reachability

Thomas Reps;Susan Horwitz;Mooly Sagiv.
symposium on principles of programming languages (1995)

1235 Citations

Solving shape-analysis problems in languages with destructive updating

Mooly Sagiv;Thomas Reps;Reinhard Wilhelm.
ACM Transactions on Programming Languages and Systems (1998)

528 Citations

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

Nurit Dor;Michael Rodeh;Mooly Sagiv.
programming language design and implementation (2003)

344 Citations

Precise interprocedural dataflow analysis with applications to constant propagation

Mooly Sagiv;Thomas Reps;Susan Horwitz.
Theoretical Computer Science (1996)

295 Citations

Speeding up slicing

Thomas Reps;Susan Horwitz;Mooly Sagiv;Genevieve Rosay.
foundations of software engineering (1994)

248 Citations

VeriCon: towards verifying controller programs in software-defined networks

Thomas Ball;Nikolaj Bjørner;Aaron Gember;Shachar Itzhaky.
programming language design and implementation (2014)

217 Citations

Demand interprocedural dataflow analysis

Susan Horwitz;Thomas Reps;Mooly Sagiv.
foundations of software engineering (1995)

205 Citations

A framework for numeric analysis of array operations

Denis Gopan;Thomas Reps;Mooly Sagiv.
symposium on principles of programming languages (2005)

200 Citations

Symbolic Implementation of the Best Transformer

Thomas Reps;Mooly Sagiv;Greta Yorsh.
verification model checking and abstract interpretation (2004)

167 Citations

Best Scientists Citing Mooly Sagiv

Thomas Reps

Thomas Reps

University of Wisconsin–Madison

Publications: 81

Martin Rinard

Martin Rinard

MIT

Publications: 63

Viktor Kuncak

Viktor Kuncak

École Polytechnique Fédérale de Lausanne

Publications: 51

Daniel Kroening

Daniel Kroening

Amazon (United States)

Publications: 41

Hongseok Yang

Hongseok Yang

Korea Advanced Institute of Science and Technology

Publications: 38

Sumit Gulwani

Sumit Gulwani

Microsoft (United States)

Publications: 37

Rupak Majumdar

Rupak Majumdar

Max Planck Institute for Software Systems

Publications: 36

Andreas Podelski

Andreas Podelski

University of Freiburg

Publications: 36

Eran Yahav

Eran Yahav

Technion – Israel Institute of Technology

Publications: 33

Rajeev Alur

Rajeev Alur

University of Pennsylvania

Publications: 31

P. Madhusudan

P. Madhusudan

University of Illinois at Urbana-Champaign

Publications: 31

Byron Cook

Byron Cook

Amazon (United States)

Publications: 30

Andrey Rybalchenko

Andrey Rybalchenko

Microsoft (United States)

Publications: 30

Sriram K. Rajamani

Sriram K. Rajamani

Microsoft (United States)

Publications: 29

Alex Aiken

Alex Aiken

Stanford University

Publications: 28

Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking d-index is inferred from publications deemed to belong to the considered discipline.

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

Contact us
Something went wrong. Please try again later.