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

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

<li>
<a name="tcs96">
Ramalingam, G. and Reps, T.,</a>
On the computational complexity of dynamic graph problems.
In <i>Theoretical Computer Science A 158</i> (May 1996), 233-277.
<!WA124><!WA124><!WA124><!WA124><!WA124><!WA124><!WA124><!WA124><!WA124><!WA124><!WA124><!WA124><!WA124><!WA124><!WA124><!WA124><!WA124><!WA124><!WA124><!WA124><!WA124><!WA124><!WA124><!WA124><!WA124><!WA124><!WA124><!WA124><A HREF="http://www.cs.wisc.edu/wpis/papers/tcs96.ps"> tcs96.ps </A>
<p>
<li>
<a name="tosem95">
Binkley, D., Horwitz, S., and Reps, T.,</a>
Program integration for languages with procedure calls.
<i>ACM Transactions on Software Engineering and Methodology 4</i>, 1
(January 1995), pp. 3-35.
<!WA125><!WA125><!WA125><!WA125><!WA125><!WA125><!WA125><!WA125><!WA125><!WA125><!WA125><!WA125><!WA125><!WA125><!WA125><!WA125><!WA125><!WA125><!WA125><!WA125><!WA125><!WA125><!WA125><!WA125><!WA125><!WA125><!WA125><!WA125><A HREF="http://www.cs.wisc.edu/wpis/papers/tosem95.ps"> tosem95.ps </A>
<p>
<li>
<a name="ipl94">
Ramalingam, G. and Reps, T.,</a>
On competitive on-line algorithms for the dynamic priority-ordering problem.
<i>Information Processing Letters 51</i> (1994), 155-161.
<!WA126><!WA126><!WA126><!WA126><!WA126><!WA126><!WA126><!WA126><!WA126><!WA126><!WA126><!WA126><!WA126><!WA126><!WA126><!WA126><!WA126><!WA126><!WA126><!WA126><!WA126><!WA126><!WA126><!WA126><!WA126><!WA126><!WA126><!WA126><A HREF="http://www.cs.wisc.edu/wpis/papers/ipl94.ps"> ipl94.ps </A>
<p>
<li>
<a name="tosem92">
Yang, W., Horwitz, S., and Reps, T.,</a>
A program integration algorithm that accommodates semantics-preserving
transformations.
<i>ACM Transactions on Software Engineering and Methodology 1</i>, 3
(July 1992), 310-354.
<p>
<li>
<a name="scp91">
Reps, T.,</a>
Algebraic properties of program integration.
<i>Science of Computer Programming 17</i> (1991), 139-215.
<!WA127><!WA127><!WA127><!WA127><!WA127><!WA127><!WA127><!WA127><!WA127><!WA127><!WA127><!WA127><!WA127><!WA127><!WA127><!WA127><!WA127><!WA127><!WA127><!WA127><!WA127><!WA127><!WA127><!WA127><!WA127><!WA127><!WA127><!WA127><A HREF="http://www.cs.wisc.edu/wpis/papers/scp91.ps"> scp91.ps </A>
<p>
<li>
<a name="acta91">
Horwitz, S. and Reps, T.,</a>
Efficient comparison of program slices.
<i>Acta Informatica 28</i> (1991), 713-732.
<p>
<li>
<a name="toplas90">
Horwitz, S., Reps, T., and Binkley, D.,</a>
Interprocedural slicing using dependence graphs.
<i>ACM Transactions on Programming Languages and Systems 12</i>, 1
(January 1990), 26-60.
<!WA128><!WA128><!WA128><!WA128><!WA128><!WA128><!WA128><!WA128><!WA128><!WA128><!WA128><!WA128><!WA128><!WA128><!WA128><!WA128><!WA128><!WA128><!WA128><!WA128><!WA128><!WA128><!WA128><!WA128><!WA128><!WA128><!WA128><!WA128><A HREF="http://www.cs.wisc.edu/wpis/papers/toplas90.ps"> toplas90.ps </A>
<p>
<li>
<a name="toplas89">
Horwitz, S., Prins, J., and Reps, T.,</a>
Integrating non-interfering versions of programs.
<i>ACM Transactions on Programming Languages and Systems 11</i>, 3 (July 1989),
345-387.
<!WA129><!WA129><!WA129><!WA129><!WA129><!WA129><!WA129><!WA129><!WA129><!WA129><!WA129><!WA129><!WA129><!WA129><!WA129><!WA129><!WA129><!WA129><!WA129><!WA129><!WA129><!WA129><!WA129><!WA129><!WA129><!WA129><!WA129><!WA129><A HREF="http://www.cs.wisc.edu/wpis/papers/toplas89.ps"> toplas89.ps </A>
<p>
<li>
<a name="acta88">
Reps, T.</a>
Incremental evaluation for attribute grammars
with unrestricted movement between tree modifications.
<i>Acta Informatica 25</i> (1988), 155-178.
<p>
<li>
<a name="computer87">
Reps, T. and Teitelbaum, T.,</a>
Language processing in program editors.
<i>IEEE Computer 20</i>, 11 (November 1987), 29-40.
<p>
<li>
<a name="toplas87">
Reps, T. and Demers, A.,</a>
Sublinear-space evaluation algorithms for attribute grammars.
<i>ACM Transactions on Programming Languages and Systems 9</i>, 3 (July 1987),
408-440.
<p>
<li>
<a name="toplas83">
Reps, T., Teitelbaum, T., and Demers, A.,</a>
Incremental context-dependent analysis for language-based editors.
<i>ACM Transactions on Programming Languages and Systems 5</i>, 3 (July 1983),
449-477.
<p>
<li>
<a name="cacm81">
Teitelbaum, T. and Reps, T.,</a>
The Cornell Program Synthesizer: A syntax-directed programming environment.
<i>Communications of the ACM 24</i>, 9 (September 1981), 563-573.
</ul>

