Abstract: Disclosed herein are techniques for matching symbols between code sets. Techniques include accessing a first symbol associated with a first version of software; accessing a second symbol associated with a second version of the software; comparing the first symbol to the second symbol; determining, based on the comparing, whether the second symbol is a functional equivalent of the first symbol; and performing a designation action based on whether the second symbol is a functional equivalent of the first symbol.

Abstract: The present invention proposes a method for determining whether or not the legitimacy of an algorithm generated by LCPS during operation is established by generating the super-language context of LCPS from the LCPS to be verified by the generalized method of the present invention without using any verification data, and analyzing it by the generalized method of the present invention. With this method, all bug events that LCPS develops during operation are revealed as bug syntaxes in the generalized method of the present invention. If there is no bug syntax in LCPS, the algorithm generated by LCPS when operating is legitimate. The above-described method may be performed manually or by a computer according to a dedicated program.

Abstract: A computer-implemented method includes receiving, by a processor, an updated version of a computer program that includes several source code changes. A compiler preprocesses the source code changes for a target computing platform. The preprocessing includes identifying a compile time condition associated with one or more computer instructions enclosed by a macro, determining a current value of the compile time condition at the time of compiling, and determining corresponding object code based on the current value. Further, a macro information record for the macro is generated that includes the compile time condition, the current value, and an identification of the computer instructions. Further, a linker preprocesses the source code changes. This preprocessing includes determining that the object code is not included in an executable file, and updating the macro information record to indicate that the macro is not included in the executable file.

Abstract: Embodiments of the present invention are directed to facilitating concurrent forecasting associating with multiple time series data sets. In accordance with aspects of the present disclosure, a request to perform a predictive analysis in association with multiple time series data sets is received. Thereafter, the request is parsed to identify each of the time series data sets to use in predictive analysis. For each time series data set, an object is initiated to perform the predictive analysis for the corresponding time series data set. Generally, the predictive analysis predicts expected outcomes based on the corresponding time series data set. Each object is concurrently executed to generate expected outcomes associated with the corresponding time series data set, and the expected outcomes associated with each of the corresponding time series data sets are provided for display.

Abstract: A method for executing a second-order taint analysis on library code may include generating, by executing a first-order taint analysis on the library code starting at a sink, a first execution path from a load instruction to the sink. The load instruction may perform: reading a first value using a first global identifier. The method may further include determining a store instruction by matching the load instruction and the store instruction. The store instruction may perform: writing a second value using a second global identifier. The method may further include, generating a second execution path from the store instruction to the load instruction, generating, by executing the first-order taint analysis on the library code starting at the store instruction, a third execution path from an entry point to the store instruction, and forming a potential second-order taint flow by joining the first, second, and third execution paths.

Abstract: Methods are provided for semantic processing of data files including detecting formats of data embedded in the data files and converting the data to formats compatible with a data analysis tool. The method may comprise determining if the data file comprises signature characteristics associated with a known data format and, if so, determining a set of data manipulation operations associated with the known data format to convert the data file to a compatible format for the data analysis tool. The method may further comprise semantically analyzing components of the data files to assess formatting across a required set of criterions needed by the data analysis tool and determining sets of data manipulation operations to perform to convert the data file to a compatible format.

Abstract: A method of deriving a correlation between observed values from e.g. a process, where initial values are derived from ingredients or process parameters and a second value from a resulting product. A number of candidate mathematical functions are generated in a grid-type flow structure in which tokens flow through nodes, each node determining a mathematical function, so that a token defines a number of mathematical functions and an order thereof. Tokens may be combined so that the functions include multiple variables. A best, resulting mathematical function may be determined and the grid structure amended to favour this function and the method may be repeated.

Abstract: In some embodiments, a method or processing a command line interface is provided. The method parses a definition file for extending a command line interface (CLI) with an extension. The definition file is processed through an external interface that is different from an internal interface used to develop the CLI. The method translates a definition from the definition file to an internal structure supported by the internal interface. The translated definition implements the extension in the CLI. The internal structure is added to a data structure for the CLI where a command set of the CLI is extended to perform a command that is defined by the definition.

