Index: tests/concurrent/examples/boundedBufferEXT.c
===================================================================
--- tests/concurrent/examples/boundedBufferEXT.c	(revision 0e0f128c9f975b8eb3f6b0870c12c639668ef24c)
+++ tests/concurrent/examples/boundedBufferEXT.c	(revision 0c1d2403885f5c3b07ea42809effc74e475e97ad)
@@ -8,6 +8,6 @@
 // Created On       : Wed Apr 18 22:52:12 2018
 // Last Modified By : Peter A. Buhr
-// Last Modified On : Wed May  2 16:12:58 2018
-// Update Count     : 7
+// Last Modified On : Thu Aug 16 08:17:03 2018
+// Update Count     : 8
 //
 
@@ -73,5 +73,5 @@
 void main( Consumer & cons ) with( cons ) {
 	sum = 0;
-	for ( ;; ) {
+	for () {
 		yield( random( 5 ) );
 		int item = remove( buffer );
Index: tests/concurrent/examples/boundedBufferINT.c
===================================================================
--- tests/concurrent/examples/boundedBufferINT.c	(revision 0e0f128c9f975b8eb3f6b0870c12c639668ef24c)
+++ tests/concurrent/examples/boundedBufferINT.c	(revision 0c1d2403885f5c3b07ea42809effc74e475e97ad)
@@ -8,6 +8,6 @@
 // Created On       : Mon Oct 30 12:45:13 2017
 // Last Modified By : Peter A. Buhr
-// Last Modified On : Thu Apr 26 23:08:17 2018
-// Update Count     : 82
+// Last Modified On : Thu Aug 16 08:17:58 2018
+// Update Count     : 83
 //
 
@@ -74,5 +74,5 @@
 void main( Consumer & cons ) with( cons ) {
 	sum = 0;
-	for ( ;; ) {
+	for () {
 		yield( random( 5 ) );
 		int item = remove( buffer );
Index: tests/concurrent/examples/quickSort.c
===================================================================
--- tests/concurrent/examples/quickSort.c	(revision 0e0f128c9f975b8eb3f6b0870c12c639668ef24c)
+++ tests/concurrent/examples/quickSort.c	(revision 0c1d2403885f5c3b07ea42809effc74e475e97ad)
@@ -9,6 +9,6 @@
 // Created On       : Wed Dec  6 12:15:52 2017
 // Last Modified By : Peter A. Buhr
-// Last Modified On : Tue Jan 30 15:58:58 2018
-// Update Count     : 162
+// Last Modified On : Thu Aug 16 08:17:41 2018
+// Update Count     : 163
 //
 
@@ -131,5 +131,5 @@
 
 	if ( &unsortedfile ) {								// generate output ?
-		for ( ;; ) {
+		for () {
 			unsortedfile | size;						// read number of elements in the list
 		  if ( eof( unsortedfile ) ) break;