Thomas W. Reps | Academic Influence

Thomas W. Reps's AcademicInfluence.com Rankings

Thomas W. Reps

Computer Science

#1710

World Rank

#1771

Historical Rank

#817

USA Rank

Software Engineering

#75

World Rank

#75

Historical Rank

#38

USA Rank

Algorithms

#90

World Rank

#90

Historical Rank

#23

USA Rank

Database

#1157

World Rank

#1215

Historical Rank

#321

USA Rank

computer-science Degrees

Download Badge

Computer Science

Thomas W. Reps's Degrees

PhD Computer Science Stanford University
Masters Computer Science Stanford University

Similar Degrees You Can Earn

Why Is Thomas W. Reps Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Thomas W. Reps is an American computer scientist known for his contributions to automatic program analysis. Dr. Reps is Professor of Computer Science in the Computer Sciences Department of the University of Wisconsin–Madison, which he joined in 1985. Reps is the author or co-author of four books and more than one hundred seventy-five papers describing his research. His work has covered a wide variety of topics, including program slicing, data-flow analysis, pointer analysis, model checking, computer security, instrumentation , language-based program-development environments, the use of program profiling in software testing, software renovation, incremental algorithms, and attribute grammars.

(See a Problem?)

Thomas W. Reps'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

Published Works

