Aleksandr A Kuzmin

US Patent:

6983455, Jan 3, 2006

Filed:

Apr 10, 2002

Appl. No.:

10/120823

Inventors:

Aleksandr M. Kuzmin - Santa Clara CA, US

Assignee:

Sun Microsystems, Inc. - Palo Alto CA

International Classification:

G06F 9/44

US Classification:

717130, 717131, 717132, 717133

Abstract:

A set of computer code is profiled by breaking each code segment of the computer code down into basic instructions. Thereafter, the set of computer code is executed. As each code segment is executed, a log is updated to indicate execution of that code segment. This is done for each executed code segment; thus, at the end of execution, the log reflects all of the code segments that were executed, and how many times each code segment was executed. Using the log, and a set of calibration statistics, which specify how much processing time is consumed by each basic instruction, an overall execution cost is derived for each executed code segment. The set of overall execution costs for all of the executed code segments are incorporated into an overall profile for the set of computer code.

US Patent:

7039902, May 2, 2006

Filed:

Jun 6, 2002

Appl. No.:

10/164820

Inventors:

Aleksandr M. Kuzmin - Santa Clara CA, US
Igor V. Kaloshin - Saint-Petersburg, RU

Assignee:

Sun Microsystems, Inc. - Palo Alto CA

International Classification:

G06F 9/44

US Classification:

717126, 717127

Abstract:

A mechanism is disclosed for enabling efficient testing of a set of computer code. Untested code portions within a body of code are determined, and testing priorities are assigned to untested code portions according to how frequently the untested code portions are likely to be invoked during normal operation. More frequently invoked untested code portions are ranked higher than less frequently invoked untested code portions. The prioritized data may be used by a testing team to determine which additional tests should be created for effective and efficient testing of the body of code.

US Patent:

7043720, May 9, 2006

Filed:

Apr 22, 2002

Appl. No.:

10/128162

Inventors:

Aleksandr M. Kuzmin - Santa Clara CA, US

Assignee:

Sun Microsystems, Inc. - Palo Alto CA

International Classification:

G06F 9/44

US Classification:

717137, 717136, 717141

Abstract:

A mechanism for reformatting a simple source code statement into a compound source code statement is provided. Tokens are identified in unformatted source code, which contains simple statements. A syntax tree is created from the identified tokens. The syntax tree is used to identify one or more simple statements. In processing a particular simple statement, potential statements are identified in the particular simple statement. A tree of blocks, which identifies block levels, is created from the potential statements. An intermediate textual representation is created where each of the potential statements is on a different line. Indentation levels, which correspond to the block levels in the tree of blocks, are associated with each of the potential statements. Formatted source code is created by inserting begin and end block indicators into the intermediate textual representation.

US Patent:

7080358, Jul 18, 2006

Filed:

Apr 10, 2002

Appl. No.:

10/120866

Inventors:

Aleksandr M. Kuzmin - Santa Clara CA, US

Assignee:

Sun Microsystems, Inc. - Palo Alto CA

International Classification:

G06F 9/44

US Classification:

717127

Abstract:

An improved mechanism is provided for generating an execution log and coverage data for a set of computer code. To minimize the amount of storage required for storing execution log information, the mechanism: (1) stores only information pertaining to instructions that are actually executed during execution; and (2) stores the information in a hierarchically organized set of lists. In addition, to minimize the impact of execution log and coverage data generation on the execution of the computer code, coverage data is generated after execution has completed. By generating the execution log and coverage data in this manner, storage requirements are reduced, and execution performance is improved.

US Patent:

20030204531, Oct 30, 2003

Filed:

Apr 26, 2002

Appl. No.:

10/133011

Inventors:

Aleksandr Kuzmin - Santa Clara CA, US

International Classification:

G06F017/30

US Classification:

707/200000

Abstract:

A mechanism is disclosed for migrating a file sequence from a first workspace managed by a first workspace management system into a second workspace managed by a second workspace management system. To carry out the file sequence migration, the mechanism does not implement a format conversion process. Instead, the mechanism invokes and exploits the functionality provided by the workspace management systems. By avoiding the format conversion process, the mechanism is able to carry out the migration process much more easily and cost effectively.

US Patent:

20130152043, Jun 13, 2013

Filed:

Dec 12, 2011

Appl. No.:

13/323745

Inventors:

Aleksandr Kuzmin - Santa Clara CA, US

Assignee:

Zynga Inc. - San Francisco CA

International Classification:

G06F 9/44

US Classification:

717110

Abstract:

Systems and methods for generating test information from a source code are described. One of the methods includes accessing the source code. The method further includes receiving a modification of the source code to generate a modified source code. The modification includes one or more instructions that do not affect functions performed by executing the source code. The modification further includes one or more instructions for generating test information regarding each executable line of the source code.

US Patent:

20150193333, Jul 9, 2015

Filed:

Mar 19, 2015

Appl. No.:

14/663321

Inventors:

- San Francisco CA, US
Aleksandr Kuzmin - Santa Clara CA, US

International Classification:

G06F 11/36

Abstract:

Systems and methods for generating test information from a source code are described. One of the methods includes accessing the source code. The method further includes receiving a modification of the source code to generate a modified source code. The modification includes one or more instructions that do not affect functions performed by executing the source code. The modification further includes one or more instructions for generating test information regarding each executable line of the source code.