Abstract: Systems/techniques that facilitate monolith-to-microservice refactoring via source-code-to-domain-model graph comparison are provided. In various embodiments, a system can access source code of a monolithic application and a target domain model corresponding to the monolithic application. In various aspects, the system can refactor the monolithic application into microservices, by aligning a first graph representing the source code with a second graph representing the target domain model.

Abstract: An AI tool for writing computer code is generated by collecting code entry data from a plurality of remote computing devices, training a code completion network using the code entry data, wherein the code completion network is configured to predict one or more additional code entry activities based on a provided set of code entry activities, and providing the code completion network to one or more development sessions. A code segment is intelligently generated by receiving a request to modify computer code of a program in a development interface, and presenting a text input component and a code description prompt. The technique further includes receiving, via the text input component, a code description, applying at least part of the code description to a code generation network to obtain a code segment suggestion and presenting the code segment suggestion on a display.

Abstract: A method, computer system, and a computer program product for generating a conversational bot for an application programming interface (API) is provided. The present invention may include parsing an API schema. The present invention may include generating sentences for the conversational bot from the parsed API schema. The present invention may include constructing the conversational bot by training a deep learning model. The present invention may include receiving a natural language expression from a user. The present invention may include determining whether the natural language expression is enough to activate the bot.

Abstract: Systems and methods may generate or modify a pattern, to search text, utilizing a hierarchical structure. The system and method may receive instructions for generating or modifying the pattern. The system and methods may identify or generate a hierarchical structure containing one or more levels each of which includes one or more objects that store values. The system and method may define a pattern by assigning values to the hierarchical structure when the instructions are for generating the pattern; or may modify one or more values in the hierarchical structure when the instructions are for modifying the pattern. The system and method may receive pattern matching instructions. The system and method may identify, based on the pattern matching instructions and utilizing the hierarchical structure, one or more portions of the program that includes the generated or modified pattern and implement one or more pattern matching functions to provide results.

Abstract: An approach for generating a compiled version of a program source code. At least two different executable files may be generated applying at least two different compiler optimization settings for compiling a first part and applying at least two different compiler optimization settings for compiling a second part of the source code. A main performance part of the source code may be determined dependent on values of a target quantity of the at least two different executable files. The main performance part is the part of the first part and the second part that has a greater influence on the target quantity. The compiled version of the program source code may be generated by compiling the source code applying a higher optimization level of the compiler for compiling the main performance part than for compiling the remaining part of the source code.

Abstract: Embodiments herein describe a deployment strategy where a vendor deployment system sends to each customer site the same binary that defines all the microservices offered by the vendor deployment system. That is, the vendor deployment system can build one binary image of its platform (which has all the microservices) that is deployed to every customer site. The vendor also provides a deployment descriptor that is used during runtime to activate the microservices intended for use at the customer site. In this manner, the vendor deployment system can generate a customized deployment without having to build a new binary by manipulating the data or flags in the deployment descriptor.

Abstract: Methods, systems, and computer programs are presented for providing an interactive canvas tool to generate multimodal, personalized content. One method includes providing a user interface (UI) for a canvas tool to generate multimodal content. The canvas tool comprises a prompt panel, a variations panel, and a canvas configured to present items of several types, such as a text type and an image type. The method further includes receiving text input including a textual description with instruction for generating an item, where the canvas tool is configured to generate items from the several types. The method further includes providing the text input to a generative artificial intelligence (GAI) tool, and presenting one or more variations based on an output of the GAI tool. The method further includes detecting a selection of one of the variations in the variations panel, and adding the selected variation to the canvas in the UI.

Abstract: According to some embodiments, systems and methods are provided, comprising receiving a code fragment exhibiting a static code issue; determining, via a trained exemption neural network, whether the received code fragment is exempt or not exempt from resolution; in a case it is not exempt, inputting the code fragment to a trained classification neural network; determining whether the static code issue is a syntactical static code issue or a non-syntactical static code issue; in a case it is a syntactical static code issue, inputting the code fragment to a first trained network to generate a first resolution; and in a case the static code issue is a non-syntactical static code issue, inputting the code fragment to a second trained network to generate a second resolution of the non-syntactical static code issue. Numerous other aspects are provided.

