Вы здесь

Reps T.

Автор:

Вид Название Год Автор Серия Редакторы Колл. автор Источник Дата поступления
СТ Analyzing Memory Accesses in x86 Executables 2004 Balakrishnan G., Reps T. Lecture Notes in Computer Science 22.04.2004
СТ Symbolic Implementation of the Best Transformer 2004 Reps T., Sagiv M., Yorsh G. Lecture Notes in Computer Science 12.02.2004
СТ Weighted Pushdown Systems and Their Application to Interprocedural Dataflow Analysis 2003 Reps T., Schwoon S., Jha S. Lecture Notes in Computer Science 18.09.2003
СТ Verifying Temporal Heap Properties Specified via Evolution Logic 2003 Yahav E., Reps T., Sagiv M., Wilhelm R. Lecture Notes in Computer Science 16.04.2003
СТ The Interprocedural Express-Lane Transformation 2003 Melski D., Reps T. Lecture Notes in Computer Science 11.04.2003
СТ Identifying Modules via Concept Analysis 1999 Siff M., Reps T. IEEE Trans. on Software Engineering 02.04.2002
СТ Model Checking of Unrestricted Hierarchical State Machines 2001 Benedikt M., Godefroid P., Reps T. Lecture Notes in Computer Science 28.07.2001
СТ Debugging via Run-Time Type Checking 2001 Loginov A., Yong S. H., Horwitz S., Reps T. Lecture Notes in Computer Science 05.05.2001
СТ Putting Static Analysis to Work for Verification: A Case Study 2000 Lev-Ami T., Reps T., Sagiv M., Wilhelm R. Software Engineering Notes 14.12.2000
СТ Shape Analysis 2000 Wilhelm R., Sagiv M., Reps T. Lecture Notes in Computer Science 22.04.2000
СТ Physical Type Checking for C 1999 Chandra S., Reps T. Software Engineering Notes 02.11.1999
СТ Coping with Type Casts in C 1999 Siff M., Chandra S., Ball T., Kuchithapadam K., Reps T. Lecture Notes in Computer Science 14.10.1999
СТ Pointer Analysis for Programs with Structures and Casting 1999 Yong S. H., Horwitz S., Reps T. SIGPLAN Notices 20.08.1999
СТ A Decidable Logic for Describing Linked Data Structures 1999 Benedikt M., Reps T., Sagiv M. Lecture Notes in Computer Science 07.04.1999
СТ Interprocedural Path Profiling 1999 Melski D., Reps T. Lecture Notes in Computer Science 02.04.1999
СТ "Maximal-Munch" Tokenization in Linear Time 1998 Reps T. ACM Trans. on Programming Languages and Systems 27.11.1998
СТ Solving Shape-Analysis Problems in Languages with Destructive Updating 1998 Sagiv M., Reps T., Wilhelm R. ACM Trans. on Programming Languages and Systems 30.07.1998
СТ Program Analysis via Graph Reachability 1997 Reps T. Logic Programming 05.03.1998
СТ Interconvertibility of Set Constraint and Context-Free Language Reachability 1997 Melski D., Reps T. SIGPLAN Notices 27.01.1998
СТ The Use of Program Profiling for Software Maintenance with Applications to the Year 2000 Problem 1997 Reps T., Ball T., Das M., Larus J. Lecture Notes in Computer Science 07.10.1997
СТ Shape Analysis as a Generalized Path Problem 1995 Reps T. Proc. of the ACM SIGPLAN Symp. on Partial Evaluation and Semantics-Based Program Manipulation 13.08.1997
СТ Semantic Foundations of Binding-Time Analysis for Imperative Programs 1995 Das M., Reps T., Van Hentenryck P. Proc. of the ACM SIGPLAN Symp. on Partial Evaluation and Semantics-Based Program Manipulation 13.08.1997
СТ On the Sequential Nature of Interprocedural Program-Analysis Problems 1996 Reps T. Acta Informatica 26.12.1996
СТ Program Specialization via Program Slicing 1996 Reps T., Turnidge T. Lecture Notes in Computer Science Partial Evaluation 10.10.1996
СТ Precise Interprocedural Dataflow Analysis with Applications to Constant Propagation 1995 Sagiv M., Reps T., Horwitz S. Lecture Notes in Computer Science 20.06.1995
СТ Solving Demand Versions of Interprocedural Analysis Problems 1994 Reps T. Lecture Notes in Computer Science 27.04.1994
СТ A Program Integration Algorithm that Accomodates Semantics-Preserving Transformations 1992 Yang W., Horowitz S., Reps T. ACM Trans. Software Engineering and Methodology 06.11.1992
СТ Efficient comparison of program slices 1991 Horwitz S., Reps T. Acta Informatica 10.01.1992
СТ A Theory of Program Modifications 1991 Ramalingam G., Reps T. Lecture Notes in Computer Science 21.05.1991