Abstract: Systems and methods for analyzing Robotic Process Automation (RPA) code are provided. A robotic process automation (RPA) file is received by the RPA analysis and review system. The RPA analysis and review system uses a code review configuration which defines coding standards for the RPA files code. RPA data within the RPA file is parsed and received for compliance with coding standards and restructured for rendering in a code-review graphical user interface (GUI). A code-review GUI with the restructured RPA data is then rendered, along with information that includes whether the RPA code was in compliance with the coding standards.

Abstract: Various systems and methods provide an intuitive user interface that enables automatic specification of queries and constraints for analysis by ML component. Various implementations provide methodologies for automatically formulating machine learning (“ML”) and optimization queries. The automatic generation of ML and/or optimization queries can be configured to use examples to facilitate formulation of ML and optimization queries. One example method includes accepting input data specifying variables and data values associated with the variables. Within the input data any unspecified data records are identified, and a relationship between the variables specified in the input data and a variable associated with the at least one unspecified data record is automatically determined. The relationship can be automatically determined based on training data contained within the input data. Once a relationship is established a ML problem can be automatically generated.

Abstract: A method may include searching compiled code for a variable name of a resource, the variable name containing a predefined string; identifying a variable name in a resource manifest of the library that matches the variable name that contains the predefined string; based on the identifying, importing the resource to a location associated with the compiled code.

Abstract: A non-transitory computer-readable medium having stored therein a program for causing a computer to execute a process. The process includes storing a plurality of generation instructions in a storage area for each of a plurality of first assembly instructions, each generation instruction instructing the generation of a machine language of a second assembly instruction that executes processing equivalent to each first assembly instruction, and generating machine languages of a plurality of second assembly instructions so that the machine languages of the second assembly instructions having a dependency relationship do not appear adjacent to each other, according to the plurality of generation instructions in the storage area.

Abstract: A method for validating software transforms. A target program binary is mutated, producing a plurality of variants. It is determined whether each variant passes a test suite. Upon determining the variant does not pass the test suite, the variant is discarded. Upon determining the variant passes the test suite, the variant is compared to the target program binary. A candidate transform is extracted which meets scope criteria. The candidate transform is applied to each of a plurality of test programs. It is determined whether the candidate transform is safe. Upon determining that the candidate transform is not safe, the candidate transform is discarded. Upon determining that the candidate transform is safe, the candidate transform is collected.

Abstract: Monitoring statements in a database environment. Substantially all database query statements to be executed against a database in the database environment are analyzed to determine if a statement has an outlier statistic. Database queries that do not have an associated outlier statistic are serviced. Further analysis is performed for statements having an outlier statistic to determine if the corresponding statement poses a security risk to the database environment.

Abstract: An application can be converted to new programming language or framework. A source application written for a legacy framework is analyzed and divided into smaller segments of code. The smaller segments are evaluated for quality in view of best practices design for writing applications. A rubric is determined for each segment and compared to a best practice threshold. Segments can be evaluated for features that can be passed through a model. The model converts the features into new code adapted for target framework. Machine learning and rules databases are updated with details of the conversion.

Abstract: A circuit architecture for expanded design for testability functionality is provided that includes an Intellectual Property (IP) core for use with a design for an integrated circuit (IC). The IP core provides an infrastructure harness circuit configured to control expanded design for testability functions available within the IC. An instance of the IP core can be included in a circuit block of the design for the IC. The infrastructure harness circuit can include an outward facing interface configured to connect to circuitry outside of the circuit block and an inward facing interface configured to connect to circuitry within the circuit block. The instance of the IP core can be parameterized to configure the infrastructure harness circuit to control a plurality of functions selected from the expanded design for testability functions based on a user parameterization of the instance of the IP core.

Abstract: Systems and methods for low latency materialized information provision are disclosed. For example, a system may include at least one memory storing instructions and one or more processors configured to execute the instructions to perform operations. The operations may include receiving, via a materialization service, data from multiple sources related to an item associated with a webpage hosted by a server. The data may include first event data sourced from a real-time feed and second event data sourced from stored data. Operations may include generating synchronized data based on the first and second event data. Operations may include receiving a request from the web server for information related to the item, the request being associated with a user segment. Operations may include identifying data to aggregate to fulfill the request, generating a data structure gathering synchronized data using the data structure, and forwarding the gathered synchronized data to the server.

Abstract: A computer includes a memory and a processor programmed to execute instructions stored in the memory. The instructions include filtering dependency code from a binary file to separate the dependency code from custom code in the binary file. The instructions further include evaluating the custom code in the binary file for a security risk.

Abstract: Embodiments of the present invention are directed to facilitating concurrent forecasting associating with multiple time series data sets. In accordance with aspects of the present disclosure, a request to perform a predictive analysis in association with multiple time series data sets is received. Thereafter, the request is parsed to identify each of the time series data sets to use in predictive analysis. For each time series data set, an object is initiated to perform the predictive analysis for the corresponding time series data set. Generally, the predictive analysis predicts expected outcomes based on the corresponding time series data set. Each object is concurrently executed to generate expected outcomes associated with the corresponding time series data set, and the expected outcomes associated with each of the corresponding time series data sets are provided for display.

Abstract: Dynamic honeypots for computer program execution environments are described. A determination is made whether a time period has expired since a computer program execution environment, of multiple computer program execution environments, began executing a computer program that provides a user service. The computer program execution environment is changed into a computer security mechanism that counteracts an attempt of unauthorized use of a system that comprises the computer program execution environment, in response to a determination that the time period has expired since the computer program execution environment began executing the computer program that provides the user service.

Abstract: A method for dynamic frequency scaling (DFS) on the electronic systems level (ESL). The method can run in a virtual environment and dynamically scale the frequency of a virtual component based on a first transaction time and a second transaction time.

Abstract: Systems and methods for function argument checking are disclosed. The systems and methods can use declarations and validation instructions based on the declarations. Validation instructions for a function can be generated automatically from a declaration for the function. The validation instructions can be executed in response to invocation of the function. The validation instructions can include instructions for determining whether an input satisfies a condition on a corresponding argument of the function, instructions for identifying a position of the input, and instructions for providing, in response to determining that the input does not satisfy the condition, an indication of the nonsatisfaction of the condition and the position. The condition can specify a datatype or size for the argument or one or more validation functions for checking the argument.

Abstract: Provided herein are methods, systems, and computer-program products for providing a library of base classes to be used by applications to facilitate real-time analytics. In some examples, the library may be a C++ Library that provides a set of primitive operators (e.g., spout base class, tube base class, and sink base class) for user derivation. In some examples, the spout base class may relate to receiving data from a data source, the tube base class may relate to performing one or more operations on the received data, and the sink base class may relate to sending the processed data to a data target. The spout, tube, sink together provide a real-time streaming framework interface that may be extended by the user.

Abstract: Systems, methods, and devices for implementing secure views for zero-copy data sharing in a multi-tenant database system are disclosed. A method includes granting, to one or more cross-accounts, access to a share object comprising a secure view and usage functionality associated with a user-defined function (UDF) to underlying data without providing a view of the procedural logic associated with the UDF.

Abstract: Disclosed is a method and system to obtain a structured grammar, based on a restricted language (e.g., a known subset of a full language such as a computer language) that may assist with automated parsing and correlation of configuration files conforming to the structured grammar. Once obtained, a plurality of different network device configuration documents (e.g., config file information) may be parsed to create a scaffold view using slots for correlated data across the plurality of different network devices. For example, the scaffold view may include populated branches of the scaffold representative of the plurality of different network device configuration documents. Maintaining a correlation of source data to changes in a single view based on the scaffolding may be used to comprehensively view and edit configuration information.

Abstract: A method includes, receiving a first version of a software patch for an application. The method further includes receiving a second version of the software patch, the second version being associated with an upstream version of the application. The method further includes, comparing the first version of the software patch with the second version of the software patch, the comparing accounting for differences between the first version of the software patch and the second version of the software patch that result from differences between the application and the upstream version of the application. The method further includes, in response to comparing, tagging the first version of the software patch as a match when there are no differences other than the differences between the first version of the software patch and the second version of the software patch that result from differences between the application and the upstream version of the application.

