Shmuel (Mooly) Sagiv

Visitor
Computer Sciences Department
University of Wisconsin-Madison
1210 West Dayton Street
Madison, WI 53706-1685
USA

E-mail: sagiv@cs.wisc.edu
Telephone: (608) 265-6013
Secretary: (608) 262-0017
Department: (608) 262-1204
Fax: (608) 262-9777

Permanent Address
IBM Israel Scientific Center
MATAM, 31905 Haifa, Israel
Telephone: +972-429-6211

Ph.D., Technion, Israel, 1991 (Curriculum Vitae)

Research Interests:

• Language-based programming environments
• Interprocedural dataflow analysis
• Program Slicing
• Pointer Analysis
• Abstract interpretation
• Porting Source Code

Recent Publications

Journal Publications

• Sagiv, M., Reps, T., and Horwitz, S. Precise interprocedural dataflow analysis with applications to constant propagation. TCS, to appear
• Sagiv, M., Francez, S., Rodeh, M., and Wilhelm, R. A Logic Based Approach to Program Flow Analysis ACTA Informatica, to appear
• Makowsky, J., Gregoire J., Sagiv, M. The Expressive Power of Side Effects in Prolog J. Logic Programming 1992:12

Conference Publications

Sagiv, M., Reps, T., and Wilhelm, R., Solving shape-analysis problems in languages with destructive updating. To appear in Conference Record of the Twenty-Third ACM Symposium on Principles of Programming Languages, (St. Petersburg, FL, Jan. 22-24, 1996), ACM, New York, NY, 1996. popl96.ps
• Horwitz, S., Reps, T., and Sagiv, M., Demand interprocedural dataflow analysis. In SIGSOFT '95: Proceedings of the Third ACM SIGSOFT Symposium on the Foundations of Software Engineering, (Washington, DC, October 10-13, 1995), ACM SIGSOFT Software Engineering Notes 20, 4 (1995), pp. 104-115. fse95a.ps
• Sagiv, M., Reps, T., and Horwitz, S. Precise interprocedural dataflow analysis with applications to constant propagation. Proceedings of FASE '95: Colloquium on Formal Approaches in Software Engineering, (Aarhus, Denmark, May 22-26, 1995), Lecture Notes in Computer Science, M.I. Schwartzbach (ed.), Springer-Verlag, New York, NY, 1995. fase95.ps

• Reps, T., Horwitz, S., and Sagiv, M. Precise interprocedural dataflow analysis via graph reachability. To appear in Conference Record of the Twenty-Second ACM Symposium on Principles of Programming Languages, (San Francisco, CA, Jan. 23-25, 1995). popl95.ps

• Reps, T., Horwitz, S., Sagiv, M., and Rosay, G. Speeding up slicing. In SIGSOFT 94: Proceedings of the Second ACM SIGSOFT Symposium on the Foundations of Software Engineering, (New Orleans, LA, December 7-9, 1994), ACM SIGSOFT Software Engineering Notes 19, 5 (December 1994), pp. 11-20. fse94.ps

• Bernstein, D. Rodeh M., and Sagiv, M., Proving Safety of Speculative Instructions at Compile Time LNCS 582, 4th European Symposium on Programming 1992

Technical Reports

• Sagiv, M., Reps, T., and Horwitz, S., Precise interprocedural dataflow analysis with applications to constant propagation. TR-1284, Computer Sciences Department, University of Wisconsin, Madison, WI, August 1995. (Click here to access paper.)

  To appear in TCS.

• Horwitz, S., Reps, T., and Sagiv, M., Demand interprocedural dataflow analysis. TR-1283, Computer Sciences Department, University of Wisconsin, Madison, WI, August 1995. (Click here to access paper.)

  Submitted for journal publication.

• Sagiv, M., Reps, T. and Wilhelm, R., Solving shape-analysis problems in languages with destructive updating. TR-1276, Computer Sciences Department, University of Wisconsin-Madison, July 1995. tr1276.ps

• Reps, T., Sagiv, M., and Horwitz S., Interprocedural dataflow analysis via graph reachability. TR 94-14, Datalogisk Institut, University of Copenhagen, Copenhagen, Denmark, April 1994. diku-tr94-14.ps
• Nelson, L., Ricard, R., and Sagiv, M. Walleye: A Tool for PL/MP Migration: Technical Issues TR 88-343 IBM Israel Science and Technology,