Abstract: Embodiments of the invention identify entities stored within or across a number of data stores and identify relationships between the entities. A relationships graph is generated that represents the entities and the identified relationships between entities, the relationships graph comprising nodes in the relationships graph to represent one or more entities and edges between any two nodes in the relationships graph to represent the identified relationships between the one or more entities represented by each of the two nodes. The relationships graph is stored in a graph store. A graph query is received against selected nodes and edges in the graph store. One or more data store queries are generated therefrom, to be executed against respective selected ones of the one or more entities and their respective identified relationships based on the graph query and the graph store. The one or more data store queries are applied to selected one or more of the number of data stores.

Abstract: A system and method for providing formal property verification across circuit design versions is described. In one embodiment, the system receives a first version and a second version of a circuit design. The received first version has a first set of constraints, a first set of next-state functions representing the first version of the circuit design, and a first property that has been verified as true for the first version of the circuit design. The received second version has a second set of constraints, a second set of next-state functions representing the second version of the circuit design, and a second property for the second version of the circuit design. The described embodiments further construct a composite circuit design based on the first set of constraints, the first set of next-state functions, and the first property and further based on the second set of constraints, the second set of next-state functions, and the second property.

Abstract: Embodiments of the invention identify entities stored within or across a number of data stores and identify relationships between the entities. A relationships graph is generated that represents the entities and the identified relationships between entities, the relationships graph comprising nodes in the relationships graph to represent one or more entities and edges between any two nodes in the relationships graph to represent the identified relationships between the one or more entities represented by each of the two nodes. The relationships graph is stored in a graph store. A graph query is received against selected nodes and edges in the graph store. One or more data store queries are generated therefrom, to be executed against respective selected ones of the one or more entities and their respective identified relationships based on the graph query and the graph store. The one or more data store queries are applied to selected one or more of the number of data stores.