Abstract: A tool is provided for evaluating contributions of different software developers to a software project, which considers both the structural value and non-structural value of each developer's contributions. Source code for the project is parsed to generate abstract syntax trees (ASTs) representing the code at different times during the project. The tool may perform both a structural value analysis and a non-structural value analysis of the code contributions of each developer. The structural value analysis for each developer may include a call-commit analysis of a call-commit graph generated from the ASTs to analyze function calls and commits attributable to each developer. The non-structural value analysis for each software developer may include identifying and classifying commits attributable to each developer based on impact of such commits on the project. The tool may then calculate a development value score for each developer based on the structural and non-structural metrics for each developer.

Abstract: Aspects of the subject disclosure may include, for example, receiving a request for a configuration audit of a network device, identifying a class of the network device, retrieving a configuration template for the network device, wherein the retrieving is based on the class of the network device, wherein the configuration template is represented as a hierarchical tree structure, retrieving a current configuration of the network device, translating the current configuration of the network device to a tree data structure, comparing the tree data structure with the configuration template represented as a hierarchical tree structure, identifying discrepancies between the tree data structure and the configuration template represented as a hierarchical tree structure, reporting the discrepancies, receiving instructions to resolve the discrepancies, and modifying one of the current configuration for the network device and the configuration template for the network device, wherein the modifying is responsive to the i

Abstract: Methods, systems, and computer program products for generating computer source code products. According to one method, an engineer creating or modifying an implementation of computer source code selects design patterns from a catalog of pre-existing design patterns. The design patterns are known abstractions that solve specific problems of computer program design and implementation. The selected design patterns are then bound to elements within a representation of the implementation known as a model. The model is then converted into a representation using elemental design patterns, and this abstraction model is used to generate the computer source code in any programming language. The abstraction model is also suitable as input for an automated inference engine for validation or verification purposes prior to or after the generation of the computer source code.

Abstract: An example apparatus comprises a transformation generator to generate a population of code variants corresponding to an input code, the population of code variants to include transformation sequences of the input code, a dependence analyzer to analyze the population of code variants for dependence vectors, a profile controller to profile the population of code variants to determine performance metrics of hardware during an execution of respective ones of the transformation sequences, and a hash code generator to generate hash codes for storing in a database, the hash codes (a) corresponding to a combination of the dependence vectors and respective performance metrics and (b) mapped to respective transformation sequences.

Abstract: An apparatus configured for database access control. The apparatus includes a memory and a processor coupled to the memory, wherein the processor is configured to execute instructions. The instructions include receiving a statement requesting access for a user to data files stored in a non-transitory memory medium; parsing the statement into one or more arguments, wherein each argument ends with a logical operator; computing a skip count for each of the arguments; evaluating the statement using the skip counts to determine whether the access should be granted to the user; retrieving the data files from the non-transitory memory medium; and sending the data files to the user, if the access is granted.

Abstract: A hierarchical extraction model for a label hierarchy may be implemented by a weighted hierarchical state machine whose structure and/or weights are determined in part from a statistical distribution of label sequences as determined from training data. In accordance with various embodiments, the hierarchical state machine includes one or more non-cyclic directed chains of states representing at least a subset of the label sequences, and transitions weighted based at least in part on the statistical distribution.

Abstract: Methods, systems, and computer program products for generating computer source code products. According to one method, an engineer creating or modifying an implementation of computer source code selects abstractions of computer program design from a catalog of design patterns. Design patterns are known abstractions that solve specific problems of computer program design and implementation. The selected design patterns are then bound to elements within a representation of the implementation known as a model. The model is then converted into a representation using elemental design patterns, and this abstraction model is used to generate computer source code in any programming language. The abstraction model is also suitable as input for an automated inference engine for validation or verification purposes prior to, or after, the generation of the computer source code.

Abstract: The present disclosure provides a terminal, a split-screen display method for a screen thereof, and a storage device. The method comprises: a terminal system establishing a virtual stack according to an original stack, wherein an active component of the virtual stack is entirely or partially identical to an active component of the original stack; a first area of a terminal screen displaying a user interface corresponding to an active component at the stack top of the original stack, and a second area of the terminal screen displaying a user interface corresponding to an active component at the stack top of the virtual stack.

