Index: tests/concurrent/examples/matrixSum.c
===================================================================
--- tests/concurrent/examples/matrixSum.c	(revision 73abe950d807eab747c9e14353b158fcca827308)
+++ tests/concurrent/examples/matrixSum.c	(revision 7b3a6e63ee6eed4ce07650549824ebb9065b01d2)
@@ -11,6 +11,6 @@
 // Created On       : Mon Oct  9 08:29:28 2017
 // Last Modified By : Peter A. Buhr
-// Last Modified On : Fri May 25 09:34:27 2018
-// Update Count     : 10
+// Last Modified On : Thu Aug  9 09:17:30 2018
+// Update Count     : 13
 //
 
@@ -30,5 +30,5 @@
 void main( Adder & adder ) with( adder ) {				// thread starts here
 	subtotal = 0;
-	for ( int c = 0; c < cols; c += 1 ) {
+	for ( c; cols ) {
 		subtotal += row[c];
 	} // for
@@ -36,19 +36,19 @@
 
 int main() {
-	const int rows = 10, cols = 1000;
+	/* const */ int rows = 10, cols = 1000;
 	int matrix[rows][cols], subtotals[rows], total = 0;
 	processor p;										// add kernel thread
 
-	for ( int r = 0; r < rows; r += 1 ) {
-		for ( int c = 0; c < cols; c += 1 ) {
+	for ( r; rows ) {
+		for ( c; cols ) {
 			matrix[r][c] = 1;
 		} // for
 	} // for
 	Adder * adders[rows];
-	for ( int r = 0; r < rows; r += 1 ) {				// start threads to sum rows
+	for ( r; rows ) {									// start threads to sum rows
 		adders[r] = &(*malloc()){ matrix[r], cols, subtotals[r] };
 //		adders[r] = new( matrix[r], cols, &subtotals[r] );
 	} // for
-	for ( int r = 0; r < rows; r += 1 ) {				// wait for threads to finish
+	for ( r; rows ) {									// wait for threads to finish
 		delete( adders[r] );
 		total += subtotals[r];							// total subtotals
