http:^^www.cs.wisc.edu^~reps^reps.html

来自「This data set contains WWW-pages collect」· HTML 代码 · 共 1,008 行 · 第 1/5 页

on Text Manipulation</i>, (Portland, OR, June 8-10, 1981),
<i>ACM SIGPLAN Notices 16</i>, 6 (June 1981), pp. 8-16.
</ul>

<h3>Conference Publications</h3>
<ul>
<li>
<a name="fse96">
Siff, M. and Reps, T.,</a>
Program generalization for software reuse: From C to C++,
To appear in <i>SIGSOFT 96: Proceedings of the Fourth ACM SIGSOFT
Symposium on the Foundations of Software Engineering</i>,
(San Francisco, CA, October 16-18, 1996),
<i>ACM SIGSOFT Software Engineering Notes</i>, 1996.
<!WA135><!WA135><!WA135><!WA135><!WA135><!WA135><!WA135><!WA135><!WA135><!WA135><!WA135><!WA135><!WA135><!WA135><!WA135><!WA135><!WA135><!WA135><!WA135><!WA135><!WA135><!WA135><!WA135><!WA135><!WA135><!WA135><!WA135><!WA135><A HREF="http://www.cs.wisc.edu/wpis/papers/fse96.ps"> fse96.ps </A>
<p>
<li>
<a name="dagstuhl96">
Reps, T. and Turnidge, T.,</a>
Program specialization via program slicing,
In <i>Proceedings of the Dagstuhl Seminar on Partial Evaluation,</i>
(Schloss Dagstuhl, Wadern, Germany, Feb. 12-16, 1996),
<i>Lecture Notes in Computer Science</i>, Vol. 1110,
O. Danvy, R. Glueck, and P. Thiemann (eds.),
Springer-Verlag, New York, NY, 1996, pp. 409-429.
<!WA136><!WA136><!WA136><!WA136><!WA136><!WA136><!WA136><!WA136><!WA136><!WA136><!WA136><!WA136><!WA136><!WA136><!WA136><!WA136><!WA136><!WA136><!WA136><!WA136><!WA136><!WA136><!WA136><!WA136><!WA136><!WA136><!WA136><!WA136><A HREF="http://www.cs.wisc.edu/wpis/papers/dagstuhl96.ps"> dagstuhl96.ps </A>
<p>
<li>
<a name="popl96">
Sagiv, M., Reps, T., and Wilhelm, R.,</a>
Solving shape-analysis problems in languages with destructive updating.
In <i>Conference Record of the Twenty-Third ACM Symposium
on Principles of Programming Languages</i>,
(St. Petersburg, FL, Jan. 22-24, 1996), ACM, New York, NY, 1996, pp. 16-31.
<!WA137><!WA137><!WA137><!WA137><!WA137><!WA137><!WA137><!WA137><!WA137><!WA137><!WA137><!WA137><!WA137><!WA137><!WA137><!WA137><!WA137><!WA137><!WA137><!WA137><!WA137><!WA137><!WA137><!WA137><!WA137><!WA137><!WA137><!WA137><A HREF="http://www.cs.wisc.edu/wpis/papers/popl96.ps"> popl96.ps </A>
<p>
<li>
<a name="fse95a">
Horwitz, S., Reps, T., and Sagiv, M.,</a>
Demand interprocedural dataflow analysis.
In <i>SIGSOFT '95: Proceedings of the Third ACM SIGSOFT
Symposium on the Foundations of Software Engineering</i>,
(Washington, DC, October 10-13, 1995),
<i>ACM SIGSOFT Software Engineering Notes 20</i>, 4 (1995), pp. 104-115.
<!WA138><!WA138><!WA138><!WA138><!WA138><!WA138><!WA138><!WA138><!WA138><!WA138><!WA138><!WA138><!WA138><!WA138><!WA138><!WA138><!WA138><!WA138><!WA138><!WA138><!WA138><!WA138><!WA138><!WA138><!WA138><!WA138><!WA138><!WA138><A HREF="http://www.cs.wisc.edu/wpis/papers/fse95a.ps"> fse95a.ps </A>
<p>
<li>
<a name="fse95b">
Reps, T. and Rosay, G.,</a>
Precise interprocedural chopping.
In <i>SIGSOFT '95: Proceedings of the Third ACM SIGSOFT
Symposium on the Foundations of Software Engineering</i>,
(Washington, DC, October 10-13, 1995),
<i>ACM SIGSOFT Software Engineering Notes 20</i>, 4 (1995), pp. 41-52.
<!WA139><!WA139><!WA139><!WA139><!WA139><!WA139><!WA139><!WA139><!WA139><!WA139><!WA139><!WA139><!WA139><!WA139><!WA139><!WA139><!WA139><!WA139><!WA139><!WA139><!WA139><!WA139><!WA139><!WA139><!WA139><!WA139><!WA139><!WA139><A HREF="http://www.cs.wisc.edu/wpis/papers/fse95b.ps"> fse95b.ps </A>
<p>
<li>
<a name="pepm95a">
Das, M., Reps, T., and Van Hentenryck, P.</a>
Semantic foundations of binding-time analysis for imperative programs.
In <i>PEPM '95: Proceedings of the ACM SIGPLAN Symposium on
Partial Evaluation and Semantics-Based Program Manipulation</i>,
(La Jolla, California, June 21-23, 1995),
ACM, New York, NY, 1995, pp. 100-110.
<!WA140><!WA140><!WA140><!WA140><!WA140><!WA140><!WA140><!WA140><!WA140><!WA140><!WA140><!WA140><!WA140><!WA140><!WA140><!WA140><!WA140><!WA140><!WA140><!WA140><!WA140><!WA140><!WA140><!WA140><!WA140><!WA140><!WA140><!WA140><A HREF="http://www.cs.wisc.edu/wpis/papers/pepm95a.ps"> pepm95a.ps </A>
<p>
<li>
<a name="pepm95b">
Reps, T.,</a>
Shape analysis as a generalized path problem.
In <i>PEPM '95: Proceedings of the ACM SIGPLAN Symposium on
Partial Evaluation and Semantics-Based Program Manipulation</i>,
(La Jolla, California, June 21-23, 1995),
ACM, New York, NY, 1995, pp. 1-11.
<!WA141><!WA141><!WA141><!WA141><!WA141><!WA141><!WA141><!WA141><!WA141><!WA141><!WA141><!WA141><!WA141><!WA141><!WA141><!WA141><!WA141><!WA141><!WA141><!WA141><!WA141><!WA141><!WA141><!WA141><!WA141><!WA141><!WA141><!WA141><A HREF="http://www.cs.wisc.edu/wpis/papers/pepm95b.ps"> pepm95b.ps </A>
<p>
<li>
<a name="fase95">
Sagiv, M., Reps, T., and Horwitz, S.,</a>
Precise interprocedural dataflow analysis with applications to
constant propagation.
In <i>Proceedings of FASE '95: Colloquium on Formal
Approaches in Software Engineering</i>, (Aarhus, Denmark, May 22-26, 1995),
<i>Lecture Notes in Computer Science</i>, Vol. 915,
P.D. Mosses, M. Nielsen, and M.I. Schwartzbach (eds.), Springer-Verlag,
New York, NY, 1995, pp. 651-665.
<!WA142><!WA142><!WA142><!WA142><!WA142><!WA142><!WA142><!WA142><!WA142><!WA142><!WA142><!WA142><!WA142><!WA142><!WA142><!WA142><!WA142><!WA142><!WA142><!WA142><!WA142><!WA142><!WA142><!WA142><!WA142><!WA142><!WA142><!WA142><A HREF="http://www.cs.wisc.edu/wpis/papers/tapsoft95.ps"> tapsoft95.ps </A>
<p>
<li>
<a name="popl95">
Reps, T., Horwitz, S., and Sagiv, M.,</a>
Precise interprocedural dataflow analysis via graph reachability.
In <i>Conference Record of the Twenty-Second ACM Symposium
on Principles of Programming Languages</i>,
(San Francisco, CA, Jan. 23-25, 1995), pp. 49-61.
<!WA143><!WA143><!WA143><!WA143><!WA143><!WA143><!WA143><!WA143><!WA143><!WA143><!WA143><!WA143><!WA143><!WA143><!WA143><!WA143><!WA143><!WA143><!WA143><!WA143><!WA143><!WA143><!WA143><!WA143><!WA143><!WA143><!WA143><!WA143><A HREF="http://www.cs.wisc.edu/wpis/papers/popl95.ps"> popl95.ps </A>
<p>
<li>
<a name="fse94">
Reps, T., Horwitz, S., Sagiv, M., and Rosay, G.,</a>
Speeding up slicing.
In <i>SIGSOFT '94: Proceedings of the Second ACM SIGSOFT Symposium on
the Foundations of Software Engineering</i>,
(New Orleans, LA, December 7-9, 1994),
<i>ACM SIGSOFT Software Engineering Notes 19</i>, 5 (December 1994), pp. 11-20.
<!WA144><!WA144><!WA144><!WA144><!WA144><!WA144><!WA144><!WA144><!WA144><!WA144><!WA144><!WA144><!WA144><!WA144><!WA144><!WA144><!WA144><!WA144><!WA144><!WA144><!WA144><!WA144><!WA144><!WA144><!WA144><!WA144><!WA144><!WA144><A HREF="http://www.cs.wisc.edu/wpis/papers/fse94.ps"> fse94.ps </A>
<p>
<li>
<a name="cc94">
Reps, T.,</a>
Solving demand versions of interprocedural analysis problems.
In <i>Proceedings of the Fifth International Conference on Compiler
Construction</i>, (Edinburgh, Scotland, April 7-9, 1994),
<i>Lecture Notes in Computer Science</i>, Vol. 786, P. Fritzson (ed.),
Springer-Verlag, New York, NY, 1994, pp. 389-403.
<!WA145><!WA145><!WA145><!WA145><!WA145><!WA145><!WA145><!WA145><!WA145><!WA145><!WA145><!WA145><!WA145><!WA145><!WA145><!WA145><!WA145><!WA145><!WA145><!WA145><!WA145><!WA145><!WA145><!WA145><!WA145><!WA145><!WA145><!WA145><A HREF="http://www.cs.wisc.edu/wpis/papers/cc94.ps"> cc94.ps </A>
<p>
<li>
<a name="popl94">
Ramalingam, G. and Reps, T.,</a>
An incremental algorithm for maintaining the dominator tree of a reducible
flowgraph.
In <i>Conference Record of the Twenty-First ACM Symposium
on Principles of Programming Languages</i>, (Portland, OR, Jan. 16-19, 1994),
pp. 287-296.
<!WA146><!WA146><!WA146><!WA146><!WA146><!WA146><!WA146><!WA146><!WA146><!WA146><!WA146><!WA146><!WA146><!WA146><!WA146><!WA146><!WA146><!WA146><!WA146><!WA146><!WA146><!WA146><!WA146><!WA146><!WA146><!WA146><!WA146><!WA146><A HREF="http://www.cs.wisc.edu/wpis/papers/popl94.ps"> popl94.ps </A>
<p>
<li>
<a name="spaa93">
Reps, T.,</a>
Scan grammars: Parallel attribute evaluation via data-parallelism.
In <i>Proceedings of the Fifth ACM Symposium on Parallel Algorithms and
Architectures</i>, (Velen, Germany, June 30 - July 2, 1993).
<!WA147><!WA147><!WA147><!WA147><!WA147><!WA147><!WA147><!WA147><!WA147><!WA147><!WA147><!WA147><!WA147><!WA147><!WA147><!WA147><!WA147><!WA147><!WA147><!WA147><!WA147><!WA147><!WA147><!WA147><!WA147><!WA147><!WA147><!WA147><A HREF="http://www.cs.wisc.edu/wpis/papers/spaa93.ps"> spaa93.ps </A>
<p>
<li>
<a name="amast91">
Ramalingam, G. and Reps, T.,</a>
Modification algebras.
In <i>Proceedings of the Second International Conference on
Algebraic Methodology and Software Technology (AMAST)</i>,
(Iowa City, Iowa, May 22-24, 1991).
<p>
<li>
<a name="ccpsd91">
Ramalingam, G. and Reps, T.,</a>
A theory of program modifications.
In <i>Proceedings of the Colloquium on Combining Paradigms
for Software Development</i>, (Brighton, UK, April 8-12, 1991),
<i>Lecture Notes in Computer Science</i>, Vol. 494,
S. Abramsky and T.S.E. Maibaum (eds.),
Springer-Verlag, New York, NY, 1991, pp. 137-152.
<p>
<li>
<a name="sigsoft90">
Yang, W., Horwitz, S., and Reps, T.,</a>
A program integration algorithm that accommodates semantics-preserving transformations.
In <i>SIGSOFT '90: Proceedings of the Fourth ACM SIGSOFT Symposium
on Software Development Environments</i>, (Irvine, CA, December 3-5, 1990),
<i>ACM Software Engineering Notes 15</i>, 6 (December 1990), pp. 133-143.
<p>
<li>
<a name="esop90">
Reps, T.,</a>
Algebraic properties of program integration.
In <i>Proceedings of the 3nd European Symposium on Programming</i>
(Copenhagen, Denmark, May 15-18, 1990),
<i>Lecture Notes in Computer Science</i>, Vol. 432, N. Jones (ed.),
Springer-Verlag, New York, NY, 1990, pp. 326-340.
<p>
<li>
<a name="iwscm89">
Reps, T. and Bricker, T.,</a>
Illustrating interference in interfering versions of programs.
In <i>Proceedings of the Second International Workshop on Software
Configuration Management</i>, (Princeton, NJ, October 24-27, 1989),
<i>ACM Software Engineering Notes 17</i>, 7 (November 1989), pp. 46-55.
<p>
<li>
<a name="sigplan89">
Horwitz, S., Pfeiffer, P., and Reps, T.,</a>
Dependence analysis for pointer variables.
In <i>Proceedings of the ACM SIGPLAN 89 Conference on Programming Language
Design and Implementation</i>, (Portland, OR, June 21-23, 1989),
<i>ACM SIGPLAN Notices 24</i>, 7 (July 1989), pp. 28-40.
<p>
<li>
<a name="ccipl89">
Reps, T. and Yang, W.,</a>
The semantics of program slicing and program integration.
In <i>Proceedings of the Colloquium on Current Issues
in Programming Languages</i>, (Barcelona, Spain, March 13-17, 1989),
<i>Lecture Notes in Computer Science</i>, Vol. 352,
J. Diaz and F. Orejas (eds.), Springer-Verlag, New York, NY, 1989,
pp. 360-374.
<p>
<li>
<a name="pldi88">
Horwitz, S., Reps, T., and Binkley, D.,</a>
Interprocedural slicing using dependence graphs.
In <i>Proceedings of the ACM SIGPLAN 88 Conference on Programming
Language Design and Implementation</i>, (Atlanta, GA, June 22-24, 1988),