Abstract: Methods, apparatus, and systems for traversing a representation of an application source code are disclosed. Steps for traversing the representation include beginning to traverse the representation, monitoring a history of the traverse, and continuing to traverse the representation based on the history of the traverse. Continuing to traverse the representation may include identifying a plurality of concrete implementations of a method invocation and traversing less than all of the concrete implementations, the concrete implementations being traversed being selected based on the history of the traverse.

Abstract: A method may include generating, based on a first programming code implementing a routine in a first programming language, a second programming code implementing the routine in a second programming language associated with an offline runtime environment and a third programming code implementing the routine in a third programming language associated with an online runtime environment. The routine may include a first operation and a second operation associated with a cloud-based software application. The first operation may be capable of being performed while the cloud-based software application is operating in an offline mode but the second operation may be incapable of being performed while the cloud-based software application is operating in the offline mode. The second second programming code being generated to include the first operation and exclude the second operation. The second programming code and the third programming code may be deployed to a client.

Abstract: A method of analyzing code is provided. The method includes generating an abstract representation of the code, identifying conditional statements in the abstract representation, populating a truth table for each conditional statement that has been identified with all possible outcomes of the conditional statement and assessing the truth table for each conditional statement to identify issues.

Abstract: A computer-implemented system, method and computer program product to transform content and to generate a visual indicator of that transformation, by: performing the transformation on the content, wherein the content is transformed from one state to another state; and displaying the visual indicator representative of the transformation adjacent the content; wherein the visual indicator is selected to display the content in a state that existed prior to or at a time when the transformation was performed. As subsequent transformations are performed, additional visual indicators are listed in the order performed. The visual indicator acts as a user interface element that allows a user to view or revert the content to a state that existed prior to or at a time that the transformation was performed. Selection of the visual indicator follows the control to the destination. The visual indicator also serves to relay information sent from the destination.

Abstract: During a process called live design, a computing system may receive, from a repository, an instance of a first component comprising a first set of one or more metaobjects that provides a binary representation of the instance of the first component. In turn, the computing system may render the instance of the first component as an icon and a first set of one or more underlying panes that provide a visual expression of the instance of the first component. The computing system may then receive, via the first set of one or more underlying panes, a user modification to the instance of the first component. Thereafter, the computing device and/or the repository may determine whether the user modification to the instance of the first component is valid, and may process the user modification in accordance with the determining.

Abstract: The embodiments relate to generating hierarchical patterns based on a corpus of text. The corpus is analyzed, which includes extracting a set of features of the corpus. A set of grammatical patterns are generated based on the extracted features. The set of grammatical patterns includes at least one grammatical pattern generated from an internal pattern and at least one grammatical pattern generated from an external pattern. The grammatical patterns of the set are organized into a hierarchy and/or are ranked. The hierarchy and/or ranking are visually displayed.

Abstract: A compiling device (100) configured to convert a source code computer program (102) into an object code computer program (106), the compiling device comprising—a processor circuit arranged to—parse (120) the source code computer program and generate a static single assignment (SSA) graph (122) for at least a portion of the source code computer program, and—search for a second subgraph (P) of the SSA graph, wherein a first subgraph (N) is a subgraph of the second subgraph (N?P), a sum of the bit sizes associated to incoming edges of the second subgraph being smaller than a sum of the bit sizes associated to incoming edges of the first graph, —implementing the second subgraph of the SSA graph in the object code computer program as a single operation thus omitting the assignments corresponding to edges of the first subgraph.

Abstract: Operations may include obtaining a code artifact in which the code artifact is a code snippet is of a software language of interest. The operations may also include identifying fault locations of the code snippet that each correspond to a parsing error. In addition, the operations may include implementing repairs for each identified fault location in which, for each fault location, a respective repair is implemented for its corresponding parsing error such that the code snippet is modified into a parsable code snippet.

Abstract: Provided are systems and methods for resolving conflicts between different versions of a database file. In one example, the method may include one or more of receiving, at a database, a request to publish a modified version of a database file modified by a user having privileges to update the database file, detecting, during a merge operation, a conflict between one or more data values included in the unpublished modified version of the database file and one or more corresponding data values in an intervening version of the database file published by another user that also has privileges to update the database file, and outputting a user interface displaying an identification of the one or more conflicting data values and one or more selections for resolving the one or more conflicting data values.

