摘要:
Embodiments of the invention provide techniques for displaying and refactoring of programs including databases 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.
摘要:
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.
摘要:
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.
摘要:
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.
摘要:
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.
摘要:
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.
摘要:
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.