Index: doc/papers/concurrency/Paper.tex
===================================================================
--- doc/papers/concurrency/Paper.tex	(revision c3a20076b8a200705a2195939484a811f2b28b8f)
+++ doc/papers/concurrency/Paper.tex	(revision 152c2b2495f95d3439eb15f85f3d8bcaacf76d24)
@@ -253,4 +253,6 @@
 \lstMakeShortInline@%
 
+\newcommand{\commenttd}[1]{{\color{red}{Thierry : #1}}}
+
 \let\OLDthebibliography\thebibliography
 \renewcommand\thebibliography[1]{
@@ -970,5 +972,5 @@
 % }
 % int main() {
-% 
+%
 % 	for ( int i = 0; i < 10; i += 1 ) {
 % 		printf( "%d\n", fib() );
@@ -1707,5 +1709,5 @@
 		if ( random() % 3 ) transfer( b1, b2, 7 );
 	}
-}    
+}
 int main() {
 	`Person p1 = { b1, b2 }, p2 = { b2, b1 };`
@@ -1737,5 +1739,5 @@
 		if ( random() % 3 ) transfer( b1, b2, 7 );
 	}
-}    
+}
 int main() {
 	`thread p1(person, ref(b1), ref(b2)), p2(person, ref(b2), ref(b1));`
@@ -1915,5 +1917,5 @@
 % forall( otype T ) { // distribute forall
 % 	monitor Buffer {
-% 
+%
 % 		int front, back, count;
 % 		T elements[10];
@@ -1927,10 +1929,10 @@
 % 		if ( count == 10 ) `waitfor( remove, buffer )`;
 % 		// insert elem into buffer
-% 
+%
 % 	}
 % 	T remove( Buffer(T) & mutex buffer ) with(buffer) {
 % 		if ( count == 0 ) `waitfor( insert, buffer )`;
 % 		// remove elem from buffer
-% 
+%
 % 		return elem;
 % 	}
@@ -2540,5 +2542,5 @@
 % \section{Parallelism}
 % \label{s:Parallelism}
-% 
+%
 % Historically, computer performance was about processor speeds.
 % However, with heat dissipation being a direct consequence of speed increase, parallelism is the new source for increased performance~\cite{Sutter05, Sutter05b}.
@@ -2547,8 +2549,8 @@
 % However, kernel threads are better as an implementation tool because of complexity and higher cost.
 % Therefore, different abstractions are often layered onto kernel threads to simplify them, \eg pthreads.
-% 
-% 
+%
+%
 % \subsection{User Threads}
-% 
+%
 % A direct improvement on kernel threads is user threads, \eg Erlang~\cite{Erlang} and \uC~\cite{uC++book}.
 % This approach provides an interface that matches the language paradigms, gives more control over concurrency by the language runtime, and an abstract (and portable) interface to the underlying kernel threads across operating systems.
@@ -2556,5 +2558,5 @@
 % Like kernel threads, user threads support preemption, which maximizes nondeterminism, but increases the potential for concurrency errors: race, livelock, starvation, and deadlock.
 % \CFA adopts user-threads to provide more flexibility and a low-cost mechanism to build any other concurrency approach, \eg thread pools and actors~\cite{Actors}.
-% 
+%
 % A variant of user thread is \newterm{fibres}, which removes preemption, \eg Go~\cite{Go} @goroutine@s.
 % Like functional programming, which removes mutation and its associated problems, removing preemption from concurrency reduces nondeterminism, making race and deadlock errors more difficult to generate.