Abstract: A computing device and method for reducing memory usage in a runtime. The method is performed in a computer system having a non-volatile memory (ROM) containing initial states of objects for the runtime and volatile memory (RAM). An alias table in RAM is accessed corresponding with an object in ROM. If the there is an alias referenced in RAM, then computation is performed upon the alias rather than the object in ROM. Otherwise, if there is no alias then computation is performed upon the one in ROM. If the object is required to be updated, then it is stored as an alias referenced by the alias table stored in RAM.

Abstract: A computing device and automatic method for reducing memory usage in a device having an execution environment, such as one using an interpretive scripting engine. Application code is analyzed to determine unused features. Based upon this analysis, a build process is configured to omit the unused features. Then, the execution environment is built for the application code that excludes features not used by the application code. The application code and the execution environment can then be loaded into a deployment device for execution of the application code by the execution environment.

Abstract: A computing device and method for reducing memory usage in a runtime. The method is performed in a computer system having a non-volatile memory (ROM) containing initial states of objects for the runtime and volatile memory (RAM). An alias table in RAM is accessed corresponding with an object in ROM. If the there is an alias referenced in RAM, then computation is performed upon the alias rather than the object in ROM. Otherwise, if there is no alias then computation is performed upon the one in ROM. If the object is required to be updated, then it is stored as an alias referenced by the alias table stored in RAM.

Abstract: Systems and methods are provided for generating a user interface display on a graphical user interface. Native data is accessed from memory for generating a containment hierarchy, the native data describing features of the user interface display. The containment hierarchy is generated using the accessed native data, the containment hierarchy comprising a plurality of content records, where the containment hierarchy being stored in a system heap. The user interface display is generated by iterating through the plurality of content records of the containment hierarchy. One or more references to one or more content records of the plurality of content records of the containment hierarchy are removed, where the one or more references indicate that the corresponding one or more content records are in use, such that the one or more content records can be reclaimed by garbage collection.

Abstract: Systems and methods are for segregating data and code implemented in a dynamic language, where the segregated data and code operate in an environment, where the environment and the segregated data and code are controlled using a common dynamic language. The environment is implemented in the common dynamic language, the environment including a framework, the framework including a plurality of properties. A visible framework property is identified that is visible to applications. An invisible framework property is identified that is not visible to the applications. A first application is implemented in a first sandbox within the environment, wherein the first application is implemented in the common dynamic language, wherein the first application is unable to access the invisible framework property, and wherein the first application is able to access the visible framework property.

Abstract: Systems and methods are provided for debugging applications. A non-transitory machine-readable storage medium is configured to store code. A processor operative to execute the code is coupled to the non-transitory machine-readable storage medium. The code includes a debugger configured to: establish a first connection with a first virtual machine, where the first virtual machine is configured to initiate the first connection with the debugger; receive, from the first virtual machine, a first set of data via the first connection established between the debugger and the first virtual machine, where the first set of data includes data associated with a first application running on the first virtual machine, and where the first virtual machine is further configured to transmit the first set of data to the debugger when the first application breaks, and display, on a graphical user interface (GUI), at least a portion of the first set of data.

Abstract: A method for detecting an error in reading a data, includes in a step a) storing a first copy of the data item in a first area of an electronic memory and storing of a second copy of the data item in a second area. Step b) includes reading values of the first and second copies of the data item and in step c) there is a comparison of the read values of the first and second copies of the data item. In step d) if the read values of the first and second copies are identical, then no error is detected. In step e) if the read values of the first and second copies are different, then the method includes repeating steps b) and c). In step f), if the values read in step e) are identical, then an error in the reading of the data item is detected and, otherwise, no error is detected.

Abstract: This method in which an attempt to attack a security processor is detected by the security processor itself comprises: measurements (50) of several different events occurring independently of one another in the absence of attack attempts, :building (52) the value of at least one attack indicator as a function of at least one index of concomitance between at least two different events measured, the index of concomitance representing the temporal proximity between the two different events measured, and detecting (54) an attack attempt if the value of the attack indicator crosses a predetermined threshold.

Abstract: The present disclosure describes techniques and apparatuses for a customizable lighting controller. In some aspects a lighting controller is described that includes a display device to display selectable lighting functions, switches that each correspond to one of the selectable lighting functions, and a lighting controller manager to receive an input of a selectable lighting function at one of the switches of the lighting controller. The lighting controller manager can then initiate a display of the selected lighting level on the display device of the lighting controller. The lighting controller manager can also control a dimming module to set the selected lighting level.

Abstract: There is disclosed a method for detecting an error in the reading of a data item, this method includes a)storing a first copy of the data item in a first area of an electronic memory and storing of a second copy of the data item in a second area of an electronic memory. In Step b there is also included a Reading of the values of the first and second copies of the data item in the first and second areas respectively, In step c)here is a comparison of the read values of the first and second copies of the data item if the read values of the first and second copies are different, then the preceding steps b) and c) are repeated (78, 80), then f) if the values read in the step e) are identical, then an error in the reading of this data item is detected (82) and, otherwise, no error in the reading of this data item is detected.

Abstract: This method for renewing the code of an algorithm comprises: receiving (122) a randomly drawn seed whose size in terms of number of bits, is at least four times smaller than the number of bits needed to encode the N numerical constants of the cryptographic algorithm, expanding (128) the seed deterministically to obtain a sequence of numbers whose size, in number of bits, is at least equal to the number of bits needed to encode the N numerical constants of the cryptographic algorithm, generating (132) N new numerical constants from the sequence of numbers obtained, and replacing (134) the N constants of the code of the cryptographic algorithm by the N new constants generated to obtain the code of a renewed cryptographic algorithm.

Abstract: This method in which an attempt to attack a security processor is detected by the security processor itself comprises: measurements (50) of several different events occurring independently of one another in the absence of attack attempts, building (52) the value of at least one attack indicator as a function of at least one index of concomitance between at least two different events measured, the index of concomitance representing the temporal proximity between the two different events measured, and detecting (54) an attack attempt if the value of the attack indicator crosses a predetermined threshold.

Abstract: This method for renewing the code of an algorithm comprises: receiving (122) a randomly drawn seed whose size in terms of number of bits, is at least four times smaller than the number of bits needed to encode the N numerical constants of the cryptographic algorithm, expanding (128) the seed deterministically to obtain a sequence of numbers whose size, in number of bits, is at least equal to the number of bits needed to encode the N numerical constants of the cryptographic algorithm, generating (132) N new numerical constants from the sequence of numbers obtained, and replacing (134) the N constants of the code of the cryptographic algorithm by the N new constants generated to obtain the code of a renewed cryptographic algorithm.