Austin, TX, United States of America

John McEnerney

This inventor holds 2 USPTO granted patents. Top assignee: Bea Systems, Inc.. Active years: 2008-2009.

IDiyas Innovation Intelligence. (2026). Inventor Profile: John McEnerney. Retrieved from https://idiyas.com/inventor/john-mcenerney

Data source: USPTO (United States Patent and Trademark Office) public patent records. Weekly synchronization. How IDiyas builds this profile


% Patents Active = 100.0

Average Co-Inventor Count = 2.0

ph-index = 1

Forward Citations = 1(Granted Patents)


Company Filing History:


Years Active: 2008-2009

Loading Chart...
2 patents (USPTO):Explore Patents

Title: Innovations of John McEnerney

Introduction

John McEnerney is an accomplished inventor based in Austin, TX (US). He has made significant contributions to the field of software program compilation through his innovative patents. With a total of 2 patents, McEnerney's work focuses on enhancing the efficiency and performance of state machines used in scanners and parsers.

Latest Patents

One of McEnerney's latest patents is titled "System and method for generating state machines." This invention generates state machines that can be utilized in scanners and parsers for software program compilation. Unlike traditional table-driven state machines, McEnerney's approach encodes state machines directly by creating jumps and branches in bytecodes. This method results in state machines that are not only faster but also smaller in code size compared to those implemented in executable codes. Additionally, these state machines can be optimized to meet strict code size restrictions specified by certain virtual machines, such as the Java virtual machine.

Another notable patent is "System and method for generating multi-way branches." This invention also employs state machines in scanners and parsers for program compilation. The state machines are encoded directly in bytecodes, and a special algorithm is used to generate multi-way branches associated with states in a state machine. This algorithm ensures that the bytecodes are compact and run faster than unoptimized versions. The process involves constructing subarrays, determining optimal branch implementations for each subarray, and ultimately achieving an optimal implementation for the entire target array.

Career Highlights

John McEnerney is currently employed at Bea Systems, Inc., where he continues to innovate and contribute to advancements in software technology. His work has had a significant impact on the efficiency of program compilation processes.

Collaborations

McEnerney collaborates with Kevin Zatloukal, a fellow professional in the field, to further enhance their innovative projects.

Conclusion

John McEnerney's contributions to the field of software program compilation through his patents demonstrate his commitment to innovation and efficiency. His work continues to influence the development of state machines, making them faster and more compact for various applications.

Profile summary based on public USPTO records.
Data Sources: USPTO Patent Grant XML, Patent Center, EPO & CIPO • Normalized by IDiyas Innovation Graph. Methodology & provenance architecturePlease report any incorrect information to [email protected]
Loading…