Abstract: A multitenant custodial wallet that provides users with a flexible primitive for managing discrete sets of cryptographic keys to interact with one or more blockchain protocols. By recognizing a pool primitive (e.g., pool object), a wallet can manage a set of keys as a single pool, in addition to managing keys individually.

Abstract: A cryptocurrency management device configurable to communicate with a security system base station is described. The cryptocurrency management device comprises processing circuitry configured to receive a personal identification number (PIN) from the security system base station; provide access to a cryptocurrency wallet based on the PIN; and perform a cryptocurrency transaction associated with the cryptocurrency wallet subsequent to providing access to the cryptocurrency wallet.

Abstract: A method of managing tasks during agile software development includes detecting selection of a level in a project hierarchy. In response to said selection of the level, a table is displayed listing a plurality of assets associated with the level and showing tasks associated with respective assets of the plurality of assets. The table indicates a status of each task. A user action to update the status of a particular task is detected; in response, display of the particular task is updated to indicate an updated status of the particular task. Selection of one or more filter criteria is detected; in response, display of the table is updated based on the one or more filter criteria.

Abstract: A method for automatically analyzing formulas and adding pattern annotations to quantifiers based on a database of common pattern idioms. The method involves matching base pattern inference for Satisfiability Modulo Theories (SMT) solvers. The method uses a database for fault detection in externally supplied pattern annotated formulas. The method also uses matching code trees to mixed second-order pattern matching.

Abstract: A computer implemented method and apparatus display an information integration flow graph, receive user input selecting a modification to apply to the displayed information integration flow graph and modify the information integration flow graph based on the selected modification to form a modified information integration flow graph, wherein the modified information integration flow graph is displayed.

Abstract: Systems and methods for forecasting reusable software assets are described. In one embodiment, the method comprises receiving a forecast comprising forecast information pertaining to at least one forecasted software asset. Further, the method comprises mapping the forecast to a domain map based on the forecast information, wherein the domain map includes a plurality of domain constituents. Based in part on the mapping, a development request for creation of the at least one forecasted software asset is generated.

Abstract: A distributed code including a plurality of programs is created based on a sequential code that includes at least one call of a first function associated with a future, where at least a first of the plurality of programs is to execute the first function associated with the future, and at least a second of the plurality of programs is to execute a second function in a present section of the sequential code. A normalization function is included in each of the plurality of programs to normalize virtual addresses accessed by the first and second functions.

Abstract: The disclosed embodiments provide a system that facilitates the development and maintenance of a software program. This system includes a software development kit (SDK) and a runtime system for the software program. During operation, the system obtains a role associated with a dependency of a consumer in the software program on an interface. Next, the system obtains a compatibility policy for the interface. Finally, the system uses the role and the compatibility policy to manage use of the interface by the consumer in the software program.

Abstract: A computer-implemented method, system, and computer program product for performing object collocation on a computer system are provided. The method includes analyzing a sequence of computer instructions for object allocations and uses of the allocated objects. The method further includes creating an allocation interference graph of object allocation nodes with edges indicating pairs of allocations to be omitted from collocation. The method also includes coloring the allocation interference graph such that adjacent nodes are assigned different colors, and creating an object allocation at a program point prior to allocations of a selected color from the allocation interference graph. The method additionally includes storing an address associated with the created object allocation in a collocation pointer, and replacing a use of each allocation of the selected color with a use of the collocation pointer to collocate multiple objects.

Abstract: A communication device includes: a receiving unit that receives metainformation indicating an update from an update information providing device to provide information related to the update; a determining unit that determines, on the basis of the received metainformation, whether an update needed for the communication device exists; a notifying unit that notifies, when the update exists, a user of existence of the update; an operation unit that receives, when the update exists, a selection operation as to whether the update is to be executed from the user; and an update processing unit that executes, when the selection operation to execute the update is received by the operation unit, the update on the basis of the received metainformation.

Abstract: A method for executing an executable file. The method includes executing instructions in the executable file by a first process, receiving a write request from a second process to write to the executable file, generating an anonymous file from the executable file in response to the write request, executing the anonymous file by the first process, and accessing the executable file by the second process.

Abstract: A method and information processing system facilitate debugging of a multi-threaded application. A control program request associated with at least one thread of a process that has been designated for debugging is generated. The control program request is placed into a memory buffer associated with the thread by the debugger. The memory buffer is passed to a control program. A plurality of memory buffers is monitored. Each memory buffer in the plurality of memory buffers is associated with a different thread of the process. At least one memory buffer in the plurality of memory buffers is determined to include debugging event information from the control program determining. The debugging event information is processed. The processing includes at least one of notifying a user of the debugging event information and generating at least one control program request for a thread associated with the at least one memory buffer.

