Search

Vugranam C Sreedhar

from Yorktown Heights, NY
Age ~61

Vugranam Sreedhar Phones & Addresses

  • 1758 Baldwin Rd, Yorktown Heights, NY 10598 (914) 962-2739
  • Yorktown Hts, NY
  • 125 Lake St, West Harrison, NY 10604
  • White Plains, NY
  • Cupertino, CA
  • Westchester, NY
  • Yorktown Hts, NY

Work

Company: Ibm Apr 2020 Position: Security and compliance lead

Education

Degree: Doctorates, Doctor of Philosophy School / High School: Mcgill University 1990 to 1995 Specialities: Computer Science, Philosophy

Skills

Security • Data Mining • Software Development • Java • Data Analysis • Python • Computer Science • Machine Learning • C++ • C • Program Management • Analytics • Strategy • Analysis • Leadership • Identity Management • Data Warehousing • R • Statistics • Compliance • Product Management • Team Building • Problem Solving • Strategic Planning • Risk Management

Industries

Information Technology And Services

Resumes

Resumes

Vugranam Sreedhar Photo 1

Security And Compliance Lead

View page
Location:
Yorktown Heights, NY
Industry:
Information Technology And Services
Work:
Ibm
Security and Compliance Lead

Mercy College 2007 - 2014
Adjunct Faculty

Hewlett-Packard 1995 - 1998
Member of Technical Staff
Education:
Mcgill University 1990 - 1995
Doctorates, Doctor of Philosophy, Computer Science, Philosophy
Indian Institute of Technology, Bombay 1985 - 1987
Masters
Skills:
Security
Data Mining
Software Development
Java
Data Analysis
Python
Computer Science
Machine Learning
C++
C
Program Management
Analytics
Strategy
Analysis
Leadership
Identity Management
Data Warehousing
R
Statistics
Compliance
Product Management
Team Building
Problem Solving
Strategic Planning
Risk Management

Publications

Us Patents

Interprocedural Analysis And Optimization Of An Object Oriented Program In The Presence Of Dynamic Class Loading

View page
US Patent:
6865730, Mar 8, 2005
Filed:
May 26, 2000
Appl. No.:
09/579357
Inventors:
Michael G. Burke - Yonkers NY, US
Vugranam C. Sreedhar - White Plains NY, US
Assignee:
International Business Machines Corporation - Armonk NY
International Classification:
G08F009/44
US Classification:
717116, 717151, 717152, 717153, 717154, 717155, 717156, 717157, 709315
Abstract:
A method is provided for analyzing an object oriented program that supports dynamic class loading. A set A of classes in the program is identified, wherein each class within set A is capable of, during execution of the program, causing the loading of a class outside of set A. A first set of method calls belonging to the classes in set A are identified that, during execution of the program, are capable of calling only methods belonging to a class within set A. A second set of method calls belonging to the classes in set A are identified that, during execution of the program, are capable of calling methods belonging to a class outside set A. Data that identifies the first and the second set of method calls is stored for subsequent use.

Minimizing Interaction Costs Among Components Of Computer Programs

