International Business Machines Corporation

Michael George Burke

Igor Peshansky

Jong-Deok Choi

Stephen Andrew Brodsky

Sonali Surange

Mukund Raghavachari

Rebecca Braun Nin

Azadeh Ahadian

Paul Robert Carini

Omer Tripp

Marco Pistoia

Oded Shmueli

Rajesh Ramkrishna Bordawekar

Tony Leung

Zeus Orion Courtois

Vugranam Chakravarthy Sreedhar

Peter Francis Sweeney

Michael James Hind

Harini Srinivasan

Ronald G Cytron

Rosalva E Gallardo Valencia

Theodore Cheuk-Tak Law

A computer-readable medium is disclosed that tangibly embodies a program of machine-readable instructions executable by a digital processing apparatus to perform operations including determining whether data to be released from a database is associated with one or more confidential mappings between sets of data in the database. The operations also include, in response to the data being associated with the one or more confidential mappings, determining whether release of the data meets one or more predetermined anonymity requirements of an anonymity policy. Methods and apparatus are also disclosed.

Enforcement of data privacy to maintain obfuscation of certain data

The disclosed technology enables assistance to software developers by identifying the software application code that needs to be changed or behaves differently, as a consequence of a database schema change. The disclosed technology also enables a provision of automatic transformations, or at least hints for the transformation of the code, to accommodate the database schema change.

Computation of impacted and affected code due to database schema changes

A technique is disclosed for identifying impact of database changes on an application. Given a proposed database change, affected source code is identified that is affected by the proposed database change. References to the affected source code are created and organized into a hierarchy. A user can ascertain the extent of the impact by viewing the hierarchy and by using the hierarchy to access and view the affected source code in a visually distinct manner.

Identifying impact of database changes on an application

Embodiments of the invention provide techniques for displaying and refactoring of programs, including database statements. In one embodiment, database statements embedded in the program source are evaluated to identify statements of the source code affected by, or affecting, the changed element of the database. An indication of the statements of source code affected by or affecting the changed element of the database may be presented to a user.

Displaying and refactoring programs that include database statements

A system (and method) of detecting an error in a database interaction, includes providing information about at least one of at least first and second software systems, and a mapping between at least a portion of the at least first and second software systems, and examining the at least one of the first and second software systems and the mapping to determine an error in an interaction between the at least first and second software systems.

Method and system for detection of integrity constraint violations

A system (and method) of detecting an error in a database interaction, includes providing information about at least one of at least first and second software systems, and a mapping between at least a portion of said at least first and second software systems; and examining said at least one of said first and second software systems and said mapping to determine an error in an interaction between said at least first and second software systems.

Detecting an integrity constraint violation in a database by analyzing database schema, application and mapping and inserting a check into the database and application

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.

Interprocedural analysis and optimization of an object oriented program in the presence of dynamic class loading

Alternatives for laying out objects and/or virtual function tables (VFTs), sharing a virtual function table pointer with a direct, virtual base, eliminating the need for an early cast by increasing the number of virtual function table entries, and providing a smart virtual dispatch that eliminates late casts where possible. An object model can be constructed by choosing one option from each of several alternatives. Interaction of alternatives include (1) sharing VFT pointers with a direct, virtual base requires that virtual base pointers are not stored in objects and (2) sharing VFT pointers affects the sharing of virtual base pointers with base classes and placement of late cast adjustment arguments and determining virtual function table entries.

C++ ojbect model alternatives

A computer implemented method performs flow-sensitive interprocedural data flow analysis without iteration for a class of interprocedural problems. The accuracy of the solution can approach the iterative result without the compile time cost. For interprocedural constant propagation (ICP), this method is more effective than existing methods and costs about the same compilation time. For flow-sensitive ICP over a program call graph (PCG), the method supports recursion while only performing one flow-sensitive analysis of each routine. If the PCG has cycles, a flow-insensitive solution is precomputed for constant propagation. During the flow-sensitive computation, the flow-insensitive result is used for a back edge. This permits a flow-sensitive solution to be obtained in one forward traversal of the PCG. This method can also be used to compute returned constants with one reverse traversal of the PCG. For flow-sensitive USE over a program call graph (PCG), the method supports recursion while only performing one flow-sensitive analysis of each routine. If the PCG has cycles, a flow-insensitive solution for a reference set (REF) is precomputed. During the flow-sensitive USE computation, the flow-insensitive REF solution is used for a back edge. This permits a flow-sensitive USE solution to be obtained in one reverse traversal of the PCG.

Interprocedural data-flow analysis that supports recursion while only

The invention provides a method for improving the precision of interprocedural alias analysis by efficiently qualifying (naming) dynamically allocated storage locations with call path information and identifying as identical qualified name pairs, one of which is a prefix substring of another. The invention also provides a compact method for representing alias information which improves the efficiency and in some cases, the precision, of alias analysis, by eliminating alias relations that involve more than one level of dereferencing and by eliminating all alias relations that do not contain at least one dereferenced object.

Methods for distinguishing dynamically allocated storage along different

By novel use of the Program Call Graph representation of computer programs, this method and apparatus provides a general analysis method for interprocedural bidirection data flow problems in computer software programs. The invention has many uses, including the determination of interprocedural alias analysis of computer software programs which contain pointers. The method starts by constructing a Program Call Graph representation of a computer program with each node of the graph representing a routine of the program. An internal representation of each node is then constructed and initial interprocedural values are associated with appropriate nodes. An interprocedural traversal of the Program Call Graph is performed in which each node is visited; an intraprocedural propagation is performed to develop a new set of interim solution values; and the new interim solution values are interprocedurally propagated. The new interim solution is propagated in a forward and backward direction in one pass of the traversal. The interprocedural traversal of the Program Call Graph is repeated until the interprocedural solution does not change.

Using program call graphs to determine the maximum fixed point solution

The present invention provides a system and method for optimizing or parallelizing computer code typically represented by a source program. The source program is represented by a control flow graph. The present invention includes an optimizer for constructing a compact data flow representation from the control flow graph and a mechanism for evaluating the compact data flow representation in relation to a data flow framework in order to determine a solution to a particular data flow problem. The present invention represents data flow chains compactly, obtaining some of the advantages of Static Single Assignment (SSA) form without modification of program text (i.e., renaming). In addition, the present invention represents compactly certain data flow chains which SSA form fails to represent (i.e. def-def, use-def, and use-use chains). The data flow representation of the present invention combines information only once in the graph, information is forwarded directly to where it is needed, and useless information is not represented.

Growing community of inventors

Yonkers, NY, United States of America

Michael George Burke