Abstract: Methods and apparatus for enhanced encapsulation of global data or variables of an operation system program (e.g., a real-time operating system (RTOS) program). In one exemplary embodiment, apparatus may encapsulate a plurality of program global data into a single type-definition for subsequent instantiation of the single type-definition as a single global variable for use global data accesses. Unlike traditional techniques where each global variable is distinct and instantiated individually, the various aspects of the present disclosure are directed to improved global variable management, performance and corruption detection by, inter alia, guaranteeing placement of global variables in the same order they are defined. Moreover, various aspects of the present disclosure are directed to enhancements with respect to verification and technical support.

Abstract: Method and apparatus for providing enhanced detection of data corruption in computer programs (e.g., real-time operating systems (RTOS) and application programs). In one exemplary embodiment, such detection is effected via use of a low-complexity verification code algorithm, which can be implemented in as little as four (4) assembly instructions. This low overhead approach advantageously makes the data corruption detection feasible in real-time and/or resource constrained devices. Additionally, the data corruption detection verification code of the present disclosure can be used as a verification fingerprint for any important data, such as that in RTOS-based applications relating to, e.g., (i) function pointers, (ii) function return addresses, (iii) stack and/or buffer corruption, and (iv) linked-list and general pointer corruption.

Abstract: A method to facilitate memory allocation includes examining an executable program file configured to be executed by a processor to identify a group of functions present within the executable program file, and calculating memory requirements for each function of the group of functions. Further operations include identifying a plurality of root functions as functions which are not referred to by other functions, creating a function call tree for each of the plurality of root functions, such that each of the function call trees comprise functions which are directly or indirectly referred to by an associated one of the plurality of root functions, and calculating memory requirements for one or more function call paths of each of the function call trees based upon the calculated memory requirements of the functions included within the one or more function call paths.