Abstract: Techniques and solutions are described for defining transformation specifications in a programming-language independent language and converting such specifications to one or more executable formats. The language can provide for defining rules and actions. Rules can refer to (e.g., be based at least in part on) data targets, such as attributes of a schema, whose identifiers are to be read or updated, or to other rules. Rules can be reused, and can recursively refer to one another, such that a large number of complex schema transformations can be accomplished using a series of first order logic statements. Actions can define what, and how, values will be changed when a predicate rule is satisfied. A transformation specification in the language can be parsed and selectively complied to one or more executable formats, including in programming languages such as the structured query language. Disclosed technologies can facilitate data transformations by non-technical users.

Abstract: According to one embodiment, a code information storage is configured to store information on a plurality of functions, a calling relationship between the plurality of functions, and code blocks in the respective plurality of functions. A user operation storage is configured to store information of an already read code block. An already read graph generator is configured to generate an already read graph expressing an already read function including the already read code block, all the code blocks included in the already read function, and a calling relationship between the already read code block and the already read function. An expression of the already read code block differs from an expression of the other code block.

Abstract: An example method includes monitoring execution of one or more applications on a runtime computing system that includes a plurality of processing units, receiving, from the runtime computing system during execution of the applications, monitoring information that includes at least one of function call data or application programming interface call data associated with operations performed by the plurality of processing units during execution of the applications, importing the monitoring information into a risk model, analyzing the monitoring information within the risk model to determine one or more potential vulnerabilities and one or more impacts of the one or more vulnerabilities in the runtime computing system, and outputting, for display in a graphical user interface, a graphical representation of the one or more potential vulnerabilities and the one or more impacts within the risk model.

Abstract: According to one technique, a virtual machine generates an object configured to provide secure access to memory through one or more memory fencing operations. Through the object, the virtual machine receives a call that indicates a memory location and specifies a particular memory fencing operation of the one or more memory fencing operations to perform with respect to the memory location. The virtual machine causes performance of the particular memory fencing operation with respect to the memory location.

Abstract: Embodiments herein disclose systems and methods for enabling new types (referred to as existent types), that allow for expressing additional possible values and, thereby, eliminating out-of-bounds access errors in programming. In addition to the value “null” as supported by many programming languages, embodiments herein introduce a new special or reserved value to represent an out-of-bounds access. In an exemplary embodiment, a special “undefined” value or memory address, which is distinct from “null”, that exclusively describes out-of-bounds accesses is defined. The implementation includes but is not limited to value checks, bounds checks, and container-level implementations.

Abstract: A system and method for securing an application through an application-aware runtime agent can include: acquiring a code profile, instrumenting the application with a runtime agent according to the code profile, enforcing the runtime agent on the execution of the application, and responding to the runtime agent. Enforcing the runtime agent on the execution of the application can include monitoring the execution flow, which comprises of monitoring the utilization of the controls through the execution of the application; detecting a threat, which comprises identifying a section of the execution flow as a potential security threat; and regulating the execution flow to prevent or ameliorate the security threat. Responding to the runtime agent can include responding to the security threat and providing a user interface that may output runtime agent diagnostics and trigger alerts.

Abstract: A method for providing visualization of data objects in a relational database is provided. The method comprises: (a) bringing an electronic device of a user in communication with a server comprising the non-hierarchical relational database, (b) generating and displaying a graph comprising visual graphical elements including a first node representing a first class encompassing a first subset of the data objects, a second node representing a second class encompassing a second subset of the data objects, and a link representing a relationship between the first class and the second class, (c) receiving a request via the user interface of the electronic device to perform a task directed to at least a subset of the data objects, (d) generating one or more filtering operations for the task and, upon execution, producing a graphical result comprising a filtered data set, and (e) automatically displaying the graphical result on the user interface.

Abstract: A cyber-security threat detection system and method stores physical data measurements from a cyber-physical system and extracts synchronized measurement vectors synchronized to one or more timing pulses. The system and method synthesize data integrity attacks in response to the physical data measurements and applies alternating parameterized linear and non-linear operations in response to the synthesized data integrity attacks. The synthesis renders optimized model parameters used to detect multiple cyber-attacks.

