A memory circuit included in a computer system includes a memory array that stores multiple program instructions included in compressed program code. In response to receiving a fetch instruction from a processor circuit, the memory circuit may retrieve a particular instruction from the memory array. The memory circuit may, in response to a determination that the particular instruction is a particular type of instruction, retrieve additional program instructions from the memory array using an address included in the particular instruction, and send the particular program instruction and the additional program instructions to the processor circuit.

A foundation framework resource of a first service function is loaded in a software application. A service request for starting the first service function in the software application is received. A page resource required by the first service function is loaded. The first service function is implemented based on the foundation framework resource of the first service function and the page resource.

A type restriction contextually modifies an existing type descriptor. The type restriction is imposed on a data structure to restrict the values that are assumable by the data structure. The type restriction does not cancel or otherwise override the effect of the existing type descriptor on the data structure. Rather the type restriction may declare that a value of the data structure's type is forbidden for the data structure. Additionally or alternatively, the type restriction may declare that an element count allowable for a data structure's type is forbidden for the data structure. Type restriction allows optionality (where only a singleton value for a data structure is allowed), empty sets (where no value for a data structure is allowed), and multiplicity (where only a limited element count for a data structure) to be injected into a code set independent of data type. Type restriction allows certain optimizations to be performed.

A systems and method for reconfigurable and/or updatable lightweight electronic devices are disclosed for a computer system for facilitating financial transactions and reducing the opportunity for fraud. Via use of such a device, system, or method, various capabilities for a user are provided, simplified, secured, and/or made more convenient. The system may interact with various other devices or systems, including those that are cloud-based or communicate through the cloud, and may utilize various local sensors, in order to provide one or more of improved access, monitoring, user diagnostics, and so forth.

The present technology pertains to a link service that can create, maintain, and service links to objects on behalf of a content management system or other services. The link service can share administration of links with other services when desired or can even allow other services to issue the link and manage the object that is the subject of the link while providing other functions to support the link. Additionally, link service can interface with a file system that can support links as actors in the file system, whereby greater control and flexibility in supporting links is provided. Link service can also accommodate servicing and management of links issued by legacy services, where the legacy services have unique link logic that should still be utilized to maintain a consistent user experience.

There is provided a computer-implemented method for remote delegation of cryptographic processing from an application to other entities. The method including: structuring the cryptographic package with an application programming interface (API) as an engine of the cryptographic package and each provider including a dynamic-link library (dll) of an instance of the API; registering the API to a cryptographic library as a new crypto suite through the engine; implementing a control policy at a control entity to provide runtime input to the providers; receiving an API call from the application to implement a cryptographic action via the API, the API selecting the cryptographic scheme to implement the action.

The presentation of data models (a story) on a mobile device having limited memory and processing resources includes instantiating widgets one at a time for interaction with a user. When the user completes their interaction, the instance of that widget is removed from memory (destroyed); widgets are therefore stateless. A context framework that manages the application of filters to widgets that comprise the story. When a filter is applied, widget snapshot images used to display corresponding widgets in a collection view can be updated to reflect state changes of affected corresponding widgets so that users can see the state changes despite the widget being stateless.

A method can include storing first instruction data in a first region of a nonvolatile memory device; mapping addresses of the first region to predetermined memory address spaces of a processor device; executing the first instruction data from the first region with the processor device; receiving second instruction data for the processor device. While the first instruction data remains available to the processor device, the second instruction data can be written into a second region of the nonvolatile memory device. By operation of the processor device, addresses of the second region can be remapped to the predetermined memory address spaces of the processor device; and executing the second instruction data from the second region with the processor device.

Described techniques enable inter-environment communication, including isolating two runtime environments from one another as needed to ensure that operations of one runtime environment do not negatively affect operations of the other runtime environment during the inter-environment communication. Such isolation may be maintained when the two runtime environments use different addressing schemes, and when the two runtime environments use different call linkage techniques for identifying, locating, and passing stored parameters or other data.

In a method for dynamically binding data in an application, an expression describing a relation between a first property of a first data of the application to a first property of a second data of the application is received. A binding is created between the first data and the second data based on the relation. A change is propagated to the first property of the second data based on a change to the first property of the first data. The receiving the expression and the creating the binding are repeated to create a plurality of bindings based on a plurality of expressions, and the receiving the expression and the creating the binding occur dynamically during an execution of the application.