<h3>Invited Papers</h3>
<ul>
<li>
<a name="icse92">
Horwitz, S. and Reps, T.,</a>
The use of program dependence graphs in software engineering.
In <i>Proceedings of the Fourteenth International Conference
on Software Engineering</i>, (May 11-15, 1992, Melbourne, Australia),
ACM, New York, NY, 1992, pp. 392-411.
<!WA130><!WA130><!WA130><!WA130><!WA130><!WA130><!WA130><!WA130><!WA130><!WA130><!WA130><!WA130><!WA130><!WA130><!WA130><!WA130><!WA130><!WA130><!WA130><!WA130><!WA130><!WA130><!WA130><!WA130><!WA130><!WA130><!WA130><!WA130><A HREF="http://www.cs.wisc.edu/wpis/papers/icse92.ps"> icse92.ps </A>
<p>
<li>
<a name="esop88">
Reps, T. and Horwitz, S.,</a>
Semantics-based program integration.
In <i>Proceedings of the Second European Symposium on Programming</i>,
(Nancy, France, March 21-25, 1988), <i>Lecture Notes in Computer Science</i>,
Vol. 300, H. Ganzinger (ed.), Springer-Verlag, New York, NY, 1988, pp. 1-20.
</ul>
<h3>Book Chapters</h3>
<ul>
<li>
<a name="ald94">
Reps, T.,</a>
Demand interprocedural program analysis using logic databases,
In <i>Applications of Logic Databases</i>,
R. Ramakrishnan (ed.), Kluwer Academic Publishers, Boston, MA, 1994,
pp. 163-196.
<!WA131><!WA131><!WA131><!WA131><!WA131><!WA131><!WA131><!WA131><!WA131><!WA131><!WA131><!WA131><!WA131><!WA131><!WA131><!WA131><!WA131><!WA131><!WA131><!WA131><!WA131><!WA131><!WA131><!WA131><!WA131><!WA131><!WA131><!WA131><A HREF="http://www.cs.wisc.edu/wpis/papers/ald94.ps"> ald94.ps </A>
<p>
<li>
<a name="scia95">
Horwitz, S., Reps, T., and Binkley, D.,</a>
Interprocedural slicing using dependence graphs.
In <i>Software Change Impact Analysis</i>,
S.A. Bohner and R.S. Arnold (eds.), IEEE Computer Society,
Los Alamitos, CA.
(To appear.)
<p>
Reprinted from
<i>ACM Transactions on Programming Languages and Systems 12</i>, 1
(January 1990), 26-60.
<!WA132><!WA132><!WA132><!WA132><!WA132><!WA132><!WA132><!WA132><!WA132><!WA132><!WA132><!WA132><!WA132><!WA132><!WA132><!WA132><!WA132><!WA132><!WA132><!WA132><!WA132><!WA132><!WA132><!WA132><!WA132><!WA132><!WA132><!WA132><A HREF="http://www.cs.wisc.edu/wpis/papers/toplas90.ps"> toplas90.ps </A>
<p>
<li>
<a name="sms95a">
Horwitz, S., Reps, T., and Binkley, D.,</a>
Interprocedural slicing using dependence graphs.
In <i>Software Merging and Slicing</i>,
V. Berzins (ed.), IEEE Computer Society, Los Alamitos, CA, pp. 10-44.
<p>
Reprinted from
<i>ACM Transactions on Programming Languages and Systems 12</i>, 1
(January 1990), 26-60.
<!WA133><!WA133><!WA133><!WA133><!WA133><!WA133><!WA133><!WA133><!WA133><!WA133><!WA133><!WA133><!WA133><!WA133><!WA133><!WA133><!WA133><!WA133><!WA133><!WA133><!WA133><!WA133><!WA133><!WA133><!WA133><!WA133><!WA133><!WA133><A HREF="http://www.cs.wisc.edu/wpis/papers/toplas90.ps"> toplas90.ps </A>
<p>
<li>
<a name="sms95b">
Horwitz, S., Prins, J., and Reps, T.,</a>
Integrating non-interfering versions of programs.
In <i>Software Merging and Slicing</i>,
V. Berzins (ed.), IEEE Computer Society, Los Alamitos, CA, pp. 137-179.
<p>
Reprinted from
<i>ACM Transactions on Programming Languages and Systems 11</i>, 3 (July 1989),
345-387.
<!WA134><!WA134><!WA134><!WA134><!WA134><!WA134><!WA134><!WA134><!WA134><!WA134><!WA134><!WA134><!WA134><!WA134><!WA134><!WA134><!WA134><!WA134><!WA134><!WA134><!WA134><!WA134><!WA134><!WA134><!WA134><!WA134><!WA134><!WA134><A HREF="http://www.cs.wisc.edu/wpis/papers/toplas89.ps"> toplas89.ps </A>
<p>
<li>
<a name="sms95c">
Ramalingam, G. and Reps, T.,</a>
A theory of program modifications.
In <i>Software Merging and Slicing</i>,
V. Berzins (ed.), IEEE Computer Society, Los Alamitos, CA, 90-105.
<p>
Reprinted from
<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="lape92">
Reps, T. and Teitelbaum, T.,</a>
Language processing in program editors.
In <i>Language Architectures and Programming Environments</i>,
T. Ichikawa and H. Tsubotani (eds.),
The World Scientific Publishing Company, Singapore, 1992, pp. 146-169.
<p>
Reprinted from <i>IEEE Computer 20</i>, 11 (November 1987), 29-40.
<p>
<li>
<a name="ipe84">
Teitelbaum, T. and Reps, T.,</a>
The Cornell Program Synthesizer: A syntax-directed programming environment.
In <i>Interactive Programming Environments</i>,
D. Barstow, E. Sandewall, and H. Shrobe (eds.), McGraw-Hill, 1984, pp. 97-116.
<p>
Reprinted from <i>Communications of the ACM 24</i>, 9 (September 1981), 563-573.
<p>
<li>
<a name="sde81">
Teitelbaum, T., Reps, T., and Horwitz, S.,</a>
The why and wherefore of the Cornell Program Synthesizer.
In <i>Software Development Environments</i>, A.I. Wasserman (ed.),
IEEE Computer Society, Washington, DC, 1981, 64-72.
<p>
Reprinted from <i>Proceedings of the ACM SIGPLAN/SIGOA Symposium