Abstract: An embodiment includes executing a code interpretation engine such that the interpretation engine interprets a first portion of a source code that includes a first comparison between a first pair of operands. The embodiment also includes performing, in memory, a first bitwise comparison between a block A1 and a block B1 of the first portion of the source code. The embodiment also speeds up execution of the first portion of the source code responsive to the first bitwise comparison producing a negative result. The embodiment speeds up the first portion by omitting at least one of (i) a second bitwise comparison between a block A2 and a block B2, and (ii) a field-wise comparison between a block A3 and a block B3.

Abstract: A computer-implemented method includes encoding an array of (p?1)×k symbols of data into a p×(k+r) array. The method includes p is a prime number, r?1, and k?p?r. The method also includes each column in the p×(k+r) array has an even parity and each line of slope j for 0?j?r?1 in the p×(k+r) array has an even parity. The method includes the lines of slope j taken with a toroidal topology modulo p. A computer program product for encoding an array of (p?1)×k symbols of data into a p×(k+r) array includes a computer readable storage medium having program instructions executable by a computer. The program instructions cause the computer to perform the foregoing method.

Abstract: Methods for debugging a processor based on executing a randomly created and randomly executed executable on a fabricated processor. The executable may execute via startup firmware. By implementing randomization at multiple levels in the testing of the processor, coupled with highly specific test generation constraint rules, highly focused tests on a micro-architectural feature are implemented while at the same time applying a high degree of random permutation in the way it stresses that specific feature. This allows for the detection and diagnosis of errors and bugs in the processor that elude traditional testing methods. The processor Once the errors and bugs are detected and diagnosed, the processor can then be redesigned to no longer produce the anomalies. By eliminating the errors and bugs in the processor, a processor with improved computational efficiency and reliability can be fabricated.

Abstract: A simulation apparatus includes a memory and a processor. The processor is configured to: acquire a circuit model described in a hardware description language; extract a reading and writing relationship between a process and a register variable included in the circuit model; determine an evaluation order of the process, based on the number of register variables whose extracted relationship satisfies a given condition; and convert, into a blocking variable, a register variable which satisfies the given condition in the determined evaluation order of the process among the register variables included in the circuit model.

Abstract: Methods and computer-readable media are disclosed herein for generating asynchronous runtime compatible applications from non-asynchronous applications. In embodiments, source code for the application that is not compatible with asynchronous processing is examined. The source code is parsed in order to identify unsafe functions that will cause failures of the application when processed in an asynchronous runtime. The source code corresponding to those unsafe functions is modified by adding asynchronous functions and commands to the source code and restructuring the source code. The modified source code may then be provided to an asynchronous runtime environment as the application is now compatible with asynchronous processing.

Abstract: Embodiments of the systems described herein can implement one or more processes remotely delivering customized code to a host application and/or computing device. The host application may be configured as an Application Programming Interface with a customized code processing library that may configure the host application to receive further instructions remotely. The host application may be further configured to execute host code and/or third-party code. The host application may be configured to receive remote application logic, after the host application has been installed on a computing device, and to execute the received application logic to alter the behavior of the host application, such as selectively tracking end user interactions.

Abstract: A method of enforcing a deployment static code analysis may comprise receiving human-readable code instructions for a customized software application, compiling the human-readable code instructions into machine-executable code instructions, and performing a customized reporting static code analysis of the machine-executable code instructions to identify a critical code error resulting from violation of a pre-set customized rule associated with a pre-defined terminal risk, via a processor. The method may further comprise receiving an instruction, via a network interface device, from a customer, to release the machine-executable code instructions for the customized software application, automatically terminating release of the machine-executable code instructions via the processor, and transmitting a notification to the customer identifying the pre-defined terminal risk, via the network interface device.

Abstract: An equivalence verification unit (130) judges through equivalence verification, for each of corresponding combinations which are each a combination of a function included in pre-change source code and a function included in post-change source code, whether the functions included in the corresponding combination are equivalent to each other. A partial verification judgment unit (150) judges, for each of inequivalent ones of the corresponding combinations, whether the corresponding combination is a partial verification combination including a function where an inequivalent path, in which an inequivalent function is called, and a non-inequivalent path, in which a non-inequivalent function is called, are both included. A partial verification unit (160) judges, for each of the partial verification combinations, whether the functions included in the partial verification combination are partially equivalent to each other by excluding the inequivalent path and performing the equivalence verification.

