diff -r 28dc692f3b11 -r 3a1f262311cf rt/emul/compacttest/src/test/java/org/apidesign/bck2brwsr/tck/IntegerArithmeticTest.java
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/rt/emul/compacttest/src/test/java/org/apidesign/bck2brwsr/tck/IntegerArithmeticTest.java	Wed Nov 19 19:32:00 2014 +0100
@@ -0,0 +1,166 @@
+/**
+ * Back 2 Browser Bytecode Translator
+ * Copyright (C) 2012 Jaroslav Tulach <jaroslav.tulach@apidesign.org>
+ *
+ * This program is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation, version 2 of the License.
+ *
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program. Look for COPYING file in the top folder.
+ * If not, see http://opensource.org/licenses/GPL-2.0.
+ */
+package org.apidesign.bck2brwsr.tck;
+
+import org.apidesign.bck2brwsr.vmtest.Compare;
+import org.apidesign.bck2brwsr.vmtest.VMTest;
+import org.testng.annotations.Factory;
+
+/**
+ *
+ * @author Jaroslav Tulach <jtulach@netbeans.org>
+ */
+public class IntegerArithmeticTest {
+    
+    private static int add(int x, int y) {
+        return x + y;
+    }
+    
+    private static int sub(int x, int y) {
+        return x - y;
+    }
+    
+    private static int mul(int x, int y) {
+        return x * y;
+    }
+    
+    private static int div(int x, int y) {
+        return x / y;
+    }
+    
+    private static int mod(int x, int y) {
+        return x % y;
+    }
+    
+    private static int neg(int x) {
+        return (-x);
+    }
+
+    private static float fadd(float x, float y) {
+        return x + y;
+    }
+
+    private static double dadd(double x, double y) {
+        return x + y;
+    }
+    
+    @Compare public int addOverflow() {
+        return add(Integer.MAX_VALUE, 1);
+    }
+    
+    @Compare public int subUnderflow() {
+        return sub(Integer.MIN_VALUE, 1);
+    }
+    
+    @Compare public int addMaxIntAndMaxInt() {
+        return add(Integer.MAX_VALUE, Integer.MAX_VALUE);
+    }
+    
+    @Compare public int subMinIntAndMinInt() {
+        return sub(Integer.MIN_VALUE, Integer.MIN_VALUE);
+    }
+    
+    @Compare public int multiplyMaxInt() {
+        return mul(Integer.MAX_VALUE, 2);
+    }
+    
+    @Compare public int multiplyMaxIntAndMaxInt() {
+        return mul(Integer.MAX_VALUE, Integer.MAX_VALUE);
+    }
+    
+    @Compare public int multiplyMinInt() {
+        return mul(Integer.MIN_VALUE, 2);
+    }
+    
+    @Compare public int multiplyMinIntAndMinInt() {
+        return mul(Integer.MIN_VALUE, Integer.MIN_VALUE);
+    }
+    
+    @Compare public int multiplyPrecision() {
+        return mul(119106029, 1103515245);
+    }
+    
+    @Compare public int division() {
+        return div(1, 2);
+    }
+
+    @Compare public int divisionReminder() {
+        return mod(1, 2);
+    }
+
+    @Compare public int negativeDivision() {
+        return div(-7, 3);
+    }
+
+    @Compare public int negativeDivisionReminder() {
+        return mod(-7, 3);
+    }
+
+    @Compare public int conversionFromFloat() {
+        return (int) fadd(-2, -0.6f);
+    }
+
+    @Compare public int conversionFromDouble() {
+        return (int) dadd(-2, -0.6);
+    }
+
+    @Compare public boolean divByZeroThrowsArithmeticException() {
+        try {
+            div(1, 0);
+            return false;
+        } catch (final ArithmeticException e) {
+            return true;
+        }
+    }
+
+    @Compare public boolean modByZeroThrowsArithmeticException() {
+        try {
+            mod(1, 0);
+            return false;
+        } catch (final ArithmeticException e) {
+            return true;
+        }
+    }
+
+    @Compare public int negate() {
+        return neg(123456);
+    }
+    
+    @Compare public int negateMaxInt() {
+        return neg(Integer.MAX_VALUE);
+    }
+    
+    @Compare public int negateMinInt() {
+        return neg(Integer.MIN_VALUE);
+    }
+    
+    @Compare public int sumTwoDimensions() {
+        int[][] matrix = createMatrix(4, 3);
+        matrix[0][0] += 10;
+        return matrix[0][0];
+    }
+    
+    static int[][] createMatrix(int x, int y) {
+        return new int[x][y];
+    }
+    
+    @Factory
+    public static Object[] create() {
+        return VMTest.create(IntegerArithmeticTest.class);
+    }
+}