Abstract: Described is a technology by which a signature used by network traffic intrusion prevention/detection systems includes logic that helps a prevention/detection engine detect that signature. A signature to detect is compiled into executable logic that is executed to communicate with an engine that evaluates network traffic. The signature logic provides an expression set (such as group of regular expressions) for the engine to match against a token corresponding to the network traffic. When matched, the engine notifies the logic and receives a further expression set to match, or a communication indicative that that the signature was detected. The signature thus directs the analysis, facilitating a lightweight, generic engine. Safety of the signature logic is described as being accomplished through layers, including by publisher signing, and by compilation and execution (e.g., interpretation) in safe environments.

Abstract: Approaches for replacing software components executing in a runtime environment with corresponding known-good software components are disclosed. In some implementations, at least a first event indicating that at least a first software component executing in the runtime environment should be replaced may be determined. The first event may be determined without respect to whether the first software component has been compromised or potentially compromised. At least a second software component corresponding to the first software component may be obtained from a component repository that is separate from the runtime environment. The first software component may be replaced with the second software component based on the first event such that the second software component is available for use in the runtime environment after the first event and the first software component is no longer available for use in the runtime environment after the first event.

Abstract: A compiler method for exploiting data value locality for computation reuse. When a code region having single entry and exit points and in which a potential computation reuse opportunity exists is identified during runtime, a helper thread is created separate from the master thread. One of the helper thread and master thread performs a computation specified in the code region, and the other of the helper thread and master thread looks up a value of the computation previously executed and stored in a lookup table. If the value of the computation previously executed is located in the lookup table, the other thread retrieves the value from the table, and ignores the computation performed by the thread. If the value of the computation is not located, the other thread obtains a result of the computation performed by the thread and stores the result in the lookup table for future computation reuse.

Abstract: A system in which firmware residing in ROM may be upgraded without re-spinning silicon. A one-bit flag may be assigned for each patchable function representing a firmware upgrade. The first statement of each function may check its associated flag and determine if patch-code should be executed in place of the current function residing in ROM. If the flag is not set, the code may continue executing normally. If the flag is set, a function identifier may be placed into a global memory location, and an assembly language “jump” instruction may be executed, redirecting program control to a specified location in a volatile Scratch Read Only Memory (SROM) where the corresponding patched code may be stored. If more than one function is patched, the global identifier may be used to determine which patched function to execute. Using an assembly language “jump” instruction to redirect control results in the patched function's returning normally to its calling function once it has completed executing.

Abstract: Systems and methods of generating a highly random bit are provided. Two nearly uncoupled clocks are utilized to generate a near-random bit. Even/Odd sampling at a variable rate is provided to condition many near-random bits to yield a single bit with a value of one or zero 50% of the time.

Abstract: Embodiments of the present application relate to a code coverage rate determination method, a code coverage rate determination system, and a computer program product for determining code coverage rate. A code coverage rate determination method is provided. The method includes retrieving source code of a program, determining theoretical number of log file output points included in the source code and location information of the log file output points, retrieving log files actually outputted during the execution of the program, determining an actual number of log file output points of the actual outputted log files based on the location information of the corresponding log file output points recorded in each log file, and determining a code coverage rate of the program based on the theoretical number of log file output points and the actual number of the log file output points of the actual outputted log files.

Abstract: A software application development tool provides context-based data schema code hinting. Code “regions” are defined in the code for an application that is under development. One or more data sources that are referenced by a code region may be defined. The development tool detects when a designer is attempting to reference a data schema, such as by detecting that the designer has input a specified trigger, within a region of the code, and in response, the development tool provides code hints for the data schema for corresponding data source(s) that is/are referenced in the corresponding code region in which the designer is working. Thus, rather than providing data schema code hinting for all data sources referenced by the application, targeted code hinting is employed by presenting data schema code hints for only the data source(s) that are referenced by a defined code region in which the designer is working.

Abstract: Metrics associated with computer code files within a codebase may be analyzed to identify bug-prone files. Functions of the method or system may determine metrics corresponding to each file of a plurality of codebase files within an application codebase. The functions may also store the metrics corresponding to each codebase file in a record of a database table, rank order the plurality of codebase files according to at least one metric, and flag each codebase file having a ranking over a threshold value of the metric. The codebase file metrics may describe fault-inducing characteristics of the plurality of codebase files and include both a total number of previous faults and a total number of changes that are associated with each codebase file.