Abstract: A method, including accessing a source database including records stored in tables organized in a hierarchy defining respective parent and dependent tables of the tables in the source database and containing respective parent and dependent records of the records, each record including one or more attributes having respective values. A selection is received for at least a first table and one or more second tables that are related to the first table by being parent tables or dependent tables of the first table. A filtering request is received that includes, for a given attribute having one or more distinct values, a limiting number of records to select having each of the distinct values. The request is applied to select a subset of the records in the one of the tables. A target database is generated including the subset and the records that are related to the records in the subset.

Abstract: A method, including accessing a source database including records stored in tables, which are organized in a hierarchy defining respective parents and dependents of the tables, containing respective parent and dependent records, the records including attribute values. Upon presenting a first list of the tables, an input is received selecting a first table. Upon presenting a second list of the tables related to the first table, an input is received selecting a second table in the second list. Upon presenting filtering criteria for the selected tables, a filtering request is received for a given selected table. The request is applied to the given selected table to select a subset of the records in the given selected table and to generate a target database including the subset of the records and the records in the set that are the respective directly related records of the records in the subset.

Abstract: Data representing ownership of a traditional asset of a first party having a predefined monetary value stored at a first party network node is replicated to a plurality of other party network nodes, including a second party network node, communicably coupled to the first party network node and to one another. Entry of data is received at the first party network node that represents a partition by the first party of the asset of the first party on a non-value axis into at least two non-overlapping assets and a transfer of ownership of one of those two assets to the second party. The data representing the partition of the non-value axis and transfer of ownership of one of the two non-overlapping assets to the second party is replicated to the plurality of other party nodes, including the second party network node.

Abstract: A method, including accessing a source database including records stored in tables, which are organized in a hierarchy defining respective parents and dependents of the tables, containing respective parent and dependent records, the records including attribute values. Upon presenting a first list of the tables, an input is received selecting a first table. Upon presenting a second list of the tables related to the first table, an input is received selecting a second table in the second list. Upon presenting filtering criteria for the selected tables, a filtering request is received for a given selected table. The request is applied to the given selected table to select a subset of the records in the given selected table and to generate a target database including the subset of the records and the records in the set that are the respective directly related records of the records in the subset.

Abstract: The present disclosure relates to software development and, more specifically, to continuous integration (CI) based software development systems, methods, and computer program products in which a system-under-test (SUT) is populated with production data that has been filtered or transformed, or both. In accordance with this approach, the filtered or transformed production test data can be automatically generated and seamlessly integrated into a continuous integration process. In some examples, the resulting filtered or transformed test data closely reflects real production data while, at the same time, consuming less data storage space and protecting an individual's sensitive information.

Abstract: The present disclosure relates to software development and, more specifically, to continuous integration (CI) based software development systems, methods, and computer program products in which a system-under-test (SUT) is populated with production data that has been filtered or transformed, or both. In accordance with this approach, the filtered or transformed production test data can be automatically generated and seamlessly integrated into a continuous integration process. In some examples, the resulting filtered or transformed test data closely reflects real production data while, at the same time, consuming less data storage space and protecting an individual's sensitive information.

Abstract: A system and a method are disclosed for processing hierarchical data structures, for example, XML (extensible markup language) documents. A tree view shows a visual representation of the input schema and the output schema and visual representations of associations between nodes from the input schema and output schema. A grid view shows mapping statements configured to map the input hierarchical data structure conforming to the input schema to an output hierarchical data structure conforming to the output schema. The grid view and the tree view are synchronized such that modifications performed using any one view result in corresponding modifications being presented in the other view. Modifications to mapping statements are validated to determine if path expressions used in the mapping statements are valid in the modified mapping statements.

Abstract: The present disclosure relates to software development and, more specifically, to continuous integration (CI) based software development systems, methods, and computer program products in which a system-under-test (SUT) is populated with production data that has been filtered or transformed, or both. In accordance with this approach, the filtered or transformed production test data can be automatically generated and seamlessly integrated into a continuous integration process. In some examples, the resulting filtered or transformed test data closely reflects real production data while, at the same time, consuming less data storage space and protecting an individual's sensitive information.

Abstract: The present disclosure relates to software development and, more specifically, to continuous integration (CI) based software development systems, methods, and computer program products in which a system-under-test (SUT) is populated with production data that has been filtered or transformed, or both. In accordance with this approach, the filtered or transformed production test data can be automatically generated and seamlessly integrated into a continuous integration process. In some examples, the resulting filtered or transformed test data closely reflects real production data while, at the same time, consuming less data storage space and protecting an individual's sensitive information.