Abstract: A first and second local scope definition associated with a first and second node, respectively, in a hierarchical application tree are received where the hierarchical application tree includes application instructions at one or more nodes within the hierarchical application tree. A pruned version of the hierarchical application tree is determined including by propagating the first local scope definition from the first node to the second node, a child of the first node. Any nodes that are not relevant to a particular set of one or more local scope definitions at a given node are pruned in order to obtain a pruned version of the hierarchical application tree. A qualified application is generated using those application instructions at the unpruned nodes in the pruned version of the hierarchical application tree.

Abstract: Computer program products, methods, systems, apparatus, and computing entities are provided for automatically validating and/or converting data in candidate transaction in a distributed ledger systems. The validating and converting can be automatically executed via one or more smart contracts. Once validated and/or converted the candidate transaction may be committed to a ledger in the distributed ledger system.

Abstract: For parsing source code into a linear array, a method parses source code into a plurality of logic design elements. The method further identifies conditional logic for each logic design element. In addition, the method identifies computation logic for each logic design element. The method encodes each logic design element as a logic state of a plurality of logic states in a linear array. Each logic state includes one or more binary output variables, one or more binary input variables, one or more minterms of the one or more binary input variables, one or more maxterms of the one or more minterms, one or more present state values, and one or more next state values. The method reduces the logic relationships to a Boolean equation. The method generates one of output source code and a hardware implementation from the Boolean equation.

Abstract: A method, apparatus, and system for using a verification substitute header file in a verification of an application that uses Protocol Buffers (Protobuf) for data communication is disclosed. The operations comprise: obtaining one or more Protobuf message types from a Protobuf definition file; generating the verification substitute header file based on the Protobuf message types; adding one or more verification stubs to the verification substitute header file; including the verification substitute header file in source code of the application; and performing the verification of the application including the verification substitute header file.

Abstract: A system for code development and execution includes a client interface and a client processor. The client interface is configured to receive user code for execution and receive an indication of a server that will perform the execution. The client processor is configured to parse the user code to identify one or more data items referred to during the execution. The client processor is also configured to provide the server with an inquiry for metadata regarding the one or more data items, receive the metadata regarding the one or more data items, determine a logical plan based at least in part on the metadata regarding the one or more data items; and provide the logical plan to the server for execution.

Abstract: Described are methods, systems and computer readable media for computer assisted completion of hyperlink command segments.

Abstract: During a process called live design, a computing system may receive, from a repository, an instance of a first component comprising a first set of one or more metaobjects that provides a binary representation of the instance of the first component. In turn, the computing system may render the instance of the first component as an icon and a first set of one or more underlying panes that provide a visual expression of the instance of the first component. The computing system may then receive, via the first set of one or more underlying panes, a user modification to the instance of the first component. Thereafter, the computing device and/or the repository may determine whether the user modification to the instance of the first component is valid, and may process the user modification in accordance with the determining.

Abstract: In a pipeline of operations having a terminating operation and a source operation, a builder is built corresponding to the terminating operation. The builder may also correspond to one or more intermediate operations. A database query is generated corresponding to the builder and is sent to a database or a data source for efficient access to the database.

Abstract: An applicant can instantiate a parsing framework, provide an input stream, attach observers, and initiate parsing, which inverts control to the parsing framework. The parsing framework can have an observer manager, a parser controller, and parsers. The observer manager manages observer design patterns from which the observers are instantiated. The parser controller determines which parser would be appropriate for parsing the input stream and instantiate the appropriate parser(s). The parser controller gets the callbacks from the parsers and communicates outcomes to the observer manager. The observer manager determines which of the observers is to be notified, generates parsing notifications accordingly, and dispatches the parsing notifications directly to the observers. The application can be any application that needs parsing in an electronic information exchange platform.

Abstract: A cyber-security threat detection system and method stores physical data measurements from a cyber-physical system and extracts synchronized measurement vectors synchronized to one or more timing pulses. The system and method synthesizes data integrity attacks in response to the physical data measurements and applies alternating parametrized linear and non-linear operations in response to the synthesized data integrity attacks. The synthesis renders optimized model parameters used to detect multiple cyber-attacks.