Abstract: A method for network configuration validation includes identifying a target network to configure wherein the target network includes one or more switches; generating, within a network device configuration editor having a superset of configuration syntax and allowable settings values, a target network configuration for the target network; receiving a target network configuration grammar including configuration syntax and allowable settings values from the target network by interrogating the target network; limiting the superset to the received target network configuration grammar to create a limited superset; comparing the limited superset to the syntax and settings values in the target network configuration; and indicating syntax errors and settings value errors in the target network configuration.

Abstract: A microcontroller configured to provide secure integrity checking of code or data stored in the microcontroller is provided. The microcontroller may include a processor, memory devices defining a microcontroller memory space, a security attribution unit defining secure memory region(s) and non-secure memory region(s) in the memory space, integrity check tables indicating storage locations of various code within the microcontroller memory space, and an integrity checking unit. The integrity checking unit may be configured to receive an integrity check request for checking the integrity of a first piece of code stored in the microcontroller memory space, access a first integrity check table that indicates a storage location of the first piece of code, determine whether the first integrity check table and first piece of code are stored in the same memory region; and determine whether to perform the requested integrity check based at least on this determination.

Abstract: Methods, systems, and computer-readable media for automated detection of ambiguities in software design diagrams are disclosed. One or more graphs are determined that represent a plurality of elements of a design diagram. The one or more graphs comprise a plurality of nodes representing components and a plurality of edges representing relationships between the components. An evaluation of the design diagram with respect to one or more rules is initiated by a rules engine. The evaluation is based (at least in part) on traversal of the one or more graphs. Based (at least in part) on the evaluation, one or more flaws are identified in the design diagram. A modified design diagram is generated that represents remediation of at least a portion of the one or more flaws.

Abstract: Disclosed herein are systems and methods of compiling resources of a programmable emulation system to execute an emulation process, to emulate a logic system, such as an application-specific integrated circuit (ASIC), currently being tested and prototyped, and then revising, transforming, and moving the compiled instructions sets to inexpensively, quickly, and dynamically adapt to unavailable resources, which may be due to previously allocation to a different emulation job, or for fault tolerance. Relocation of the resources that will execute the emulation job (i.e., “footprint”) may refer to the remapping of a compiled footprint to a revised set of resources, defining a revised footprint. Fault tolerance may refer to support for working around faulty hardware components of the emulation system.

Abstract: A computer implemented method to determine whether a verification is to be performed of the satisfaction of one or more mapping conditions mapping a first state in a first pattern matching automaton to a second state in the first automaton, the verification being based on patterns matched by a second pattern matching automaton having states corresponding to wildcard symbols in the first automaton, the method comprising: associating, with the first state, a minimum number of patterns required to be matched by the second automaton to satisfy a mapping condition of the state; providing a pattern match counter in association with the second automaton, the counter being arranged to count a number of patterns matched by the second automaton; providing a verifier in association with the first automaton, the verifier being arranged to perform the verification, the verifier being responsive to the counter.

Abstract: Software-only and software-hardware optimizations to reduce the overhead of intra-thread instruction duplication on a GPU or other instruction processor are disclosed. The optimizations trade off error containment for performance and include ISA extensions with limited hardware changes and area costs.

Abstract: A computer-implemented method for migrating a monolithic legacy software system to a well-defined modular target software architecture includes selecting a method, based on predefined patterns, for transforming the software legacy software system; creating an abstract syntax tree from the legacy software system's source code; from the abstract syntax tree, determining a flow of the source code and any coding violations and coding smells in the legacy software system's source code; using the flow and the coding violations, identifying architecture issues in the legacy software system; scheduling tasks for transforming the legacy software system into the target software architecture; automatically generating new source code according to the target software architecture; and automatically and autonomously refactoring the new source code.

