Abstract: A processor may load one or more potential updates to a trusted source from an identified trusted source. The processor may determine acceptable update windows. The processor may apply at least one of the one or more potential updates to the computing device. The processor may identify if a steady state has been reached. The processor may determine whether the at least one update has succeeded.

Abstract: An approach is disclosed that receives a code segment from a source code file. The received code segment is inputted to a trained knowledge manager from which one or more comparable code segments are received. Each of the comparable code segments are identified as having similar functionality as the selected code segment and each of the comparable code segments has a set of metadata. The metadata is used to select one of the comparable code segments and this selected code segment is used to replace the original code segment in the source code file.

Abstract: According to embodiments of the present disclosure, a method of debugging datacentric programming languages, a computer program product, and a computer system. The method may comprise receiving, by a processor, an expression to be evaluated against an input data structure; evaluating, by the processor, the expression to produce an output data structure, wherein the evaluating comprises automatically augmenting the input data structure with positional metadata; receiving a user selection of a data element from a datacentric programming element; and in response to the user selection, by the processor, using the positional metadata to display a providence of the selected data element.

Abstract: A computer-implemented method comprising obtaining a first part or representation of a code section as a code part, said code part comprising a first code characteristic, analyzing the code part to identify context information related to the code section, obtaining a first idiomatic modifier based on the first code characteristic and the context information, wherein the first idiomatic modifier in use transforms a first code statement of the code part such that the transformed first code statement corresponds to an idiomatic representation of the first code statement, and generating a modified code part by applying the first idiomatic modifier to the code part.

Abstract: Methods, systems and computer readable media are provided for automating software service analysis. One or more dictionaries are created, characterizing one or more software services available within the computing domain, wherein the one or more dictionaries each comprise at least an input category, a processing capability category, and an output category. A query input comprising a description of software service is received. Relevant portions are extracted using natural language processing of the query input that correspond to functions and associated parameters of the requested software services. The relevant portions of the query input are assigned to the one or more sub-categories in the dictionaries to generate mapped services. The sub-category assignments are processed to determine the mapping of the available software services within the computing domain.

Abstract: Source code of a golden version and a next version of a program is received in which procedure calls are modified to call from an entry point table (EPT) with index numbers corresponding to procedure memory addresses. An executable defect-free golden version program and next version program with a defect are received. A first entry point table (first EPT) for the new version program and a second EPT for the golden version program are generated. A series of substitutions of procedures from the second EPT to the first EPT is performed and an order of substitutions includes: a module set, a module of the module set, a procedure set of the module, and a procedure of the procedure set. The defect producing procedure is identified by substituting in order until the defect is absent and proceeding to the next substitution in order.

Abstract: An electronic device, such as a dynamic transaction card having a chip, an applet, and a cryptographic coprocessor performs secure firmware and/or software updates, and performs firmware and/or software validation for firmware and/or software that is stored on the electronic device. Validation may compare a calculated checksum with a checksum stored in the device. If a checksum calculated for a firmware and/or a software application matches a stored checksum, the transaction card may operate normally. If a checksum calculated for a firmware and/or a software application does not match the stored checksum, the transaction card may freeze all capabilities, erase the memory of the transaction card, display data indicative of fraud, and/or the like.

Abstract: Various systems and methods are provided for implementing a software defined industrial system. In an example, self-descriptive control applications and software modules are provided in the context of orchestratable distributed systems. The self-descriptive control applications may be executed by an orchestrator or like control device, configured to: identify available software modules adapted to perform functional operations in a control system environment; identify operational characteristics that identify characteristics of execution of the available software modules that are available to implement a control system application; select a software module for execution based on the operational configuration and the operational characteristics identified in the manifest; and cause the execution of the selected software module in the control system environment based on an application specification for the control system application.

Abstract: The present disclosure is directed to systems, media, and methods of generating test authorization for financial transactions. One or more computing devices generate an initial data set corresponding to a financial transaction. Alterations to one or more fields of information included in the initial data set are made responsive to instructions received via a user interface. Responsive to the alterations, the one or more computing devices: convert the test data set into a binary file, deserialize the binary file, and generate a transaction file for the financial transaction based on the deserialized test data set.

Abstract: Embodiments are disclosed for merging data structure definitions. The techniques include generating a first memory layout definition based on a first data structure definition that is written in a first programming language. The techniques further include generating a second memory layout definition based on a second data structure definition that is written in a second programming language. Additionally, the techniques include merging the first memory layout definition and the second memory layout definition into a merged memory layout definition. Further, the techniques include generating a merged data structure definition based on the merged memory layout definition.

Abstract: Systems and methods for managing a database back end as a service are described. In some aspects, the described systems and methods provide for a cloud-based resource for servicing a request for data from an application to a remote database and/or a service. In some aspects, the described systems and methods provide for a cloud-based application client for requesting data from a remote database and/or a service.

