2013 - Member of Academia Europaea
2005 - ACM Fellow For contributions to automated program analysis and synthesis.
2000 - Fellow of John Simon Guggenheim Memorial Foundation
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.
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.
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.
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.
Interprocedural slicing using dependence graphs
Susan Horwitz;Thomas Reps;David Binkley.
programming language design and implementation (1988)
Interprocedural slicing using dependence graphs
Susan Horwitz;Thomas Reps;David Binkley.
ACM Transactions on Programming Languages and Systems (1990)
Parametric shape analysis via 3-valued logic
Mooly Sagiv;Thomas Reps;Reinhard Wilhelm.
ACM Transactions on Programming Languages and Systems (2002)
Parametric shape analysis via 3-valued logic
Mooly Sagiv;Thomas Reps;Reinhard Wilhelm.
symposium on principles of programming languages (1999)
Precise interprocedural dataflow analysis via graph reachability
Thomas Reps;Susan Horwitz;Mooly Sagiv.
symposium on principles of programming languages (1995)
The Cornell program synthesizer: a syntax-directed programming environment
Tim Teitelbaum;Thomas Reps.
Communications of The ACM (1981)
Integrating noninterfering versions of programs
Susan Horwitz;Jan Prins;Thomas Reps.
ACM Transactions on Programming Languages and Systems (1989)
Integrating non-intering versions of programs
S. Horwitz;J. Prins;T. Reps.
symposium on principles of programming languages (1988)
Solving shape-analysis problems in languages with destructive updating
Mooly Sagiv;Thomas Reps;Reinhard Wilhelm.
ACM Transactions on Programming Languages and Systems (1998)
Analyzing Memory Accesses in x86 Executables
Gogul Balakrishnan;Thomas W. Reps.
compiler construction (2006)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
Tel Aviv University
University of Wisconsin–Madison
University of Wisconsin–Madison
Saarland University
Technion – Israel Institute of Technology
Loyola University Maryland
Carnegie Mellon University
University of North Carolina at Chapel Hill
University of Massachusetts Amherst
University of California, Berkeley
Grenoble Alpes University
University of Michigan–Ann Arbor
University of Chicago
New York University
University of Córdoba
Imperial College London
Memorial Sloan Kettering Cancer Center
Oita University
University of Massachusetts Amherst
Chinese University of Hong Kong
University of Konstanz
University of Washington
Macquarie University
University of California, Los Angeles
University of California, Los Angeles
University of Pennsylvania