Abstract: A compiler system, computer-implemented method and computer program product for optimizing a program for multi-processor system execution. The compiler includes an interface component configured to load from a storage component program code to be executed by one or more processors (P1 to Pn) of a multi-processor system. The compiler further includes a static analysis component configured to determine data dependencies) within the program code, and further determines all basic blocks of the control flow graph providing potential insertion positions along paths where communication statements can be inserted to enable data flow between different processors at runtime. An evaluation function component of the compiler is configured to evaluate each potential insertion position with regards to its impact on program execution on the multi-processor system at runtime by using a predefined execution evaluation function.

Abstract: An example method includes monitoring execution of one or more applications on a runtime computing system that includes a plurality of processing units, receiving, from the runtime computing system during execution of the applications, monitoring information that includes at least one of function call data or application programming interface call data associated with operations performed by the plurality of processing units during execution of the applications, importing the monitoring information into a risk model, analyzing the monitoring information within the risk model to determine one or more potential vulnerabilities and one or more impacts of the one or more vulnerabilities in the runtime computing system, and outputting, for display in a graphical user interface, a graphical representation of the one or more potential vulnerabilities and the one or more impacts within the risk model.

Abstract: Models of certain groups of graphical user interface (GUI) objects (e.g., menu objects, product objects, title objects, etc.) are created. A website is then modeled as a state machine (also called a blueprint), in which states are used to model webpages of the website. Identifying characteristics of the states are specified based on the models of the GUI objects. Certain scanning options are used to reduce the complexity of the state machine and accelerate the state machine creation process, known as the “one per page” and “once per app” scanning options. After the state machine model of the website has been created, test cases are generated as traversals through the state machine. In one embodiment, user logs direct the generation of test cases so that the test cases resemble past user behavior.

Abstract: Various aspects of the subject technology related to systems and methods for generating a human-readable, language-independent stack trace summary. A system may be configured to receive error reports which include a language-dependent stack trace generated in response to a software test failure and metadata. The generated language-dependent stack trace includes one or more frames. The system may generate a language-independent stack trace summary by processing each frame of the language-dependent stack trace by removing line number values from each of the one or more frames, removing column number values from each of the one or more frames, collapsing one or more file names identified in each of the one or more frames, and removing spaces from each of the one or more frames. The system may output the generated language-independent stack trace summary.

Abstract: A native Job Control Language (JCL) execution engine is provided in a mainframe rehosting platform/open platform for executing a migrated JCL job without converting the JCL job to another language. The JCL execution engine provides a framework which supports an internal JCL mechanism, a simulation of a plurality of mainframe utilities commonly used in JCL jobs, and a simulation of commonly used database utilities. When the JCL execution engine receives a JCL job, it generates a statement sequence from the JCL job, orders statements in the sequence into a doubly-linked sequence, and parses the doubly-linked sequence to construct a job element hierarchy tree for execution. A plurality of job initiators are provided to dequeue jobs from a job queue and dispatch the jobs to the JCL execution engine or another type of execution engine.

Abstract: Among other things, a method of generating a computer program based on an SQL query includes receiving a SQL query, including a reference to a first data set stored at a first data source, and including a reference to a second data set stored at a second data source different from the first data source, determining that the SQL query includes two or more commands, the commands including a first union-type operation, and a first aggregation operation, and determining that the SQL query describes that the first union-type operation shall be applied to at least a portion of data from the first data set, and applied to at least a portion of data from the second data set, determining that the SQL query describes that the first aggregation operation shall be applied to data resulting from the first union-type operation, and generating the computer program.

Abstract: For parsing source code into a linear array, a method parses source code into a plurality of logic design elements. The method further identifies conditional logic for each logic design element. In addition, the method identifies computation logic for each logic design element. The method encodes each logic design element as a logic state of a plurality of logic states in a linear array. Each logic state includes one or more binary output variables, one or more binary input variables, one or more minterms of the one or more binary input variables, one or more maxterms of the one or more minterms, one or more present state values, and one or more next state values. The method reduces the logic relationships to a Boolean equation. The method generates one of output source code and a hardware implementation from the Boolean equation.