📄 http:^^www.cs.arizona.edu^people^debray^
字号:
Date: Thu, 21 Nov 1996 19:52:38 GMTServer: NCSA/1.5Content-type: text/htmlLast-modified: Mon, 18 Nov 1996 23:56:20 GMTContent-length: 6516<head><title> Saumya Debray's Home Page</title></head><body><a name="topofpg"><hr><h1> Saumya K. Debray </h1><a name="bio"><p><center><!WA0><img src="http://www.cs.arizona.edu/people/debray/debray.gif" ALT="Saumya K. Debray" align=left> </center><p><br><br><br><PRE> <!WA1><a href=#bio> Short Biography </a> <!WA2><a href=#contactinfo> Contact Information </a> <!WA3><a href=#interests> Research Interests </a> <!WA4><a href=#pubs> Recent Publications </a> <!WA5><a href=#teaching> Teaching </a> <!WA6><a href=#schedule> My Schedule </a></PRE><br><br><br><br><br><br><hr>Saumya received a B.Tech. (Hons.) degree in electronics and electrical communications engineering, from the Indian Instituteof Technology, Kharagpur, in 1981; and M.S. and Ph.D. degreesin computer science, from the State University of New York atStony Brook, in 1983 and 1986 respectively. He has been at theDepartment of Computer Science at The University of Arizona since1986, where he is currently an Associate Professor.He has been involved in the development ofa number of implementations of logic programming systems, including SB-Prologand Janus, as well as the Caslog cost analysis system for Prolog.More recently, he has been working on the <TT>alto</tt> link-timeoptimizer.<p> Saumya is an Associate Editor of the <!WA7><a href="http://www.cs.princeton.edu/~appel/toplas/index.html"><i>ACM Transactions on Programming Languages and Systems</i> (TOPLAS)</a>and an Area Editor for the <!WA8><a href="http://www.cs.arizona.edu/people/debray/jlp.html"> Technical Notes Area</a> of <!WA9><a href= "http://www.clip.dia.fi.upm.es/~herme/jlp/jlp.html"<i>Journal of Logic Programming</i> </a>.He was Program co-Chair for the 1990 North American Conference on Logic Programming, and has served on program committees for the POPL, PLDI, and ILPS conferences.<hr><a name="contactinfo"><h2> Contact Information: </h2><address>Phone: (+1) 520-621-4527 <br> Fax: (+1) 520-621-4246 <br>E-Mail: <!WA10><a href="mailto:debray@cs.arizona.edu">debray@cs.arizona.edu</a></address><hr><a name="interests"><h2> Research Interests </h2><ul><li> Link-time code optimization </li><li> partial evaluation (in particular, machine-aware code specialization)<li> complexity issues in compile-time analysis<li> compilation and implementation issues for declarative programming languages, in particular logic programming languages</ul><a name="pubs"><h2> Recent Papers </h2><ul><li><!WA11><a href="http://www.cs.arizona.edu/people/debray/papers/rbpa.ps"> Resource-Bounded Partial Evaluation</a>.Technical Report 96-19, Nov. 1996.<li><!WA12><a href="http://www.cs.arizona.edu/people/debray/papers/fpma.ps"> On the Complexity of Function PointerMay-Alias Analysis</a>, with Robert Muth. Technical Report 96-18, October 1996.<li><!WA13><a href="http://www.cs.arizona.edu/people/debray/papers/filter.ps"> <tt>APF</tt>: A Modular Language for Fast Packet Classification</a>, with H. D. Lambright. Draft, Aug. 1996.<li><!WA14><a href="http://www.cs.arizona.edu/people/debray/papers/alto.ps"> <tt>alto</tt>: A Link-Time Optimizer for the DEC Alpha</a>, with Koen De Bosschere. Draft, July 1996.<li><!WA15><a href="http://www.cs.arizona.edu/people/debray/papers/cfa.ps"> Inter-procedural Control Flow Analysis of First Order Programs with Tail Call Optimization</a>, with Todd Proebsting. Draft, May 1996.<li><!WA16><a href="http://www.cs.arizona.edu/people/debray/papers/retval_placement.ps"> Return Value Placement and Tail Call Optimization in High Level Languages</a>, with Peter Bigot. (A preliminary version of this paper appeared in <i>Proc. 11th International Conference on Logic Programming</i>, June 1994.)<li><!WA17><a href="http://www.cs.arizona.edu/people/debray/papers/unboxopt.ps"> A Simple Approach to Supporting Untagged Objects in Dynamically Typed Languages</a>, with Peter Bigot. <i>Journal of Logic Programming</i>, to appear. (A preliminary version of this paper appeared in <i>Proc. 1995 International Symposium on Logic Programming</i>.)<li><!WA18><a href="http://www.cs.arizona.edu/people/debray/papers/susp_analysis.ps"> Detection and Optimization of Suspension-Free Logic Programs</a>, with David Gudeman and Peter Bigot. <i>Journal of Logic Programming</i> (Special Issue on High Performance Implementations), vol. 29 nos. 1-3, Nov. 1996, pp. 171-194.<li><!WA19><a href="http://www.cs.arizona.edu/people/debray/papers/pepm95.ps"> Abstract Interpretation and Low Level Code Optimization</a>, <i>Proc. 1995 ACM Symposium on Partial Evaluation and Semantics-Based Program Manipulation.</i><li><!WA20><a href="http://www.cs.arizona.edu/people/debray/papers/complexity.ps"> On the Complexity of Dataflow Analysis of Logic Programs</a>, <i>ACM Transactions on Programming Languages and Systems</i> vol. 17 no. 2, March 1995, pp. 331-365.<li><!WA21><a href="http://www.cs.arizona.edu/people/debray/papers/cfwd.ps">Call Forwarding: A Simple Interprocedural Optimization Technique forDynamically Typed Languages</a>,with K. De Bosschere, D. Gudeman, and S. Kannan.<i> Proc. 1994 ACM Symposium on Principles of Programming Languages.</i><li><!WA22><a href="http://www.cs.arizona.edu/people/debray/papers/cost_analysis.ps">Cost Analysis of Logic Programs</a>,<i>ACM Transactions on Programming Languagesand Systems</i> vol. 15 no. 5, Nov. 1993, pp. 826-875.<br><br><br><li> Lecture notes from a course on <!WA23><a href="http://www.cs.arizona.edu/people/debray/crs95.html"> Analysis and Optimization of Logic Programs </a> </ul><a name="teaching"><h2> Teaching </h2><ul><li> Fall 1996: <!WA24><a href="http://www.cs.arizona.edu/classes/cs520"> CSc 520: Principles of Programming Languages </a></ul><a name="schedule"><h2> My Schedule: Fall 1996: </h2> </a><center><table align=center border cellpadding=7><td rowspan=3><strong>Mon</strong> <td>11:00-11:50<td> Teaching (CSc 520)<tr> <td>1:00-2:00 <td> Office Hours <tr> <td>2:00-3:00 <td> Research Meeting (A. Kågedal)<tr><td rowspan=5><strong>Tue</strong> <td> 9:30-11:00<td>Theory Seminar<tr> <td> 11:00-12:00<td>Research Meeting (R. Muth)<tr> <td> 12:00-1:00 <td>Lunch with research group<tr> <td> 2:00-3:00 <td>Research Meeting (B.-M. Tong)<tr> <td> 3:30-5:00<td>Colloquium <tr><td rowspan=2><strong>Wed</strong> <td>11:00-11:50<td> Teaching (CSc 520)<tr> <td>1:00-2:00 <td> Office Hours <tr><td rowspan=1><strong>Thu</strong> <td> 3:30-5:00<td>Colloquium <tr><td rowspan=4><strong>Fri</strong> <td>11:00-11:50<td> Teaching (CSc 520)<tr> <td>12:00-1:00 <td> Faculty Lunch (alternate weeks)<tr> <td>1:00-2:00 <td> Office Hours <tr> <td>3:00-4:00 <td> Computing Committee meeting<tr></table></center><br><hr><h2> Other Interesting Pages </h2><ul><li> <!WA25><a href="http://www.desert.net/tw/twhome.htm"> The Tucson Weekly </a> <li> <!WA26><a href="http://www.desert.net/tw/bot/index.htm"> The Best of Tucson</a><li> <!WA27><a href="http://desert.net/htbin/tucsontemp"> Tucson's temperature</a><li> <!WA28><a href="http://www.speedtrap.com/speedtrap/arizona.html"> Speed traps</a></ul><PRE>[ <!WA29><a href=#topofpg>Top of Page</a> ]</PRE></body>⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -