A method to process subroutine-structured graph-based intermediate representations during formal language processing implemented by a computing device. The method includes classifying a set of subroutines identified in an intermediate representation of code according to mutually recursive relationships between subroutines in the set of subroutines, recording the mutually recursive relationships, labeling to track the mutually recursive relationships, constructing a set of graph representations, collecting partial positions that distinguish points of action in generated code, labeling nodes of the graph of the intermediate representation, generating a subsequent intermediate representation by serialization of the graph of the intermediate representation through pre-order depth-first traversal, and creating the generated code from the intermediate representation.

A method, system and computer-usable medium are disclosed for executing a comparative analysis of microservice profiles and recommending modifications to a microservice. In at least one embodiment, a plurality of microservice analysis daemons and a plurality of microservices are deployed to nodes of a network. Run-time execution characteristic of the plurality of microservices are monitored and gathered by the analysis daemons for microservices executed at the node at which the microservice analysis daemon is deployed. Microservice profiles are generated using the run-time execution characteristics data and data retrieved from a service registry. Recommendations regarding modification of one or more microservices are made based on the results of a microservice profile comparative analysis.

Methods, apparatus, and software for implementing dual Bayesian encoding-decoding for text-to-code transformations. In one aspect, a multi-model probabilistic source code model employing dual Bayesian encoder-decoder models is used to convert natural language (NL) inputs (aka requests) into source code. An NL input is processed to generate a Probabilistic Distribution (PD) of Source code (SC) tokens in an SC token sequence and a PD of Abstract Syntax Tree (AST) tokens in an AST token sequence, wherein each SC token is associated with a respective AST token, and each of the SC and AST tokens have a respective PD. One or more fixing rules are applied to one or more tokens SC tokens that are identified as needing fixing, wherein the fixing rule are selected in consideration of the PDs of the SC tokens and the PDs of their associated AST tokens.

An environment includes various freely settable restrictions for a program executed by an edge device or the like. A software development device generates an object code from a source code and includes an evaluation module for extracting restrictions set in a source code and evaluating whether or not the source code conforms to the restrictions within an application range of the extracted restrictions. A generator module generates an object code so as to conform to the restrictions.

Techniques for an ultra-fact software compilation of source code are provided. A compiler receives software code and may divide it into code sections. A map of ordered nodes may be generated, such that each node in the map may include a code section and the order of the nodes indicates an execution order of the software code. Each code section may be compiled into an executable object in parallel and independently from other code sections. A binary executable may be generated by linking executable objects generated from the code sections. The methodology significantly differs from existing source code compilation techniques because conventional compilers build executable sequentially, whereas the embodiments divide the source code into multiple smaller code sections and compile them individually and in parallel. Compiling multiple code sections improves the compilations in order of magnitude from conventional techniques.

Computer-implemented techniques for deriving many idiomatic programming language interfaces. The techniques allow a programmer to provide idiomatic interfaces in many different programming languages without extra per-language effort. The techniques provide a solution to technical problems involved in providing idiomatic interfaces in many different programming languages. In particular, the techniques solve the problem of providing idiomatic interfaces that use the different definitional elements required by different programming languages, and in a way that programmers experienced in the language expect.

The present disclosure relates to a smart contract processing method and a system, and a readable storage medium. By segmenting a function requiring performance analysis, establishing a symbol calculation model and calculating a GAS consumption formula, and performing further optimization, a GAS value consumed by the execution of a program containing a polynomial cycle can be automatically calculated, or a GAS value consumed by the execution of a program containing a non-linear cycle can be calculated with minimal human assistance, so as to reflect the performance thereof.

A system comprises at least one hardware processor and a memory storing instructions. When executed, the instructions cause the at least one hardware processor to perform operations comprising receiving, in a computing process, a Java user-defined table function (Java UDTF), the Java UDTF including code related to a process method to be performed that includes receiving one or more input tables and transforming the one or more input tables to an output table; determining, using at least a security policy, whether performing one or more portions of the process method are permitted; and performing portions of the process method determined to be permitted.

The disclosure describes various aspects of a software-defined quantum computer. For example, a method is described for generating an intermediate representation of source code for a software-defined quantum computer. The method includes performing a lexical analysis on a high-level intermediate representation of a quantum programming language; performing semantic analysis on an output of the lexical analysis; and generating a mid-level intermediate representation of the quantum programming language based on an output of the semantic analysis.

A method includes receiving a high-level function in a high-level code of an application; identifying resources in a hardware to execute a set of low-level instructions that is generated from the high-level function in the high-level code; compiling the high-level function in the high-level code of the application into the set of low-level instructions to be executed on the hardware; and generating a plurality of structured metadata associated with allocation of resources in the hardware to execute the set of low-level instructions.