!!Thomas W. Reps - Selected publications
\\
__Books:__\\
\\
Thomas Reps, Generating Language-Based Environments. The M.I.T. Press, Cambridge, MA, 1984.\\
\\
Thomas Reps and Tim Teitelbaum, The Synthesizer Generator: A System for Constructing Language-Based Editors. Springer-Verlag, New York, NY, 1988.\\
\\
Anupam Datta, Somesh Jha, Ninghui Li, David Melski,and Thomas Reps, Analysis Techniques for Information Security.  Synthesis Lectures on Information Security, Privacy, and Trust, Morgan & Claypool Publishers, 2010.\\
\\
__Selected Articles:__\\
\\
Tim Teitelbaum and Thomas Reps, The Cornell Program Synthesizer: A syntax-directed programming environment. Commun. ACM (CACM) 24(9), 1981.\\
     \\
Thomas Reps and Tim Teitelbaum, The Synthesizer Generator.  In Proc. ACM SIGSOFT/SIGPLAN Softw. Eng. Symp. on Practical Software Development Environments, 1984.\\
\\
Susan Horwitz, Thomas Reps, and David Binkley, Interprocedural slicing using dependence graphs. ACM Trans. Program. Lang. Syst.  (TOPLAS) 12(1), 1990; conference version: ACM PLDI 1988.\\
\\
Susan Horwitz, Jan Prins, and Thomas Reps,Integrating non-interfering versions of programs. ACM Transactions on Programming Languages and Systems 11, 3 (July 1989); conference version: ACM POPL 1988.\\
\\
Susan Horwitz and Thomas Reps, The use of program dependence graphs in software engineering. In Proceedings of the Fourteenth International Conference on Software Engineering, 1992.\\
\\
Thomas Reps, Susan Horwitz, Mooly Sagiv, and Genevieve Rosay, Speeding up slicing. SIGSOFT Foundations of Softw. Eng., 1994.\\
\\
Thomas Reps, Susan Horwitz, and Mooly Sagiv, Precise interprocedural dataflow analysis via graph reachability. 22nd ACM Symp. on Principles of Programming Languages (POPL), 1995.\\
\\
G. Ramalingam and Thomas Reps, An incremental algorithm for a generalization of the shortest-path problem. J. Algorithms 21(2), 1996.\\
\\
Thomas Reps, Thomas Ball, Manuvir Das, and James Larus, The use of program profiling for software maintenance with applications to the Year 2000 Problem. In Proc. of ESEC/FSE '97: Sixth European Softw. Eng. Conf. and Fifth ACM SIGSOFT Symp. on the Foundations of Softw. Eng., 1997.\\
\\
Michael Siff and Thomas Reps, Identifying modules via concept analysis.  IEEE Trans. on Softw. Eng. (TSE) 25, 6 (Nov./Dec. 1999); conference version: ICSM 1997.\\
\\
Mooly Sagiv, Thomas Reps, and Reinhard Wilhelm, Solving shape-analysis problems in languages with destructive updating. ACM Transactions on Programming Languages and Systems 20, 1 (January 1998); conference version: ACM POPL 1996.\\
\\
Thomas Reps, Program analysis via graph reachability. Information and Software Technology 40, 11-12 (November/December 1998).\\
\\
Mooly Sagiv, Thomas Reps and Reinhard Wilhelm, Parametric shape analysis via 3-valued logic. ACM Trans. Program. Lang. Syst.  (TOPLAS) 24(3), 2002; conference version: ACM POPL 1999.\\
\\
Thomas Reps, Stefan Schwoon, Somesh Jha, and David Melski, Weighted pushdown systems and their application to interprocedural dataflow analysis. Sci. Comput. Program. (SCP) 58(1-2), 2005; conference version: 10th Int. Symp. on Static Analysis (SAS), 2003.\\
\\
Gogul Balakrishnan and Thomas Reps, Analyzing memory accesses in x86 executables. Int. Conf. on Compiler Construction (CC), 2004.\\
\\
Thomas Reps, Mooly Sagiv, and Greta Yorsh, Symbolic implementation of the best transformer. In Proc. Verification, Model Checking, and Abstract Interpretation (VMCAI), 2004.\\
\\
Gogul Balakrishnan and Thomas Reps, Recency-abstraction for heap-allocated storage. In Static Analysis Symposium (SAS), 2006.\\
\\
Gogul Balakrishnan and Thomas Reps, DIVINE: DIscovering Variables IN Executables.  In Proc. Verification, Model Checking, and Abstract Interpretation (VMCAI), 2007.\\
\\
Junghee Lim and Thomas Reps, A system for generating static analyzers for machine instructions. Int. Conf. on Compiler Construction (CC), 2008.\\
\\
Akash Lal and Thomas Reps, Reducing concurrent analysis under a context bound to sequential analysis. Formal Methods in System Design (FMSD) 35(1), 2009; conference version: Int. Conf. on Computer Aided Verification (CAV), 2008.\\
\\
Gogul Balakrishnan and Thomas Reps, WYSINWYX: What you see is not what you eXecute. ACM Trans. Program. Lang. Syst. (TOPLAS) 32(6), 2010.\\
\\
Aditya Thakur and Thomas Reps, A method for symbolic computation of abstract operations. In Proc. Computer-Aided Verification (CAV), 2012.\\
\\
William R. Harris, Somesh Jha, and Thomas Reps, Secure programming via visibly pushdown safety games. In Proc. Computer-Aided Verification (CAV), 2012.\\
\\
Matthew Fredrikson, Richard Joiner, Somesh Jha, Thomas Reps, Phillip Porras, Hassan Saidi, and Vinod Yegneswaran, Efficient runtime policy enforcement using counterexample-guided abstraction refinement. In Proc. Computer-Aided Verification (CAV), 2012.\\
\\
Aditya Thakur, Matt Elder, and Thomas Reps, Bilateral algorithms for symbolic abstraction. In Proc. Static Analysis Symposium (SAS), 2012.\\
\\
Aditya Thakur and Thomas Reps, A generalization of Staalmarck's method. In Proc. Static Analysis Symposium (SAS), 2012.\\
\\
William R. Harris, Somesh Jha, Thomas Reps, Jonathan Anderson, and Robert N.M. Watson,\\
Declarative, temporal, and practical programming with capabilities. In Proc. IEEE Symposium on Security and Privacy (SP), 2013.