Created
March 4, 2019 23:44
-
-
Save ufarooq/0edbe775baf5505bdbdc772c4699311e to your computer and use it in GitHub Desktop.
Test cases for Liveness Analysis
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
void test1(int a, int b, int c, int d, int e, int f) { | |
a = c + 11; | |
b = f * e; | |
while (a < b) { | |
a = b * c; | |
d = b; | |
if (d > c) | |
b = b + 1; | |
else | |
e = d * c; | |
f = b * c; | |
} | |
} | |
void test2(int a, int b, int c, int d, int i) { | |
while (i < 100) { | |
a = 210; | |
if (c > 20) { | |
a = 100 * 2; | |
if (d < 100) { | |
d = 101; | |
} else { | |
c = 100 * 120; | |
} | |
b = 300 + 210; | |
} else { | |
b = 21 + 210; | |
c = 212 * 12; | |
d = 200 * 11; | |
} | |
int y = a + b; | |
int z = c + d; | |
i = i + 1; | |
} | |
} | |
void test3(int a, int b, int d) { | |
int e = a + b; | |
do { | |
d = d + b; | |
e = e - 1; | |
} while (e > 0); | |
d++; | |
} | |
void test4(int N, int p, int sum) { | |
int i = 0; | |
while (i < N) { | |
sum = sum + p; | |
if (i > 3) | |
p = 0; | |
else | |
p++; | |
i++; | |
} | |
} | |
void test5(int a, int b, int x, int y, int N) { | |
int k = 2; | |
if (a < N * 2) { | |
a = k + 2; | |
x = 5; | |
} else { | |
a = k * 2; | |
x = 8; | |
} | |
k = a; | |
while (k < N) { | |
b = 2; | |
x = a + k; | |
y = a * b; | |
k++; | |
} | |
int z = a + x; | |
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
public class Test { | |
public static void main(String[] args) { | |
} | |
private static void test1(int a, int b, int c, int d, int e, int f) { | |
a = c + 11; | |
b = f * e; | |
while (a < b) { | |
a = b * c; | |
d = b; | |
if (d > c) | |
b = b + 1; | |
else | |
e = d * c; | |
f = b * c; | |
} | |
} | |
private static void test2(int a, int b, int c, int d, int i) { | |
while (i < 100) { | |
a = 210; | |
if (c > 20) { | |
a = 100 * 2; | |
if (d < 100) { | |
d = 101; | |
} else { | |
c = 100 * 120; | |
} | |
b = 300 + 210; | |
} else { | |
b = 21 + 210; | |
c = 212 * 12; | |
d = 200 * 11; | |
} | |
int y = a + b; | |
int z = c + d; | |
i = i + 1; | |
} | |
} | |
private static void test3(int a, int b, int d) { | |
int e = a + b; | |
do { | |
d = d + b; | |
e = e - 1; | |
} while (e > 0); | |
d++; | |
} | |
public static void test4(int N, int p, int sum) { | |
int i = 0; | |
while (i < N) { | |
sum = sum + p; | |
if (i > 3) | |
p = 0; | |
else | |
p++; | |
i++; | |
} | |
} | |
public static void test5(int a, int b, int x, int y, int N) { | |
int k = 2; | |
if (a < N * 2) { | |
a = k + 2; | |
x = 5; | |
} else { | |
a = k * 2; | |
x = 8; | |
} | |
k = a; | |
while (k < N) { | |
b = 2; | |
x = a + k; | |
y = a * b; | |
k++; | |
} | |
int z = a + x; | |
} | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment