Triple graph grammars are introduced to address the lack of generic frameworks and formalisms for data consistency in integrated software tools. They enable high-level specification of interdependencies between graph-like data structures and form the basis for new data integration tools. Graphs are crucial in computer science, used in data flow, control flow, and software engineering diagrams. Graph rewriting systems are suitable for complex transformations but are limited to in-place modifications. They are not suitable for integration or traceability tools that translate or check consistency between data structures. Examples include software requirements and design documents, or program syntax trees and control flow diagrams. Inter-graph relationships require fine-grained m-to-n correspondences, with elements related to distinct elements in another graph, and vertices corresponding to multiple edges. Related graphs may contain referenced and private elements. Inter-graph relationships have annotations about translation or analysis processes and dependencies between them. These are modeled as separate correspondence graphs with references to source and target elements. Data integrators are specified using productions that rewrite three graphs in parallel.Triple graph grammars are introduced to address the lack of generic frameworks and formalisms for data consistency in integrated software tools. They enable high-level specification of interdependencies between graph-like data structures and form the basis for new data integration tools. Graphs are crucial in computer science, used in data flow, control flow, and software engineering diagrams. Graph rewriting systems are suitable for complex transformations but are limited to in-place modifications. They are not suitable for integration or traceability tools that translate or check consistency between data structures. Examples include software requirements and design documents, or program syntax trees and control flow diagrams. Inter-graph relationships require fine-grained m-to-n correspondences, with elements related to distinct elements in another graph, and vertices corresponding to multiple edges. Related graphs may contain referenced and private elements. Inter-graph relationships have annotations about translation or analysis processes and dependencies between them. These are modeled as separate correspondence graphs with references to source and target elements. Data integrators are specified using productions that rewrite three graphs in parallel.