H-Index & Metrics Top Publications

H-Index & Metrics

Discipline name H-index Citations Publications World Ranking National Ranking
Computer Science H-index 78 Citations 29,246 247 World Ranking 505 National Ranking 304

Research.com Recognitions

Awards & Achievements

2013 - Member of Academia Europaea

2005 - ACM Fellow For contributions to automated program analysis and synthesis.

2000 - Fellow of John Simon Guggenheim Memorial Foundation

Overview

What is he best known for?

The fields of study he is best known for:

  • Programming language
  • Algorithm
  • Operating system

His main research concerns Theoretical computer science, Programming language, Algorithm, Program slicing and Debugging. His Theoretical computer science research is mostly focused on the topic Abstract interpretation. His work carried out in the field of Algorithm brings together such families of science as Value, Data flow diagram and Regular language.

The study incorporates disciplines such as Context and Reachability in addition to Program slicing. Thomas Reps works mostly in the field of Reachability, limiting it down to topics relating to Finite set and, in certain cases, Set and Dataflow. His work in Debugging addresses issues such as Executable, which are connected to fields such as High-level programming language and x86.

His most cited work include:

  • Interprocedural slicing using dependence graphs (1356 citations)
  • Precise interprocedural dataflow analysis via graph reachability (908 citations)
  • Parametric shape analysis via 3-valued logic (735 citations)

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

Thomas Reps mostly deals with Programming language, Theoretical computer science, Algorithm, Abstract interpretation and Program analysis. Semantics, Static analysis, Source code, Compiler and Machine code are subfields of Programming language in which his conducts study. His Source code research integrates issues from Executable and Code.

His Theoretical computer science study combines topics from a wide range of disciplines, such as Correctness, Set and Program slicing. His research in Program slicing is mostly concerned with Program Dependence Graph. His study on Abstract interpretation is mostly dedicated to connecting different topics, such as Shape analysis.

He most often published in these fields:

  • Programming language (38.81%)
  • Theoretical computer science (34.23%)
  • Algorithm (15.90%)

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

  • Programming language (38.81%)
  • Static analysis (9.97%)
  • Theoretical computer science (34.23%)

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

His scientific interests lie mostly in Programming language, Static analysis, Theoretical computer science, Probabilistic logic and Recursion. His work deals with themes such as Space and Usability, which intersect with Programming language. His Static analysis research incorporates elements of Abstraction, Algorithm, Metadata and Representation.

His Theoretical computer science research incorporates themes from Adversary and Robustness. His study in Probabilistic logic is interdisciplinary in nature, drawing from both Algebraic number, Protocol, Dataflow, Control flow and Coroutine. His Recursion research includes themes of Semantics, Program analysis, Exponential function and Benchmark.

Between 2017 and 2021, his most popular works were:

  • Code vectors: understanding programs through embedded abstracted symbolic traces (31 citations)
  • Non-Linear Reasoning For Invariant Synthesis (30 citations)
  • PMAF: an algebraic framework for static analysis of probabilistic programs (21 citations)

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

  • Programming language
  • Algorithm
  • Operating system

Thomas Reps mainly focuses on Programming language, Code, Benchmark, Representation and Algebraic number. His primary area of study in Programming language is in the field of Assertion. His Code study integrates concerns from other disciplines, such as Symbolic execution, Embedding, Word, Linux kernel and Robustness.

The concepts of his Benchmark study are interwoven with issues in Program analysis, Graph, Correctness, Dataflow and Recursion. His Representation research is multidisciplinary, incorporating elements of Rational number, Simple, Automated reasoning and Class. As a part of the same scientific family, he mostly works in the field of Algebraic number, focusing on Regular expression and, on occasion, Static analysis.

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.

Top Publications

Interprocedural slicing using dependence graphs

Susan Horwitz;Thomas Reps;David Binkley.
programming language design and implementation (1988)

2476 Citations

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

The Cornell program synthesizer: a syntax-directed programming environment

Tim Teitelbaum;Thomas Reps.
Communications of The ACM (1981)

952 Citations

Integrating noninterfering versions of programs

Susan Horwitz;Jan Prins;Thomas Reps.
ACM Transactions on Programming Languages and Systems (1989)

596 Citations

Integrating non-intering versions of programs

S. Horwitz;J. Prins;T. Reps.
symposium on principles of programming languages (1988)

567 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

The Synthesizer Generator: A System for Constructing Language-Based Editors

Thomas W. Reps;Tim Teitelbaum.
(1988)

491 Citations

Analyzing Memory Accesses in x86 Executables

Gogul Balakrishnan;Thomas W. Reps.
compiler construction (2004)

471 Citations

The synthesizer generator

Thomas Reps;Tim Teitelbaum.
software engineering symposium on practical software development environments (1984)

463 Citations

Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking h-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

Top Scientists Citing Thomas Reps

Mark Harman

Mark Harman

University College London

Publications: 88

Mooly Sagiv

Mooly Sagiv

Tel Aviv University

Publications: 66

Martin Rinard

Martin Rinard

MIT

Publications: 65

David Binkley

David Binkley

Loyola University Maryland

Publications: 61

Barbara G. Ryder

Barbara G. Ryder

Virginia Tech

Publications: 56

Viktor Kuncak

Viktor Kuncak

École Polytechnique Fédérale de Lausanne

Publications: 55

Eran Yahav

Eran Yahav

Technion – Israel Institute of Technology

Publications: 54

P. Madhusudan

P. Madhusudan

University of Illinois at Urbana-Champaign

Publications: 44

Daniel Kroening

Daniel Kroening

Amazon (United States)

Publications: 44

Alex Aiken

Alex Aiken

Stanford University

Publications: 40

Ahmed Bouajjani

Ahmed Bouajjani

Université Paris Cité

Publications: 36

Andreas Podelski

Andreas Podelski

University of Freiburg

Publications: 34

Shaz Qadeer

Shaz Qadeer

Facebook (United States)

Publications: 34

Gail E. Kaiser

Gail E. Kaiser

Columbia University

Publications: 34

Krishnendu Chatterjee

Krishnendu Chatterjee

Institute of Science and Technology Austria

Publications: 33

Something went wrong. Please try again later.