RanK online demonstrator
[Download RanK]
[Benchmarks]
[Help]
User input
Enter your program:
OR choose an example:
(analyze my program)
aaron2.c
aaron3.c
aaron12.c
ax.c
catmouse.c
complex.c
counterex1a.c
counterex1b.c
counterex1c.c
cousot9.c
easy1.c
easy2.c
exmini.c
fac.c
gcd.c
heapsort.c
insertsort.c
loops.c
ndecr.c
nd_loop.c
nestedLoop.c
perfect1.c
perfect2.c
perfect.c
perfectg.c
random1d.c
random2d.c
real2.c
realbubble.c
realheapsort.c
realheapsort_step1.c
realheapsort_step2.c
realselect.c
realshellsort.c
relation1.c
rsd.c
serpent.c
sipma91.c
sipmabubble.c
sipmamergesort2.c
sipmamergesort.c
speedDis1.c
speedDis2.c
speedFails1.c
speedFails2.c
speedFails3.c
speedFails4.c
speedNestedMultiple.c
speedNestedMultipleDep.c
speedpldi2.c
speedpldi3.c
speedpldi4.c
speedSimpleMultiple.c
speedSimpleMultipleDep.c
speedSingleSingle2.c
speedSingleSingle.c
terminate.c
terminatorbubble.c
unperfect.c
wcet0.c
wcet1.c
wcet2.c
while2.c
wise.c
Input:
Integer interpreted automaton (.fst format)
C program (*)
Options:
Compute worst-case computational complexity (WCCC)
Require non-negativity on cut-points only (may simplify the ranking function)
Show transitions resolved for each dimension
---
can't open file