T Smith

About

T Smith (they/them) is the inaugural Postdoctoral Fellow in Racial Politics at Johns Hopkins University. Their research and writing interests include Black politics, queer theory, Black Feminism, and social movements. They are a scholar of Black political behavior and futurity, with a focus on young Black activists and organizers.

Research topics

• Computer science
• Programming language
• Theoretical computer science
• Algorithm
• Mathematics

Selected publications

• Backstage Java

  2011-10-22 · 9 citations

  articleSenior author

  We propose Backstage Java (BSJ), a Java language extension which allows algorithmic, contextually-aware generation and transformation of code. BSJ explicitly and concisely represents design patterns and other encodings by employing compile-time metaprogramming: a practice in which the programmer writes instructions which are executed over the program's AST during compilation. While compile-time metaprogramming has been successfully used in functional languages such as Template Haskell, a number…

  PublisherDOI

• Higher-Order Demand-Driven Program Analysis

  DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2016-01-01 · 7 citations

  articleOpen accessSenior author

  We explore a novel approach to higher-order program analysis that brings ideas of on-demand lookup from first-order CFL-reachability program analyses to higher-order programs. The analysis needs to produce only a control-flow graph; it can derive all other information including values of variables directly from the graph. Several challenges had to be overcome, including how to build the control-flow graph on-the-fly and how to deal with non-local variables in functions. The resulting analysis is…

  PublisherOA PDFDOI

• Higher-order Demand-driven Program Analysis

  ACM Transactions on Programming Languages and Systems · 2019-07-02 · 6 citations

  articleSenior author

  Developing accurate and efficient program analyses for languages with higher-order functions is known to be difficult. Here we define a new higher-order program analysis, Demand-Driven Program Analysis (DDPA), which extends well-known demand-driven lookup techniques found in first-order program analyses to higher-order programs. This task presents several unique challenges to obtain good accuracy, including the need for a new method for demand-driven lookup of non-local variable values. DDPA is…

  PublisherDOI

• Higher-order demand-driven symbolic evaluation

  Proceedings of the ACM on Programming Languages · 2020-08-02 · 5 citations

  articleOpen access

  Symbolic backwards execution (SBE) is a useful variation on standard forward symbolic evaluation; it allows a symbolic evaluation to start anywhere in the program and proceed by executing in reverse to the program start. SBE brings goal-directed reasoning to symbolic evaluation and has proven effective in e.g. automated test generation for imperative languages. In this paper we define DDSE, a novel SBE which operates on a functional as opposed to imperative language; furthermore, it is defined a…

  PublisherOA PDFDOI

• Relative Store Fragments for Singleton Abstraction

  Lecture notes in computer science · 2017-01-01 · 5 citations

  book-chapterSenior author
  PublisherDOI

Frequent coauthors

• Christian Skalka

  University of Vermont

  17 shared

• Carolyn Talcott

  13 shared

• Yu David Liu

  Binghamton University

  12 shared

• Zachary Palmer

  Swarthmore College

  9 shared

• R. Zhang

  8 shared

• Ian A. Mason

  SRI International

  8 shared

• Valery Trifonov

  7 shared

• Jonathan Eifrig

  Johns Hopkins University

  6 shared

Similar researchers at Johns Hopkins University

• Richard S. Katzh-44
• Daniel Deudneyh-27
• Robert Liebermanh-24