View page
US Patent:
7360205, Apr 15, 2008
Filed:
Feb 11, 2002
Appl. No.:
10/073628
Inventors:
Douglas N. Kimelman - Hawthorne NY, US
Tova Roth - Woodmere NY, US
Vugranam C. Sreedhar - White Plains NY, US
Mark N. Wegman - Ossining NY, US
Assignee:
International Business Machines Corporation - Armonk NY
International Classification:
G06F 9/44
G01D 3/00
US Classification:
717130, 717141, 717151, 717153, 702108, 700 5
Abstract:
A system and method for minimizing total cost of interaction among components of a computer program which are each characterized by at least one implementation property. A implementation property may, for example, be a choice of string representation (e. g. ASCII, UNICODE, EBCDIC or choice of data structure (e. g. hash, tree, compressed). The method comprises the steps of: carrying out a run of the program; monitoring that run to measure an amount of interaction between each pair of components; determining a cost of interaction between each pair of interacting components; determining a choice of implementation properties which minimizes total cost of the run; and assigning choices of implementation properties to said components for a future run of the program.

Program Components Having Multiple Selectable Implementations

View page
US Patent:
7392515, Jun 24, 2008
Filed:
Feb 11, 2002
Appl. No.:
10/073630
Inventors:
Douglas N. Kimelman - Hawthorne NY, US
Tova Roth - Woodmere NY, US
Vugranam C. Sreedhar - White Plains NY, US
Mark N. Wegman - Ossining NY, US
Assignee:
International Business Machines Corporation - Armonk NY
International Classification:
G06F 9/44
G06F 9/45
US Classification:
717158, 717127, 717131, 717151
Abstract:
Libraries and individual program components are provided with a common interface and a number of alternative implementations (e. g. hash table, tree, compressed) which can be selected. The component is instrumented to measure a cost of each of its alternative implementations, both independent of and in the context of the interaction of that component with other components of the computer program. Based on measured cost, the desired implementation is chosen for the component by an external controller that is generic to the computer program or by an application program that interfaces with the library or component.

Computer System Program And Method To Characterize Each Of A Plurality Of Objects Used At Runtime To Determine A Lowest Cost Property Among A Plurality Of Potential Alternative Properties For Each Of Said Objects Minimizing Total Cost Of Interaction Among Components During Program Execution

View page
US Patent:
7730001, Jun 1, 2010
Filed:
Feb 11, 2002
Appl. No.:
10/073608
Inventors:
Douglas N. Kimelman - Hawthorne NY, US
Tova Roth - Woodmere NY, US
Vugranam C. Sreedhar - White Plains NY, US
Mark N. Wegman - Ossinging NY, US
Assignee:
International Business Machines Corporation - Armonk NY
International Classification:
G06F 15/18
G06F 9/44
G06F 9/445
G06F 9/45
G06F 9/50
G05B 13/00
US Classification:
706 13, 700 28, 717106
Abstract:
A method is provided for characterizing objects generated during an initial run of a program, each object being characterized by a number of alternative properties which can be chosen. The method includes steps of instrumenting an initial run of program to determine characterization information about each of objects, then determining a desirable property for each object, then determining a correlation between the desirable property and the characterization information for each of the objects. This correlation is then used to select a property for an object that is subsequently created during a run of the program based only upon characterization information about the subsequently created object.

System And Method For Role Based Analysis And Access Control

View page
US Patent:
7933925, Apr 26, 2011
Filed:
Jun 1, 2006
Appl. No.:
11/446104
Inventors:
Vugranam Chakravarthy Sreedhar - Yorktown Heights NY, US
Assignee:
International Business Machines Corporation - Armonk NY
International Classification:
G06F 7/00
US Classification:
707786, 707797
Abstract:
A system and method for program access control includes, for a typestate, providing typestate properties and assigning a role to the typestate in a program in accordance with the typestate properties. Access to operations is limited for the typestate in the program based on the role assigned to the typestate and an access permission level.

Minimizing Interaction Costs Among Components Of Computer Programs

View page
US Patent:
8108841, Jan 31, 2012
Filed:
Feb 25, 2008
Appl. No.:
12/037080
Inventors:
Douglas Neil Kimelman - Winnipeg, CA
Tova Roth - Woodmere NY, US
Vugranam C. Sreedhar - White Plains NY, US
Mark N. Wegman - Ossining NY, US
Assignee:
International Business Machines Corporation - Armonk NY
International Classification:
G06F 9/44
US Classification:
717130, 717141, 717151
Abstract:
A method for minimizing total cost of interaction among components of a computer program, each of the components being characterized by at least one implementation property includes steps of: a) carrying out at least a partial run of the program; b) monitoring the at least partial run of the program to measure an amount of interaction between each pair of components; c) determining a cost of interaction between each pair of interacting components; d) determining a choice of implementation properties which minimizes total cost of the at least partial run; and e) assigning that choice of implementation properties to the components for a subsequent at least partial run of the program.

Method And Apparatus For Programming Software Components

View page
US Patent:
8171454, May 1, 2012
Filed:
Aug 9, 2001
Appl. No.:
09/925580
Inventors:
Vugranam C. Sreedhar - White Plains NY, US
Assignee:
International Business Machines Corporation - Armonk NY
International Classification:
G06F 9/44
US Classification:
717116
Abstract:
A method and apparatus are disclosed for programming software components that treats software components as the basic unit of abstraction and computation. A software component is encapsulated and classes and other program entities, such as data fields and methods, within a given component do not exist beyond a component boundary. A component interacts with other components only by means of a defined set of input and output ports. A component can inherit and implement ports declared in a template and can declare and implement new ports. A component can only access the external environment through its output ports. An output port of one component can only be connected to a conforming input port of another component. A connect statement is an explicit plumbing operation for connecting components together. Interactions between components are loosely coupled.

Procedure Summaries For Pointer Analysis

View page
US Patent:
8185881, May 22, 2012
Filed:
Jun 19, 2007
Appl. No.:
11/765396
Inventors:
Daniel Brand - Millwood NY, US
Marcio Buss - Croton NY, US
Vugranam C Sreedhar - Yorktown Heights NY, US
Assignee:
International Business Machines Corporation - Armonk NY
International Classification:
G06F 9/44
US Classification:
717132, 700 98, 52646, 717131, 717141, 717143, 717154
Abstract:
Pointer analysis is used for different applications, e. g. , compilers, debugging tools and programs understanding tools, each having different requirements. A framework for pointer analysis is provided that defines a multidimensional space, for example a three-dimensional space, containing an order sensitivity dimension, a predicate sensitivity dimension and a value persistence dimension. A point in the three-dimensional space is identified. This point yields values for order sensitivity, predicate sensitivity and value persistence. Pointer analysis is then conducted on a computer program in accordance with the identified values for order sensitivity, predicate sensitivity and value persistence.
Vugranam C Sreedhar from Yorktown Heights, NY, age ~61 Get Report