Abstract: Systems and methods for tracking data lineage and record lifecycle using a distributed ledger are disclosed. In one embodiment, a method for tracking record lifecycle events may include: (1) creating, by a record lifecycle tool, a recordable artifact for a record lifecycle event in a record lifecycle, the recordable artifact comprising data for the record lifecycle event; (2) generating, by the record lifecycle tool, a hash of the data; (3) creating, by the record lifecycle tool, record lifecycle event metadata for the recordable artifact; (4) signing, by the record lifecycle tool, the record lifecycle event metadata; (5) writing the record lifecycle event metadata to supply chain metadata storage at a storage location, wherein the supply chain metadata storage may be cryptographically verifiable and immutable; and (6) writing the hash and an identifier for the storage location in the supply chain metadata store to a present state database.

Abstract: Example aspects include techniques for improved constraint discovery on relational data. These techniques may include constructing a first layer of a lattice using a first plurality of candidate denial constraints (DC) each having a first number of predicates. In addition, the techniques may include performing a tree-based verification process on the first layer of the lattice to determine one or more verified DCs confirmed to be DCs and a plurality of unverified DCs that are not confirmed to be DCs. Further, the techniques may include presenting, via a graphical user interface (GUI), DC information based on the one or more verified DC, and generating, for construction of a second layer of the lattice to be evaluated via the tree-based verification process, a second plurality of candidate DCs by combining the plurality of unverified DCs.

Abstract: Systems and methods for tracking data lineage and record lifecycle using a distributed ledger are disclosed. In one embodiment, a method for tracking record lifecycle events may include: (1) creating, by a record lifecycle tool, a recordable artifact for a record lifecycle event in a record lifecycle, the recordable artifact comprising data for the record lifecycle event; (2) generating, by the record lifecycle tool, a hash of the data; (3) creating, by the record lifecycle tool, record lifecycle event metadata for the recordable artifact; (4) signing, by the record lifecycle tool, the record lifecycle event metadata; (5) writing the record lifecycle event metadata to supply chain metadata storage at a storage location, wherein the supply chain metadata storage may be cryptographically verifiable and immutable; and (6) writing the hash and an identifier for the storage location in the supply chain metadata store to a present state database.

Abstract: Edit automation functionality generalizes edits performed by a user in a document, locates similar text, and recommends or applies transforms while staying within a current workflow. Source code edits such as refactoring are automated. The functionality uses or provides anchor target lists, temporal edit patterns, edit graphs, automatable edit sequence libraries, and other data structures and computational techniques for identifying locations appropriate for particular edits, for getting transforms, for selecting optimal transforms, for leveraging transforms in an editing session or later, and for displaying transform recommendations and results. The edit automation functionality enhances automation subtool generation, discoverability, and flexibility, for refactoring, snippet insertion, quick actions in an integrated development environment, and other automatable edit sequences.

Abstract: Embodiments use a multi-modal approach to generate software programs that match a solution program description. The solution program description may include natural language, input-output examples, partial source code, desired operators, or other hints. Some embodiments use optimized prompts to a pre-trained language model to obtain initial candidate programs. Maximal program components are extracted and then recombined variously using component-based synthesis. Beam search reduces a solution program search space by discarding some candidates from a given synthesis iteration. Relevance metrics, string similarity metrics, operator frequency distributions, token rareness scores, and other optimizations may be employed. By virtue of optimizations and the multi-modal approach, a solution program may be obtained after fewer iterations than by use of a language model alone.

Abstract: Edit automation functionality generalizes edits performed by a user in a document, locates similar text, and recommends or applies transforms while staying within a current workflow. Source code edits such as refactoring are automated. The functionality uses or provides anchor target lists, temporal edit patterns, edit graphs, automatable edit sequence libraries, and other data structures and computational techniques for identifying locations appropriate for particular edits, for getting transforms, for selecting optimal transforms, for leveraging transforms in an editing session or later, and for displaying transform recommendations and results. The edit automation functionality enhances automation subtool generation, discoverability, and flexibility, for refactoring, snippet insertion, quick actions in an integrated development environment, and other automatable edit sequences.

