Seminar by Dr. R. K. Bera
An Algorithm for Determining the Equivalence of Two Blocks of Assignment Statements
Dr. R. K. Bera
IBM India Software Labs
Bangalore
Date: Tue, Feb 8, 2005
Time: 4:00 PM
Venue: CS-101
Abstract
A method is described which enables one to determine, at the source code level, if two given blocks of assignment statements are equivalent or not. The method therefore serves as a powerful pattern recognition algorithm for use in optimizing compilers. This is a part of the speaker's on-going research activity.
About the Speaker
Dr. Rajendra Bera heads the R&D group of IBM Software Labs, India. He has been with IBM since 1995. Earlier he was a research scientist with the National Aerospace Laboratories (1971-1995); a visiting assistant professor of aerospace, mechanical, and nuclear engineering, University of Oklahoma, USA (1979-1980); and a visiting faculty of aerospace engineering at the Indian Institute of Technology, Kanpur (1988). Dr. Bera received his BTech, MTech, and PhD in aerospace engineering from the Indian Institute of Technology, Kanpur, India. He is a member of the New York Academy of Sciences, and a Fellow of The Institution of Engineers (India). He is listed in Marquis Who's Who in the World, and Marquis Who's Who in Finance and Industry. He has over 30 publications in refereed journals. He also holds seven patents, and has fourteen patent applications which are pending. His patenting activities have been in the areas of compiler optimization, resource allocation, pattern recognition, and static analysis of computer codes. His current research interests include pattern recognition in molecular biology, quantum computing, and autonomic computing. Many years ago he was an amateur pilot. Since the last four years Dr. Bera has been extensively lecturing in the IBM Software Labs in a unique program to create a research culture among his colleagues.