A computer-implemented method (and corresponding system) is provided, that enables or facilitates the execution of a portion of source code, written in a high-level language (HLL), on a blockchain platform. The method and system can include a blockchain compiler, arranged to convert a portion of high-level source code into a form that can be used with a blockchain platform. This may be the Bitcoin blockchain or an alternative. The method can include: receiving the portion of source code as input; and generating an output script comprising a plurality of op_codes. The op_codes are a subset of op_codes that are native to a functionally-restricted, blockchain scripting language. The outputted script is arranged and/or generated such that, when executed, the script provides, at least in part, the functionality specified in the source code. The blockchain scripting language is restricted such that it does not natively support complex control-flow constructs or recursion via jump-based loops or other recursive programming constructs. The step of generating the output script may comprise the unrolling at least one looping construct provided in the source code. The method may further comprise providing or using an interpreter or virtual machine arranged to convert the output script into a form that is executable on a blockchain platform.

Systems, methods and computer program products for providing a multi-tenant application execution environment that provides an object metadata service for managing application configuration in the multi-tenant environment. In one embodiment, a system has an application manager, a bundle manager, and a deployment manager. The application manager captures application metadata for a corresponding version of an application and defines a corresponding bundle which contains metadata that configures the version of the application. The bundle manager validates each bundle and stores the validated bundle in a bundle library in a data storage device. The deployment manager retrieves a master schema and one or more of the bundles from the bundle library and installs the retrieved master schema and the retrieved bundles, generating a tenant schema which is accessible by a corresponding tenant of the multi-tenant environment that has subscribed to the version of the application.

A first package corresponding to a first system and a second package corresponding to a second system are downloaded from a center device, and an update data is extracted from the first package and the second package. An electronic control device as a write target installs the update data and activates the update data after an install of the update data is completed. All electronic control devices as a first write target corresponding to the first system and all electronic control devices as a second write target corresponding to the second system are instructed at a same timing to activate the update data after completing the install of the update data in all the electronic control devices.

Deterministic memory allocation for real-time applications. In an embodiment, bitcode is scanned to detect calls by a memory allocation function to a dummy function. Each call uses parameters comprising an identifier of a memory pool and a size of a data type to be stored in the memory pool. For each detected call, an allocation record, comprising the parameters, is generated. Then, a header file is generated based on the allocation records. The header file may comprise a definition of bucket(s) and a definition of memory pools. Each definition of a memory pool may identify at least one bucket.

Disclosed embodiments relate to systems and methods for discovering and remediating hidden secrets in code files. Techniques include accessing an element of source code for analysis, performing a static analysis of the element of source code, and generating a control flow representation that identifies a plurality of functions and a sequence of functions associated with the element of the source code. The techniques may further include determining a probability of a hidden secret being included in the element of source code and performing a security action of at least one of: generating an alert, displaying a visual indication of the probability, generating a report associated with the hidden secret, sending data associated with the probability to a machine learning system for training the machine learning system, or a remediating action associated with the hidden secret.

A center includes one or more processors configured to: distribute, to an OTA master, campaign data including one or more pieces of package data, each of which includes one or more pieces of update software of one or more target ECUs included in a vehicle; determine, after distributing the campaign data, whether a defect involved in an update of the one or more target ECUs is found in the one or more pieces of package data included in the campaign data; and transmit, when determining that the defect is found, an application avoidance instruction to the vehicle to which the campaign data is to be applied via the network, the application avoidance instruction instructing the OTA master not to apply a piece of package data in which the defect is found at a timing of applying the campaign data.

Disclosed are various embodiments for isolated code detection from application code analysis. Various application components may be identified from a source code file or a bytecode file of a computing application. A graph model representative of the computing application is generated having nodes and bridges that connect some nodes to other nodes. The graph model is generated such that at least one of the nodes is an isolated node having less than a threshold number of bridges connecting to other nodes, which is indicative that a corresponding one of the application components can be implemented as an independently deployable component of the computing application.

A method for providing automatic restatement of a data environment includes receiving a request for restatement of a first dataset, accessing dependency data that describes a set of dependencies between the first dataset and one or more other datasets in the computer data environment, examining the dependency data to automatically identify one or more second dataset from among the one or more other datasets, the second datasets being datasets from which the first dataset depends, examining a first timing data related to the restatement of the first dataset and a second timing data related to the restatement of the identified second datasets to identify one or more third datasets from among the second datasets that require restatement as a result of the restatement of the first dataset, generating a restatement plan based on the identified third datasets, and initiating automatic execution of the restatement plan.

A method of creating a software image of a solution to be deployed in a virtualized computing environment includes: retrieving a schema of the solution and determining from the schema software products that are required by the solution and software features that are required by the solution; for each software product, selecting a version of the software product to include in the solution and identifying software features provided by the selected version of the software product; and upon confirming that the selected versions of the software products provide all of the software features that are required, creating the software image of the solution that includes the selected version of each of the software products, and saving the software image in a storage device for deployment in the virtualized computing environment.

Techniques for determining processing layouts to nodes of a dataflow graph. The techniques include: obtaining information specifying a dataflow graph, the dataflow graph comprising a plurality of nodes and a plurality of edges connecting the plurality nodes, the plurality of edges representing flows of data among nodes in the plurality of nodes, the plurality of nodes comprising: a first set of one or more nodes; and a second set of one or more nodes disjoint from the first set of nodes; obtaining a first set of one or more processing layouts for the first set of nodes; and determining a processing layout for each node in the second set of nodes based on the first set of processing layouts and one or more layout determination rules, the one or more layout determination rules including at least one rule for selecting among processing layouts having different degrees of parallelism, and information indicating that data generated by at least one node in the first and/or third set of nodes is not used by any nodes in the dataflow graph downstream from the at least one node.