Abstract: A method for facilitating identification of secrets in source code by using machine learning is provided. The method includes retrieving a plurality of files from a repository, each of the plurality of files including a source code file; parsing the source code file to identify a training feature; associating a predetermined label with the training feature, the predetermined label corresponding to a secret label and a non-secret label; training a model by using the training feature and the corresponding predetermined label; receiving, via a graphical user interface, a test file, the test file including a set of source codes; parsing the set of source codes to identify a feature; and determining, by using the model, a first characteristic of the feature.

Abstract: Techniques are described herein that are capable of creating a language-agnostic computer program repair engine generator. A context-free grammar is annotated to identify token(s) that are likely to be included in or excluded from a computer program in a manner that violates the context-free grammar. A language-agnostic computer program repair engine generator is created that is configured to generate a parser. The repair engine generator is configured to create a repair engine that: converts the candidate string into repaired strings that neither violate the context-free grammar nor violate a criterion for a valid computer program; calculates differences between the candidate string and the respective repaired strings; and replaces the candidate string with a designated repaired string based at least in part on the difference between the designated repaired string and the candidate string being less than or equal to a difference threshold.

Abstract: Techniques are described herein that are capable of synthesizing a computer program to include idiomatic function(s) and semantically-meaningful variable(s) using programming by example. For instance, an intent of a user to synthesize a computer program to include functionality configured to generate sample output(s) from respective input(s) is determined based at least in part on receipt of the sample input(s) and the respective sample output(s) from the user. Based at least in part on the determined intent, the computer program is synthesized to include the idiomatic function(s) by configuring the idiomatic function(s) to have the target functionality and to conform to a convention of the target domain-specific language associated with a textual representation of the computer program to be displayed to the user. Non-semantically-meaningful variable(s) included among the idiomatic function(s) are replaced with the respective semantically-meaningful variable(s).

Abstract: Pasting content from a clipboard buffer as structured tabular data. A computer system determines a data type of content within a clipboard buffer. Based on the data type of the content, the computer system identifies a tabular pattern analysis technique to apply to the content. Based on applying the tabular pattern analysis technique to the content, the computer system identifies a portion of tabular content within the content. Using a clipboard application programming interface, the computer system presents the portion of tabular content to an application as paste data that is structured as a set of rows and a set of columns.

Abstract: Embodiments use a multi-modal approach to generate software programs that match a solution program description. The solution program description may include natural language, input-output examples, partial source code, desired operators, or other hints. Some embodiments use optimized prompts to a pre-trained language model to obtain initial candidate programs. Maximal program components are extracted and then recombined variously using component-based synthesis. Beam search reduces a solution program search space by discarding some candidates from a given synthesis iteration. Relevance metrics, string similarity metrics, operator frequency distributions, token rareness scores, and other optimizations may be employed. By virtue of optimizations and the multi-modal approach, a solution program may be obtained after fewer iterations than by use of a language model alone.

Abstract: In general, the disclosure describes techniques for facilitating trust in neural networks using a trusted neural network system. For example, described herein are multi-headed, trusted neural network systems that can be trained to satisfy one or more constraints as part of the training process, where such constraints may take the form of one or more logical rules and cause the objective function of at least one the heads of the trusted neural network system to steer, during machine learning model training, the overall objective function for the system toward an optimal solution that satisfies the constraints. The constraints may be non-temporal, temporal, or a combination of non-temporal and temporal. The constraints may be directly compiled to a neural network or otherwise used to train the machine learning model.

Abstract: A method for facilitating identification of secrets in source code by using machine learning is provided. The method includes retrieving a plurality of files from a repository, each of the plurality of files including a source code file; parsing the source code file to identify a training feature; associating a predetermined label with the training feature, the predetermined label corresponding to a secret label and a non-secret label; training a model by using the training feature and the corresponding predetermined label; receiving, via a graphical user interface, a test file, the test file including a set of source codes; parsing the set of source codes to identify a feature; and determining, by using the model, a first characteristic of the feature.