Abstract: A method for identifying highly-skewed classes using an imperfect annotation of every instance together with a set of features for all instances. The imperfect annotations designate a plurality of instances as belonging to the target rare class and others to the majority class. First, a classifier is trained on the set of features using the imperfect annotation as supervision, to designate each instance to either the rare class or majority class. A combination of the predictions from the trained classifier and the imperfect annotations is then used to classify each instance to either the rare class or majority class. In particular, an instance is classified to the rare class only when both the trained classifier and the imperfect annotation classify the instance to the rare class. Finally, for each instance assigned as a rare class instance by the combination stage, all instances in its neighborhood are re-classified as either rare class or majority class.

Abstract: Examples disclosed herein relate to configuring a network switch. In an example, user-defined configuration data may be included in a startup configuration file of a network switch. A token may be defined in the startup configuration file, wherein the token may represent a command for the network switch. The user-defined configuration data included prior to defining the token may be retained in the startup configuration file. In response to an event to restore factory-default configuration data in the network switch, an option may be provided to apply the user-defined configuration data included prior to the token along with the factory-default configuration data to the network switch. In response to selection of the option, the user-defined configuration data included prior to the token may be applied along with the factory-default configuration data to the network switch.

Abstract: In column domain dictionary compression, column values in one or more columns are tokenized by a single dictionary. The domain of the dictionary is the entire set of columns. A dictionary may not only map a token to a tokenized value, but also to a count (“token count”) of the number of occurrences of the token and corresponding tokenized value in the dictionary's domain. Such information may be used to compute queries on the base table.

Abstract: Systems and methods for a compiler with type inference is described herein. The compiler includes a computer program having one or more variables and context of the variables. The compiler has a type selector to infer a type of the variable using the context of the variable and dereference the variable using the inferred type. Prior to executing the computer program, the compiler carries out a type check of the variable by accessing a recommended type of the variable and comparing the recommended type and the types associated with the context of the variable.

Abstract: Processor hardware detects when memory aliasing occurs, and assures proper operation of the code even in the presence of memory aliasing. Because the hardware can detect and correct for memory aliasing, this allows a compiler to make optimizations such as register promotion even in regions of the code where memory aliasing can occur. The result is code that is more optimized and therefore runs faster.

Abstract: Existing software defect text categorization approaches are based on use of supervised/semi-supervised machine learning techniques, which may require significant amount of labeled training data for each class in order to train the classifier model leading to significant amount of human effort, resulting in an expensive process. Embodiments of the present disclosure provide systems and methods for circumventing the problem of dependency on labeled training data and features derived from source code by performing concept based classification of software defect reports. In the present disclosure, semantic similarity between the defect category/type labels and the software defect report(s) is computed and represented in a concept space spanned by corpus of documents obtained from one or more knowledge bases, and distribution of similarity values are obtained.

Abstract: A method for generating code for queries in a database system includes obtaining a user query in a first programming language, the user query comprising at least one query parameter for selecting data from a content database. The method includes obtaining machine code corresponding to a compiled version of the user query. Obtaining the machine code includes generating code in a second programming language corresponding to a compiled version of the user query, generating byte code defining a plurality of functions corresponding to a compiled version of the code in the second programming language, and obtaining the machine code corresponding to the compiled version of the user query based on the byte code. The method further comprises executing the machine code using the at least one query parameter, thereby returning a result satisfying the at least one query parameter. A related non-transitory computer-readable medium and system are also provided.

Abstract: Embodiments relate to using a local entry point with an indirect call function. More specifically, a linker is provided to generate at application modules that at least partially defines an indirect function call configuration. The linker loads a first address of a function by using a first symbolic reference, and determines that the function pointer value of the first symbolic reference is solely used to perform indirect calls in the same application module, e.g. local-use-only. The linker indicates that the first symbolic reference can be resolved using the local entry point associated with the function, and performs that indirect function call exclusively through the first symbolic reference, thereby reducing execution of operations.

Abstract: An execution environment in a computer system supports a declarative programming model where user code is written with a query syntax in a native programming language to express inherent parallelism in terms of data flow. The execution environment translates queries in the user code into a runtime agnostic representation and dynamically selects an execution runtime for executing the runtime agnostic representation.