Abstract: Device, system and method of modeling homogeneous information. For example, a method that includes providing to a model-based application an input model including a refinable homogeneous record having a base type, wherein said homogeneous record is defined with a homogeneous constraint to only include data members of a type compatible with the base type. The homogeneous record is defined in a modeling environment that is able to automatically enforce the homogeneous constraint for the homogeneous record and for refinements thereof.

Abstract: A method for solving a constraint satisfaction problem (CSP) comprises identifying a first illegal combination associated with at least one variable, wherein the first illegal combination contradicts at least one constraint; grouping the first illegal combination with a second illegal combination, in response to determining that the first and second illegal combinations contradict the same constraint; identifying at least one failure explanation for each group of illegal combinations, wherein the failure explanation is associated with at least one illegal combination in said group to provide a reason for a contradicted constraint associated with the illegal combination; assigning a value to each variable in the given domain to solve the CSP within the limitations defined by the constraints in a solution path; and generating a result, in response to determining that at least one assigned value to a variable contradicts a constraint.

Abstract: A method for solving a constraint satisfaction problem (CSP) comprises identifying a first illegal combination associated with at least one variable, wherein the first illegal combination contradicts at least one constraint; grouping the first illegal combination with a second illegal combination, in response to determining that the first and second illegal combinations contradict the same constraint; identifying at least one failure explanation for each group of illegal combinations, wherein the failure explanation is associated with at least one illegal combination in said group to provide a reason for a contradicted constraint associated with the illegal combination; assigning a value to each variable in the given domain to solve the CSP within the limitations defined by the constraints in a solution path; and generating a result, in response to determining that at least one assigned value to a variable contradicts a constraint.

Abstract: A computer software product is provided.

Abstract: Systems and methods for solving a constraint satisfaction problem (CSP) defined by one or more variables, constraints and probabilistic requests (PRs) are provided. In one embodiment, each PR is mapped onto a set of constraints that implement the PR. The CSP solver then finds a series of solutions to the CSP. For each solution, if a constraint associated with a PR is satisfied, then a success counter for that PR is incremented; else a failure counter for that PR is incremented. If the constraint was not considered for the purpose of solving the CSP, then the failure counter for the PR associated with the constraint is incremented.

Abstract: A method for solving a constraint satisfaction problem (CSP) comprises identifying a first illegal combination associated with at least one variable, wherein the first illegal combination contradicts at least one constraint; grouping the first illegal combination with a second illegal combination, in response to determining that the first and second illegal combinations contradict the same constraint; identifying at least one failure explanation for each group of illegal combinations, wherein the failure explanation is associated with at least one illegal combination in said group to provide a reason for a contradicted constraint associated with the illegal combination; assigning a value to each variable in the given domain to solve the CSP within the limitations defined by the constraints in a solution path; and generating a result, in response to determining that at least one assigned value to a variable contradicts a constraint.

Abstract: A computer-implemented method for verification of a hardware design includes specifying requests to allocate regions in a memory of the hardware design, such that at least two of the requests are specified independently of one another. The requests indicate respective allocation types. Overlap restrictions are specified between at least some of the allocation types. The requests and the overlap restrictions are automatically converted to a constraint satisfaction problem (CSP), which includes CSP constraints based on the requests, the allocation types and the overlap restrictions. The CSP is solved to produce a random test program, which includes a memory map that allocates the regions in the memory while complying with the requests and the overlap restrictions. The test program is applied to the hardware design.

Abstract: Systems and methods for solving a constraint satisfaction problem (CSP) defined by one or more variables, constraints and probabilistic requests (PRs) are provided. In one embodiment, each PR is mapped onto a set of constraints that implement the PR. The CSP solver then finds a series of solutions to the CSP. For each solution, if a constraint associated with a PR is satisfied, then a success counter for that PR is incremented; else a failure counter for that PR is incremented. If the constraint was not considered for the purpose of solving the CSP, then the failure counter for the PR associated with the constraint is incremented.

Abstract: A data processing system for editing a document written in a markup language is provided.

Abstract: A computer software product is provided.

Abstract: The input for a test generator is a plurality of test templates, each of which typically aims at covering a specific verification task. Test templates direct the production of distinct transactions, which are the atomic functional building blocks of the design-under-verification. Test templates directed to different hardware functions of the scenario are dynamically interleaved. In this way several transactions are combined together in complex statements in order to achieve a complex test scenario. The transactions are submitted to the test generator, which generates test cases, in which the different hardware functions of the scenario are exercised in combinations. Variation among the test cases is achieved through a large number of random decisions made during the generation process.