Abstract: Deployment of a modified service affects the functioning of other services that make use of the service. To address the problems that deployment of modified executable code can cause in other services, a dependency lock is placed on candidate code to prevent deployment until tests on the client services are successfully completed. Developers of client services that rely on a supplier service are enabled to place a dependency lock on the service. As a result, deployment of the supplier service is only allowed when tests of the client services complete successfully. The administrator of the service being deployed may control which other users are able to add dependency locks without giving those users other permissions such as the ability to modify the source code of the service, the ability to deploy the service, and the like.

Abstract: Systems and methods are described for verifying functionality of software. A set of code that is to be validated is identified. A first configuration is determined for the set of code that configures the code as a first build for validation. The first build is released for a first validation process. Prior to completion of validation of the first build, a second configuration is determined for the set of code that configures the code as a second build for validation. The second build is released for a second validation process prior to completion of validation of the first build. The first and second validation process are staged so that the first and second builds can be reverted independently of one another in the event of a validation issue. The first and second validation process are independently completed in the absence of a validation issue.

Abstract: Source code is analyzed to identify components. The components are each assigned a complexity score. Documentation for the source code is identified, related to the components, and given a score based on the quantity of the documentation for the component and the complexity score for the component. To determine semantic meaning of the documentation, vector embeddings for the documentation languages may be generated and aligned. Alignment causes the different machine learning models to generate similar vectors for semantically similar words in the different languages. Since the vectors of the words of the other languages are similar to the vectors of the words in a primary language with similar meanings, the vector representation of the documentation in the other languages will match the vector representation of the source code when the documentation is substantially on the same topic.

Abstract: Herein are machine learning (ML) feature processing and analytic techniques to detect anomalies in parse trees of logic statements, database queries, logic scripts, compilation units of general-purpose programing language, extensible markup language (XML), JavaScript object notation (JSON), and document object models (DOM). In an embodiment, a computer identifies an operational trace that contains multiple parse trees. Values of explicit features are generated from a single respective parse tree of the multiple parse trees of the operational trace. Values of implicit features are generated from more than one respective parse tree of the multiple parse trees of the operational trace. The explicit and implicit features are stored into a same feature vector. With the feature vector as input, an ML model detects whether or not the operational trace is anomalous, based on the explicit features of each parse tree of the operational trace and the implicit features of multiple parse trees of the operational trace.

Abstract: A method of customized setting at least one measurement device, comprises the steps of setting an intended measurement setup on the at least one measurement device manually via a user interface, recording, via a command recorder, at least one remote control command assigned to the manual setting of the intended measurement setup, converting the at least one remote control command recorded into specific instructions, and generating a standalone executable code at least based on the specific instructions obtained from the remote control command recorded. Further, a measurement system is provided.

Abstract: Provided are techniques for using relocatable debugging information entries to save compile time when there are changes to source code. While compiling source code, for an unchanged function, a copy is made of a relocatable debugging information entries table and of a relocation information table. In addition, for a changed function, a new relocatable debugging information entries table and a new relocation information table are generated. The copy of the relocatable debugging information entries table and the new relocatable debugging information entries table are merged. The copy of the relocation information table and the new relocation information table are merged. The relocatable debugging information entries in the merged relocatable debugging information entries table are resolved according to information in the merged relocation information table to generate relocated Debugging with Attributed Record Formats information, which is stored in an object file that corresponds to the source code.

Abstract: Embodiments provide a thread classification method that represents stack traces in a compact form using classification signatures. Some embodiments can receive a stack trace that includes a sequence of stack frames. Some embodiments may generate, based on the sequence of stack frames, a trace signature that represents the set. Some embodiments may receive one or more subsequent stack traces. For each of the one or more subsequent stack traces, some embodiments may determine whether a subsequent trace signature has been generated to represent the sequence of stack frames included within the subsequent stack trace. If not, some embodiments may generate, based on the trace signature and other subsequent trace signatures that were generated based on the trace signature, the subsequent trace signature to represent the subsequent sequence of stack frames.

Abstract: A system may include a computer processor and a repository configured to store a first code fragment including language features represented in a first programming language, and a second code fragment including language features represented in a second programming language. The system may further include a universal code fragment classifier, executing on the computer processor and configured to generate a first universal abstract syntax tree for the first code fragment and a second universal abstract syntax tree for the second code fragment, generate, using a graph embedding model, first vectors for the first universal abstract syntax tree and second vectors for the second universal abstract syntax tree, and classify, by executing an abstract syntax tree classifier on the first vectors and the second vectors, the first code fragment as a first code category and the second code fragment as a second code category.

Abstract: Aspects of the present invention disclose a method, computer program product, and system for performing testing on a portion of an application. The method includes one or more processors identifying a test configuration for testing an application. The application comprises a plurality of components. The test configuration includes an indication to test at least one component of the application. The method further includes one or more processors testing the indicated at least one component of the application. The method further includes one or more processors determining a validation result of testing the indicated at least one component of the application.