Abstract: A synthesis procedure learns program transformations for a text document, on-the-fly during an edit session, from examples of concrete edits made during the edit session and from an unsupervised set of additional inputs. The additional inputs are derived from explicit feedback from the user and inferred feedback from the user's behavior during the edit session. A reward score, based on anti-unification and provenance analysis, is used to classify the additional inputs as either a positive input or a negative input. Outputs are generated for the positive inputs that are consistent with the existing examples and then used to synthesize a new program transformation. The program transformations are then used to generate code edit suggestions during the edit session.

Abstract: Edit automation functionality generalizes edits performed by a user in a document, locates similar text, and recommends or applies transforms while staying within a current workflow. Source code edits such as refactoring are automated. The functionality uses or provides anchor target lists, temporal edit patterns, edit graphs, automatable edit sequence libraries, and other data structures and computational techniques for identifying locations appropriate for particular edits, for getting transforms, for selecting optimal transforms, for leveraging transforms in an editing session or later, and for displaying transform recommendations and results. The edit automation functionality enhances automation subtool generation, discoverability, and flexibility, for refactoring, snippet insertion, quick actions in an integrated development environment, and other automatable edit sequences.

Abstract: Edit automation functionality generalizes edits performed by a user in a document, locates similar text, and recommends or applies transforms while staying within a current workflow. Source code edits such as refactoring are automated. The functionality uses or provides anchor target lists, temporal edit patterns, edit graphs, automatable edit sequence libraries, and other data structures and computational techniques for identifying locations appropriate for particular edits, for getting transforms, for selecting optimal transforms, for leveraging transforms in an editing session or later, and for displaying transform recommendations and results. The edit automation functionality enhances automation subtool generation, discoverability, and flexibility, for refactoring, snippet insertion, quick actions in an integrated development environment, and other automatable edit sequences.

Abstract: Techniques are disclosed for identifying fixed bits of a bitstring format. One or more processors are configured to generate a first bitstring having respective first bit values that have a first satisfiability state and generate a second bitstring having respective second bit values that have a second satisfiability state. The one or more processors are configured to identify first potential free bits having respective first common values and generate a third bitstring having first potential free bits with the respective first common values and third remaining bits. The one or more processors are configured to identify second potential free bits having respective second common values and identify a fixed bit that is not included in the first potential free bits and is not included in the second potential free bits.

Abstract: A synthesis procedure learns program transformations for a text document, on-the-fly during an edit session, from examples of concrete edits made during the edit session and from an unsupervised set of additional inputs. The additional inputs are derived from explicit feedback from the user and inferred feedback from the user's behavior during the edit session. A reward score, based on anti-unification and provenance analysis, is used to classify the additional inputs as either a positive input or a negative input. Outputs are generated for the positive inputs that are consistent with the existing examples and then used to synthesize a new program transformation. The program transformations are then used to generate code edit suggestions during the edit session.

Abstract: Systems and methods for distributed ledger-based software supply chain management are disclosed. According to one embodiment, in an information processing apparatus comprising at least one computer processor, a method for distributed ledger-based software supply chain management may include: (1) receiving, from a software tool, a metadata artifact for a software development lifecycle event; (2) writing the metadata artifact to a metadata store; and (3) updating a present state database with values for metadata keys referencing the metadata artifact in the metadata store.

Abstract: In a computer program, sublanguage code snippets implement regular expressions, pattern matching, print formatting, component selection, and other operations, using sublanguage syntax and semantics different from the source code in which snippets are embedded. Writing snippets that give desired execution results has been difficult and interfered with software development workflow. But sublanguage snippet presentation functionality in an enhanced development tool automatically detects source code locations suitable for snippets, receives snippet execution result examples from a developer, submits the examples to synthesis-by-example technology, gets autosynthesized snippets that give those results, and displays snippet insertion candidates with guidance. A snippet selected by the developer replaces the example(s) in the source code, improving developer productivity and program execution accuracy with respect to documented test cases.