Interprocedural slicing using dependence graphs (1990) (1579)
Precise interprocedural dataflow analysis via graph reachability (1995) (1113)
Parametric shape analysis via 3-valued logic (1999) (1070)
The Cornell program synthesizer: a syntax-directed programming environment (1981) (673)
The synthesizer generator (1984) (468)
Interprocedural slicing using dependence graphs (1988) (437)
An Incremental Algorithm for a Generalization of the Shortest-Path Problem (1996) (426)
Integrating noninterfering versions of programs (1989) (419)
Analyzing Memory Accesses in x86 Executables (2004) (409)
Solving shape-analysis problems in languages with destructive updating (1996) (393)
Program analysis via graph reachability (1997) (370)
The Synthesizer Generator: A System for Constructing Language-Based Editors (1988) (357)
WYSINWYX: What you see is not what you eXecute (2005) (355)
The use of program dependence graphs in software engineering (1992) (308)
The use of program profiling for software maintenance with applications to the year 2000 problem (1997) (308)
Precise Interprocedural Dataflow Analysis with Applications to Constant Propagation (1995) (303)
Identifying modules via concept analysis (1997) (292)
Generating Language-Based Environments (1982) (284)
Incremental Context-Dependent Analysis for Language-Based Editors (1983) (283)
Weighted pushdown systems and their application to interprocedural dataflow analysis (2003) (274)
Dependence analysis for pointer variables (1989) (269)
On the Computational Complexity of Dynamic Graph Problems (1996) (268)
Analysis of recursive state machines (2001) (265)
Parametric shape analysis via 3-valued logic (2002) (249)
Shape Analysis (2000) (231)
Speeding up slicing (1994) (225)
Integrating non-intering versions of programs (1988) (191)
Reducing Concurrent Analysis Under a Context Bound to Sequential Analysis (2008) (190)
Incremental evaluation for attribute grammars with application to syntax-directed editors (1981) (179)
Demand interprocedural dataflow analysis (1995) (178)
A framework for numeric analysis of array operations (2005) (177)
A categorized bibliography on incremental computation (1993) (172)
Symbolic Implementation of the Best Transformer (2004) (159)
CodeSurfer/x86-A Platform for Analyzing x86 Executables (2005) (156)
On the adequacy of program dependence graphs for representing programs (1988) (156)
Precise interprocedural chopping (1995) (142)
ConSeq: detecting concurrency bugs through sequential errors (2011) (141)
A semantics for procedure local heaps and its abstractions (2005) (134)
Program integration for languages with procedure calls (1995) (133)
Putting static analysis to work for verification: A case study (2000) (131)
Comparison Under Abstraction for Verifying Linearizability (2007) (123)
Recency-Abstraction for Heap-Allocated Storage (2006) (119)
Optimal-time incremental semantic analysis for syntax-directed editors (1982) (118)
Program Specialization via Program Slicing (1996) (116)
Solving shape-analysis problems in languages with destructive updating (1998) (115)
Undecidability of context-sensitive data-dependence analysis (2000) (114)
Demand Interprocedural Program Analysis Using Logic Databases (1993) (111)
Component-based synthesis for complex APIs (2017) (111)
DIVINE: DIscovering Variables IN Executables (2007) (108)
Pointer analysis for programs with structures and casting (1999) (108)
The Synthesizer Generator Reference Manual (1988) (107)
Symbolically Computing Most-Precise Abstract Operations for Shape Analysis (2004) (102)
Interprocedural Analysis of Concurrent Programs Under a Context Bound (2008) (98)
The Boundary Between Decidability and Undecidability for Transitive-Closure Logics (2004) (96)
Program Slicing of Hardware Description Languages (1999) (94)
A program integration algorithm that accommodates semantics-preserving transformations (1992) (93)
Numeric Domains with Summarized Dimensions (2004) (93)
Interconvertibility of a class of set constraints and context-free-language reachability (2000) (92)
Lookahead Widening (2006) (91)
Design and Implementation of a Fine-Grained Software Inspection Tool (2003) (89)
Simulating Reachability Using First-Order Logic with Applications to Verification of Linked Data Structures (2005) (87)
Solving Demand Versions of Interprocedural Analysis Problems (1994) (86)
The Semantics of Program Slicing (1988) (82)
Verifying Concurrent Message-Passing C Programs with Recursive Calls (2006) (82)
Improved Memory-Access Analysis for x86 Executables (2008) (82)
Guided Static Analysis (2007) (80)
Debugging via run-time type checking (2001) (80)
Reducing concurrent analysis under a context bound to sequential analysis (2009) (77)
Safety checking of machine code (2000) (76)
Remote attribute updating for language-based editors (1986) (74)
Extended Weighted Pushdown Systems (2005) (74)
A Decidable Logic for Describing Linked Data Structures (1999) (73)
Verifying Temporal Heap Properties Specified via Evolution Logic (2003) (73)
Physical type checking for C (1999) (73)
Directed Proof Generation for Machine Code (2010) (71)
Code vectors: understanding programs through embedded abstracted symbolic traces (2018) (71)
The Semantics of Program Slicing and Program Integration (1989) (70)
Model Checking of Unrestricted Hierarchical State Machines (2001) (70)
Interprocedural slicing using dependence graphs (1988) (69)
Interprocedural Path Profiling (1999) (69)
Non-linear reasoning for invariant synthesis (2017) (67)
Static Program Analysis via 3-Valued Logic (2002) (67)
Tool Support for Fine-Grained Software Inspection (2003) (65)
Intermediate-representation recovery from low-level code (2006) (64)
Shape analysis as a generalized path problem (1995) (64)
Revamping TVLA: Making Parametric Shape Analysis Competitive (2007) (63)
Coping with type casts in C (1999) (63)
Extracting Output Formats from Executables (2006) (61)
A relational approach to interprocedural shape analysis (2004) (59)
Abstraction Refinement via Inductive Learning (2005) (58)
A Method for Symbolic Computation of Abstract Operations (2012) (57)
The why and wherefore of the Cornell Program Synthesizer (1981) (55)
Model Checking x86 Executables with CodeSurfer/x86 and WPDS++ (2005) (54)
Algebraic Properties of Program Integration (1990) (54)
Detecting Program Components With Equivalent Behaviors (1989) (54)
Automated Verification of the Deutsch-Schorr-Waite Tree-Traversal Algorithm (2006) (53)
Compositional recurrence analysis revisited (2017) (52)
Parametric Shape Analysis via 3 - valued Logic TOPLAS (2002) (49)
Low-Level Library Analysis and Summarization (2007) (49)
An incremental algorithm for maintaining the dominator tree of a reducible flowgraph (1994) (47)
On generalized authorization problems (2003) (47)
Language Processing in Program Editors (1987) (46)
A System for Generating Static Analyzers for Machine Instructions (2008) (45)
Finding concurrency-related bugs using random isolation (2008) (44)
Semantic Robustness of Models of Source Code (2020) (44)
Improving Pushdown System Model Checking (2006) (43)
Program Analysis Using Weighted Pushdown Systems (2007) (43)
Program Analysis and Compilation, Theory and Practice, Essays Dedicated to Reinhard Wilhelm on the Occasion of His 60th Birthday (2007) (43)
A Next-Generation Platform for Analyzing Executables (2005) (43)
Analysis of SPKI/SDSI certificates using model checking (2002) (43)
The care and feeding of wild-caught mutants (2017) (42)
The synthesizer generator reference manual (3. ed.) (1989) (42)
Statically Inferring Complex Heap, Array, and Numeric Invariants (2010) (41)
Illustrating interference in interfering versions of programs (1989) (40)
TSL: A System for Generating Abstract Interpreters and its Application to Machine-Code Analysis (2013) (40)
Logical characterizations of heap abstractions (2003) (40)
WPDS++: A C++ library for weighted pushdown systems (2005) (39)
Interconveritibility of Set Constraints and Context-Free Language Reachability (1997) (38)
Automated Resource Analysis with Coq Proof Objects (2017) (38)
Property-Directed Shape Analysis (2014) (38)
Analyzing Stripped Device-Driver Executables (2008) (37)
Model checking SPKI/SDSI (2004) (37)
Verification via Structure Simulation (2004) (36)
On the sequential nature of interprocedural program-analysis problems (1996) (36)
Bilateral Algorithms for Symbolic Abstraction (2012) (35)
Automatic discovery of API-level exploits (2005) (35)
Program slicing for VHDL (2002) (35)
Abstract Domains of Affine Relations (2011) (34)
Finite differencing of logical formulas for static analysis (2003) (33)
PMAF: an algebraic framework for static analysis of probabilistic programs (2018) (33)
DIFC programs by automatic instrumentation (2010) (32)
Typestate Checking of Machine Code (2001) (31)
Symbolic analysis via semantic reinterpretation (2009) (31)
Program generalization for software reuse: from C to C++ (1996) (30)
Synthesis of machine code from semantics (2015) (29)
Neural Attribute Machines for Program Generation (2017) (29)
There's Plenty of Room at the Bottom: Analyzing and Verifying Machine Code (2010) (29)
Interactive proof checking (1984) (29)
A Generalization of Stålmarck's Method (2012) (28)
Analyzing Memory Accesses in x86 Binary Executables (2003) (26)
Learning from, Understanding, and Supporting DevOps Artifacts for Docker (2020) (26)
PostHat and All That: Automating Abstract Interpretation (2015) (26)
Shape Analysis and Applications (2007) (26)
Support for Integrating Program Variants in an Environment for Programming in the Large (1988) (26)
On Competitive On-Line Algorithms for the Dynamic Priority-Ordering Problem (1994) (26)
Closed forms for numerical loops (2019) (25)
A new algorithm for semantics-based program integration (1990) (25)
Abstract Error Projection (2007) (24)
Efficient Runtime Policy Enforcement Using Counterexample-Guided Abstraction Refinement (2012) (22)
Interprocedural slicing using dependence graphs (with retrospective) (1988) (22)
Interconvertbility of set constraints and context-free language reachability (1997) (21)
Fast graph simplification for interleaved Dyck-reachability (2020) (21)
Semantic minimization of 3-valued propositional formulae (2002) (21)
A Relational Abstraction for Functions (2005) (21)
Recovery of Variables and Heap Structure in x86 Executables (2005) (19)
OpenNWA: A Nested-Word Automaton Library (2012) (19)
A syntax-directed programming environment (1981) (18)
“Maximal-munch” tokenization in linear time (1998) (18)
An improved algorithm for slicing machine code (2016) (18)
Secure Programming via Visibly Pushdown Safety Games (2012) (18)
Verifying Information Flow Control over Unbounded Processes (2009) (17)
Declarative, Temporal, and Practical Programming with Capabilities (2013) (17)
Recovery of Class Hierarchies and Composition Relationships from Machine Code (2014) (17)
Satisfiability modulo abstraction for separation logic with linked lists (2014) (17)
Interprocedural Dataflow Analysis via Graph Reachability (2008) (16)
Checking conformance of a producer and a consumer (2011) (16)
Labelled Clauses (2007) (16)
Proving Unrealizability for Syntax-Guided Synthesis (2019) (15)
Exact and approximate methods for proving unrealizability of syntax-guided synthesis problems (2020) (15)
Semantic foundations of binding-time analysis for imperative programs (1995) (15)
ConMem: Detecting Crash-Triggering Concurrency Bugs through an Effect-Oriented Approach (2013) (15)
Automatic Assume/Guarantee Reasoning for Heap-Manipulating Programs: Ongoing Work (2005) (15)
Efficient comparison of program slices (1991) (15)
Partial evaluation using dependence graphs (1998) (15)
Interprocedural path profiling and the interprocedural express-lane transformation (2002) (15)
LTL Model Checking for Systems with Unbounded Number of Dynamically Created Threads and Objects (2001) (14)
Automating Abstract Interpretation (2016) (14)
Cps - the cornell program synthesizer (1981) (14)
A Theory of Program Modifications (1991) (14)
Numeric program analysis techniques with applications to array analysis and library summarization (2007) (14)
Techniques for software renovation (1998) (13)
Weighted Pushdown Systems and Trust-Management Systems (2006) (13)
Newtonian Program Analysis via Tensor Product (2017) (13)
Refinement of path expressions for static analysis (2019) (13)
Scan grammars: parallel attribute evaluation via data-parallelism (1993) (13)
A program integration algorithm that accommodates semantics-preserving transformations (1990) (13)
The Multi-Procedure Equivalence Theorem (1989) (13)
Interprocedural Shape Analysis for Effectively Cutpoint-Free Programs (2013) (13)
A decidable logic for linked data structures (1999) (13)
An Algorithm Inspired by Constraint Solvers to Infer Inductive Invariants in Numeric Programs (2016) (12)
A decision procedure for detecting atomicity violations for communicating processes with locks (2009) (12)
Neural Program Generation Modulo Static Analysis (2021) (12)
Specialization Slicing (2014) (12)
Semantics-guided synthesis (2020) (12)
Partial evaluation of machine code (2015) (12)
Language Strength Reduction (2008) (12)
On the complexity of bidirected interleaved Dyck-reachability (2021) (11)
Correctness of an Algorithm for Reconstituting a Program From a Dependence Graph (1990) (11)
On the Computational Complexity of Incremental Algorithms (2016) (11)
Source Forager: A Search Engine for Similar Source Code (2017) (11)
Abstraction Refinement for 3-Valued-Logic Analysis (2004) (10)
Templates and recurrences: better together (2020) (10)
Demonstration of a Prototype Tool for Program Integration (1989) (10)
Semantics-Based Program Integration (1988) (10)
Computational Divided Differencing and Divided-Difference Arithmetics (2003) (10)
Program Slicing for Design Automation: An Automatic Technique for Speeding-up Hardware Design, Simul (1998) (9)
The Use of Program Profiling for Software Testing (1997) (9)
Solving Multiple Dataflow Queries Using WPDSs (2008) (9)
TOFU: Target-Orienter FUzzer (2020) (9)
Analysis of Executables: Benefits and Challenges (Dagstuhl Seminar 12051) (2012) (9)
A Denotational Semantics for Low-Level Probabilistic Programs with Nondeterminism (2019) (9)
Newtonian program analysis via tensor product (2016) (8)
A Dataset of Dockerfiles (2020) (8)
BTA Termination Using CFL-Reachability (1996) (8)
Incremental evaluation for attribute grammars with unrestricted movement between tree modifications (1988) (8)
Static Detection of Atomic-Set-Serializability Violations ? (2007) (8)
Refinement-based program verification via three-valued-logic analysis (2006) (8)
Reducing the Dependence of SPKI/SDSI on PKI (2006) (7)
Speeding up machine-code synthesis (2016) (7)
Analysis Techniques for Information Security (2010) (7)
PostHat and All That : Attaining Most-Precise Inductive Invariants ⋆ (2013) (7)
Wisconsin Program-Slicing Tool (1997) (7)
Modification Algebras (1991) (7)
Index of Definitions (2004) (7)
Refinement-Based Verification for Possibly-Cyclic Lists (2006) (7)
Static Analysis of Software Executables (2009) (7)
Efficient runtime-enforcement techniques for policy weaving (2014) (7)
View-Augmented Abstractions (2010) (7)
Program comprehension and software reengineering (1998) (6)
The Wisconsin program-integration system reference manual (1990) (6)
Precise Interprocedural Dataaow Analysis with Applications to Constant Propagation 1 (1995) (6)
Static-semantic analysis in language-based editors (1983) (6)
Program synthesis for interactive-security systems (2017) (6)
The synthesizer generator reference manual springer-verier (1988) (6)
Algorithmic Differencing (2001) (6)
Shipwright: A Human-in-the-Loop System for Dockerfile Repair (2021) (6)
Automatic Discovery of API-Level Vulnerabilities (2008) (6)
Central moment analysis for cost accumulators in probabilistic programs (2021) (6)
An Abstract Domain for Bit-Vector Inequalities (2013) (6)
The Interprocedural Express-Lane Transformation (2003) (6)
Physical type checking for c" paste (1999) (6)
A New Program Integration Algorithm (1989) (5)
Checking Compatibility of a Producer and a Consumer ∗ (2010) (5)
The wisconsin program - integration system reference manual: Release 2 (1993) (5)
Automatic verification of a simple mark and sweep garbabge collector (2001) (5)
Sublinear-space evaluation algorithms for attribute grammars (1987) (5)
Transformer specification language: a system for generating analyzers and its applications (2011) (5)
Secure Programming as a Parity Game (2011) (5)
Finite differencing of logical formulas with applications to program analysis (2003) (5)
Tail Bound Analysis for Probabilistic Programs via Central Moments (2020) (5)
Revamping TVLA : Making Parametric Shape Analysis Competitive ( Tool Paper ) (2007) (5)
Model-assisted machine-code synthesis (2017) (5)
Semantics-based program integration: illustrating interference in interfering versions of programs (1989) (5)
Recovering execution data from incomplete observations (2015) (4)
Verifying Concurrent Programs via Bounded Context-Switching and Induction (2011) (4)
Sound Bit-Precise Numerical Domains (2017) (4)
Learning Abstractions for Verifying Data-Structure Properties (2004) (4)
MCDASH: Refinement Based Property Verification for Machine Code (2009) (4)
Synthesis with Asymptotic Resource Bounds (2021) (4)
On the suitability of dependence graphs for representing programs (1988) (4)
WALi: Nested-Word Automata (2011) (4)
BCE: Extracting Botnet Commands from Bot Executables (2010) (4)
Distributed Certificate-Chain Discovery in SPKI/SDSI (2005) (3)
Constructing Specialized Shape Analyses for Uniform Change (2007) (3)
Sound probabilistic inference via guide types (2021) (3)
Slicing Machine Code (2015) (3)
On the computational complexity of dynamic graph algorithms (1996) (3)
Lightweight, Multi-Stage, Compiler-Assisted Application Specialization (2021) (3)
Advanced Querying for Property Checking (2007) (3)
A new abstraction framework for affine transformers (2017) (3)
Numeric Analysis of Array Operations (3)
A new abstraction framework for affine transformers (2018) (2)
The synthesizer generator reference manum 3rd edition (1989) (2)
TOFU: Target-Oriented FUzzer (2020) (2)
Programming environments: report on an international workshop at Dagstuhl Castle (1992) (2)
Programming for a Capability System via Safety Games (2011) (2)
Static verification of data-consistency properties (2009) (2)
Incremental evaluation for attribute grammars with unrestricted movement between tree modifications (1988) (2)
Program Sli ing for VHDL ? (1999) (2)
Decidable logics for expressing heap connectivity (2003) (2)
Synthesizing abstract transformers (2021) (2)
From Semantics to Computer Science: Semantics of program representation graphs (2009) (2)
Probabilistic Calling Context and Efficient Call-Trace Collection CS 701 (2016) (2)
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (2000) (2)
Expected-Cost Analysis for Probabilistic Programs and Semantics-Level Adaption of Optional Stopping Theorems (2021) (1)
Programmable Program Synthesis (2021) (1)
Making Parametric Shape Analysis Competitive (Tool Paper) (2007) (1)
Replication Package for Article: Sound Probabilistic Inference via Guide Types (2021) (1)
Interprocedural Context-Unbounded Program Analysis Using Observation Sequences (2020) (1)
CFLOBDDs: Context-Free-Language Ordered Binary Decision Diagrams (2022) (1)
Interactive Program Verification (1989) (1)
Interface to C (1989) (1)
Fast Graph Simplification for Interleaved-Dyck Reachability (2022) (1)
A Method for Symbolic Computation of Precise Abstract Transformers (2011) (1)
Defining Hybrid Editors with the Synthesizer Generator (1989) (1)
Technical Opportunities to Help with the Year 2000 Problem (1997) (1)
Automatic Verification of Strongly Dynamic Software Systems (2005) (1)
On the complexity of incremental computation (1992) (1)
The synthesizer generator: a language for constructing language-based editors (1988) (1)
Automatic Verification of Temporal Properties of Concurrent Heap-Manipulating Programs using Evolution Logic (2002) (1)
Decision Procedures and Abstract Interpretation (Dagstuhl Seminar 14351) (2014) (1)
On the Utility of Canonical Abstraction (2005) (1)
Algebraic Program Analysis (2021) (1)
Towards the Analysis of Transactional Software (2007) (1)
Program Analyses Using Newton's Method (Invited Paper) (2018) (1)
SEMANTICS OF PROGRAMREPRESENTATION GRAPHS (1989) (1)
An Appreciation of the Work of Reinhard Wilhelm (2006) (1)
A Generalization of Staalmarck's Method (2011) (1)
Secure programs via game-based synthesis (2013) (1)
Report on the Dagstuhl-Seminar on Incremental Computation and Dynamic Algorithms (1994) (0)
CS704: Lecture 10 Interpretation (2010) (0)
1 Nested-Word Automata and Overview of the Library ’ s Organization (2010) (0)
On the sequential nature of interprocedural program-analysis problems (2009) (0)
Specifying an Editor (1989) (0)
Index of Symbols (2004) (0)
P L ] 2 6 M ay 2 02 1 Synthesis with Asymptotic Resource Bounds (2021) (0)
The Attribute-Grammar Model of Editing (1989) (0)
Final Report: Software Support for Programming in the Large (1992) (0)
Incremental Computation and Dynamic Algorithms (Dagstuhl Seminar 9418) (2021) (0)
Specification of a Sample Editor (1989) (0)
Software artifact for paper: Semantics-Guided Synthesis (2020) (0)
CS704: Lecture 4 Reduction, Transitions, Equality, and Encodings in λ-Calculus (2010) (0)
Rience with Process Modeling in the Marvel Software Development Environment (2007) (0)
Incremental attribute evaluation (2004) (0)
Efficient representations of large attributes (2004) (0)
Single-Source-Single-Target Interleaved-Dyck Reachability via Integer Linear Programming (2023) (0)
Enabling Open-World Specification Mining via Unsupervised Learning (2019) (0)
A Run-Time Type-Checking Debugger for C (2007) (0)
Termination Using CFL-ReachabilityManuvir (1996) (0)
Artifact for article: Exact and Approximate Methods for Proving Unrealizability of Syntax-Guided Synthesis Problems (2020) (0)
Shipwright: A Human-in-the-Loop System for Dockerfile Repair (2021) (0)
Providing better programming environments (2004) (0)
Weighted Pushdown Systems and Weighted Transducers (2006) (0)
Decision Procedures and Abstract Interpretation (2014) (0)
Optimal-time change propagation (2004) (0)
Automatic Differentiation and Backpropagation CS 701 (2016) (0)
Verifying Information Flow Over Unbounded Processes (2009) (0)
CS704: WLP for a Language with Pointers (2010) (0)
Using an Editor (1989) (0)
Dissolve: A Distributed SAT Solver Based on Stalmarck's Method (2017) (0)
Program Analyses using Newton’s Method (2018) (0)
The Multi-Pr oce dure Equ ivalence Theorem (1989) (0)
2 Safety Checking of Machine Code (1999) (0)
Computer Sciences Department (2007) (0)
Critiques and Discussions Following David Patterson ’ s Talk CS 701 (2015) (0)
Lists, Optional Elements, and Placeholders (1989) (0)
Refinement-Based Property Verification for Machine Code ∗ (2009) (0)
The SSL Debugger (1989) (0)
The Running Time of Algorithm 7.8 (2004) (0)
Dataflow Frequency Analysis CS 701 (2015) (0)
Unrealizability Logic (2022) (0)
Attribute grammars and attribute evaluation (2004) (0)
Incremental evaluation for restricted classes of attribute grammars (2004) (0)
A Generating-Extension-Generator for Machine Code (2020) (0)
Session details: Malware (2010) (0)
Probabilistic Calling Context and Eﬃcient Call-Trace Collection (2019) (0)
Executable Slicing via Procedure Specialization (2012) (0)
TSL (2013) (0)
Generating Code Using Attributes (1989) (0)
Symbolic Quantum Simulation with Quasimodo (2023) (0)
Specialization slicing (2014) (0)
Replication Package for Article (2018) (0)
Extending the model of editing (2004) (0)
Final Report for Grant FA 9550-091-0279 : Cross-Boundary Security Analysis (2013) (0)
Improving Communicating Pushdown System Model Checking (2009) (0)
TIGHTLY INTEGRATED TOOLS AS ENVIRONMENT (1992) (0)
Performing Static Inferences with Attributes (1989) (0)
Artifact for "Templates and Recurrences: Better Together" (2020) (0)
On the Sequential Natur eo fI nterprocedural Program-Analysis Problems (1995) (0)
Software Support For Programming-in-the-Large. (1997) (0)
Demonstration of a Sample Editor (1989) (0)
Guarantees in Program Synthesis (2019) (0)
Incremental Attribute Evaluation for Ordered Attribute Grammars (1989) (0)
CROSS-BOUNDARY SECURITY ANALYSIS (2013) (0)
Programming Environments (Dagstuhl Seminar 9211) (2021) (0)
Space-efficient attribute evaluation (2004) (0)
Synthesizing Specifications (2023) (0)
Static Program Analysis CS701 (2015) (0)
Interprocedural Dataflow Analysis , Part III : Newtonian Program Analysis Via Tensor Product (2016) (0)
Opti~l-time Imcrememtal Semntic Amalyais for Syntax-directed Editors (1997) (0)
Program synthesis for interactive-security systems (2017) (0)
New Programs From Old (2016) (0)
Summarizing Calling Contexts (2010) (0)
Partial Evaluation, Part 1 CS701 (2015) (0)
Reducing the Dependence of Trust-Management Systems on PKI (2005) (0)

This paper list is powered by the following services:

Other Resources About Thomas W. Reps

en.wikipedia.org

What Schools Are Affiliated With Thomas W. Reps?

Thomas W. Reps is affiliated with the following schools: