Chad N Hinkle

age ~38

from Bellevue, WA

Get Report

Connected to:

Chad Hinkle Phones & Addresses

Method And Apparatus For Enhancing Comprehension Of Code Time Complexity And Flow
view source
US Patent:

20110191760, Aug 4, 2011
Filed:

Aug 31, 2010
Appl. No.:

12/872200
Inventors:

Nathaniel Guy - Seattle WA, US
Chad Hinkle - Redmond WA, US
Mark Jawad - Redmond WA, US
Steve Rabin - Bothell WA, US
International Classification:

G06F 9/45
US Classification:

717155
Abstract:

A method and apparatus that utilizes techniques for formatting assembly and/or machine code, including using arrows, indentations and textual symbols, so that a programmer who reads the code has an enhanced understanding of the program flow. Different methods of assessing computing time complexity (e.g., the up branch method and the strongly connected subgraph method) have strengths and weaknesses but benefit from being used together.

Method And Apparatus For Visualizing Computer Program Execution
view source
US Patent:

20120222017, Aug 30, 2012
Filed:

May 5, 2011
Appl. No.:

13/101449
Inventors:

Chad Hinkle - Redmond WA, US
Steven Rabin - Bothell WA, US
International Classification:

G06F 9/44
US Classification:

717130
Abstract:

Analysis data from the execution of a computer program is collected. The analysis data may include samples of two different types of performance data from the execution of the computer program. Performance data may include sampled hardware performance counter data and sampled executing functions. The performance data is used to create a composite view of the data. The composite view may allow a user to efficiently correlate the different types of performance data by using a colored visual display.

Methods And/Or Systems For Determining A Series Of Return Callstacks
view source
US Patent:

20130042223, Feb 14, 2013
Filed:

Aug 10, 2011
Appl. No.:

13/206597
Inventors:

Chad HINKLE - Redmond WA, US
Assignee:

NINTENDO COMPANY LTD. - Kyoto
International Classification:

G06F 9/44
US Classification:

717128, 717100, 717131
Abstract:

To reconstruct a call stack, a range of call addresses is determined. Based on the range of addresses, raw stack data is extracted based on the execution of a computer program. The raw stack data is parsed to reconstruct a call stack (or a series of call stacks). In obtaining the call stack, a depth between a function and a return address is calculated.

System And Method To Infer Call Stacks From Minimal Sampled Profile Data
view source
US Patent:

20160314063, Oct 27, 2016
Filed:

Apr 21, 2015
Appl. No.:

14/692173
Inventors:

- Kyoto, JP
Chad HINKLE - Redmond WA, US
International Classification:

G06F 11/36
G06N 5/04
Abstract:

Methods and systems for inferring call stacks in a program, such as a video game or simulation program, are described herein. The call stack data can be inferred using a database of previously captured call stacks along with a minimal set of identifiers that fingerprint each call stack. If just the minimal fingerprint can be captured during a subsequent profile, then the corresponding call stack can be inferred.