X-Git-Url: http://git.efficios.com/?p=babeltrace.git;a=blobdiff_plain;f=CONTRIBUTING.adoc;h=bc6ff471ec403e22e6f2e1698ed35211eedee2f2;hp=f18f9b06d49517e739e575ad8ae20cb757942b35;hb=56e18c4ce186892c36d7f2cb5078087425e60134;hpb=44c440bc5fe8219cc17d1b786d91fd83c4c9860a

diff --git a/CONTRIBUTING.adoc b/CONTRIBUTING.adoc
index f18f9b06..bc6ff471 100644
--- a/CONTRIBUTING.adoc
+++ b/CONTRIBUTING.adoc
@@ -69,9 +69,9 @@ node of the graph keeps all other reachable nodes alive.
 
 The scheme employed in Babeltrace to break this cycle consists in the
 "children" holding *reverse component references* to their parents. That
-is, in the context of CTF IR, that event classes hold a reference to
-their parent stream class and stream classes hold a reference to their
-parent trace.
+is, in the context of the trace IR, that event classes hold a reference
+to their parent stream class and stream classes hold a reference to
+their parent trace.
 
 On the other hand, parents hold *claiming aggregation references* to
 their children. A claiming aggregation reference means that the object