Abstract: A method of data augmentation includes receiving, by a processor, a set of data including a plurality of variables, mapping each variable to one or more target concepts associated with a name of each variable, and acquiring a set of semantic transforms, each semantic transform including a function applied to one or more concepts mapped to a respective variable. The method also includes comparing the one or more target concepts to the one or more concepts of each semantic transform, selecting at least one semantic transform based on the comparing, generating an expression for each selected semantic transform, each expression configured to apply a function of a selected semantic transform to at least one of the plurality of variables, and augmenting the set of data for use in an application by adding each expression to the set of data.

Abstract: A computer-implemented method, system and computer program product for effectively handling mock objects written in the form of multiple assignment instructions. A program to test software is instrumented so as to obtain an instrumented program having one or more mock objects. The instrumented program is parsed to identify one or more multiple assignment instructions each corresponding to a mock object. A function is then inserted in the instrumented program for each of the identified multiple assignment instructions corresponding to a mock object, where the function returns a tuple of the first “n” elements of the mock object. The instrumented program (after inserting the function(s) discussed above) is outputted to perform software testing, such as dynamic program analysis. In this manner, by inserting such function(s) in the instrumented program, the mock objects will be able to be executed without causing a failure.

Abstract: The embodiment may include a computing device that identifies a software code. The embodiment may determine an attribute access and a method call. The embodiment may inject instrumentation code to the software code to capture the attribute access and the method call. The embodiment may convert an attribute into a value using a conversion method based on determining, during an execution of the software code, that the attribute access failed. The embodiment may create a mock object and uses the mock object as a result of the method call to continue execution of the software code based on determining, during the execution of the software code, that the method call failed.

Abstract: An example operation may include one or more of modifying content of a data file from an initial content state to a modified content state, determining a relationship value which identifies a relationship of the modified content state with respect to the initial content state of the data file, signing the relationship value with a private key of a data modifier, and transmitting the signed relationship value to a blockchain peer node for inclusion within one or more data blocks among a hash-linked chain of data blocks.

Abstract: A system for program synthesis using annotations based on enumeration patterns includes a memory device for storing program code, and at least one processor device operatively coupled to the memory device. The at least one processor device is configured to execute program code stored on the memory device to obtain a set of annotated terms including one or more terms each annotated with an enumeration pattern, translate problem text into a formal specification using natural language processing, the formal specification being described as a set of rules associated with predicates, and synthesize one or more terms satisfying the set of rules of the formal specification based on the set of annotated terms to generate a computer program.

Abstract: A computer-implemented method according to one embodiment includes identifying a data set and meta information; and augmenting the data set with additional features in response to an automatic analysis of the data set in view of the meta information.

Abstract: Methods and systems for text processing include building a knowledge base using column names and associated functions from a code base. Classifiers are trained using the knowledge base and are cross-validated to determine accuracy scores. Text is processed using a selected classifier having a highest accuracy score from the classifiers to determine date/time features.

Abstract: An example operation may include one or more of receiving a resource request from a client, identifying a unique chaincode identifier associated with the resource request, re-instantiating a version of chaincode based on the unique chaincode identifier, the re-instantiation configured to disregard any subsequently implemented versions of the chaincode at the computing node, executing the resource request based on the re-instantiated version of the chaincode to generate a result, and transmitting the result to the client.

Abstract: An example operation may include one or more of receiving a resource request from a client, identifying a unique chaincode identifier associated with the resource request, re-instantiating a version of chaincode based on the unique chaincode identifier, the re-instantiation configured to disregard any subsequently implemented versions of the chaincode at the computing node, executing the resource request based on the re-instantiated version of the chaincode to generate a result, and transmitting the result to the client.

Abstract: A technique for processing a target program is disclosed. In the technique, execution of a target program handling a data structure object is initiated. In the technique, a synthetic data structure object is created by using a mixed data object instead of handling the data structure object in a manner instructed originally in the target program. The mixed data object includes a first data object and a second data object and is configured to redirect a method call to the second data object in response to the first data object being unable to handle the method call.

Abstract: Smart contract code is verified by storing smart contract code, identifying a type system for verifying a determinism of the smart contract code based on a first set of security-level values and a second set of security level values, and verifying the determinism of the smart contract code by taking the first set of security-level values as deterministic values and the second set of security level values as non-deterministic values.

Abstract: A technique for processing a target program is disclosed. In the technique, execution of a target program handling a data structure object is initiated. In the technique, a synthetic data structure object is created by using a mixed data object instead of handling the data structure object in a manner instructed originally in the target program. The mixed data object includes a first data object and a second data object and is configured to redirect a method call to the second data object in response to the first data object being unable to handle the method call.

Abstract: An example operation may include one or more of receiving, at a data provider, a data file from a data modifier which comprises a modification to an initial content state of a data file, generating a hash value of the initial content state of the data file prior to modification and generating a hash value of a modified content state of the data file after the modification, and transmitting the generated hash values to a blockchain peer node for inclusion within one or more data blocks among a hash-linked chain of data blocks.

Abstract: A method is provided for creating a directed graph. The method obtains an execution trace having a sequence of invocations of table transformations. Each invocation is classified as a call-with-object invocation or call-with-column invocation. The call-with-object invocation indicates that an invoked function has object IDs as at least one of input and output information. The call-with-column invocation indicates that the invoked function has column names as the at least one of input and output information. The method processes the trace to build the graph. Each node indicates an object or a column and each edge indicates data flow. The method performs, in response to all invocations being processed, an automated graph reduction process by eliminating given nodes indicating a respective object such that that every two nodes that connect with each other, via a respective one of the given nodes as an intermediate node, can keep the connection therebetween.

Abstract: An example operation may include one or more of recording, by a snapshot node, a plurality of snapshots of a key-value storage based on a plurality of delta offsets from an initial snapshot of the key-value storage, receiving, by the snapshot node, an audit request from an audit node that contains an audit time, generating, by the snapshot node, a current snapshot based on an aggregation of the snapshots from the plurality of the snapshots up to a time of a transaction closest to the audit time, and executing, by the snapshot node, a chaincode based on a delta offset of the current snapshot from the time of the transaction to the audit time to restore a snapshot at the audit time.

Abstract: An example operation may include one or more of receiving a uniform resource indicator (URI) of a blockchain peer node that has access to a blockchain distributed among a plurality of blockchain peer nodes, identifying blockchain channel identification information which identifies a unique channel name associated with the blockchain, generating a blockchain-based URI that includes an identification of the URI of the blockchain peer node and the channel name associated with the blockchain, and storing the generated blockchain-based URI on a distributed ledger.

Abstract: An example operation may include one or more of receiving, at a data provider, a data file from a data modifier which comprises a modification to an initial content state of a data file, generating a hash value of the initial content state of the data file prior to modification and generating a hash value of a modified content state of the data file after the modification, and transmitting the generated hash values to a blockchain peer node for inclusion within one or more data blocks among a hash-linked chain of data blocks.

Abstract: An example operation may include one or more of receiving a uniform resource indicator (URI) of a blockchain peer node that has access to a blockchain distributed among a plurality of blockchain peer nodes, identifying blockchain channel identification information which identifies a unique channel name associated with the blockchain, generating a blockchain-based URI that includes an identification of the URI of the blockchain peer node and the channel name associated with the blockchain, and storing the generated blockchain-based URI on a distributed ledger.

Abstract: A method is provided for creating a directed graph. The method obtains an execution trace having a sequence of invocations of table transformations. Each invocation is classified as a call-with-object invocation or call-with-column invocation. The call-with-object invocation indicates that an invoked function has object IDs as at least one of input and output information. The call-with-column invocation indicates that the invoked function has column names as the at least one of input and output information. The method processes the trace to build the graph. Each node indicates an object or a column and each edge indicates data flow. The method performs, in response to all invocations being processed, an automated graph reduction process by eliminating given nodes indicating a respective object such that that every two nodes that connect with each other, via a respective one of the given nodes as an intermediate node, can keep the connection therebetween.

Abstract: An example operation may include one or more of receiving a unique identifier of a blockchain system resource from among a plurality of blockchain system resources associated with a blockchain, generating a notification board for the blockchain which is implemented independently from the blockchain and stored on a distributed ledger including the blockchain, and storing the unique identifier of the blockchain resource and a blockchain ID within the notification board on the distributed ledger.