Comparison of Series output with RAML
All examples are taken from the examples of RAML Prototype Implementation (http://raml.tcs.ifi.lmu.de/prototype). The cost model of these examples are the number of ticks of a specific program point. The corresponding CES file is generated manually.
Cost Analysis of Java Bytecode
This set of examples were obtained by cost analysis of Java Bytecode.
ArrayReverse.ces | : generated from ArrayReverse.java |
BST.ces | : generated from BST.java |
Concat.ces | : generated from Concat.java |
Cons.ces | : generated from Cons.java |
Delete.ces | : generated from Delete.java |
DetEval.ces | : generated from DetEval.java |
DivByTwo.ces | : generated from DivByTwo.java |
EvenDigits.ces | : generated from EvenDigits.java |
EvenDigitsNew.ces | |
FactSum.ces | : generated from FactSum.java |
FactSumNew.ces | |
Factorial.ces | : generated from Factorial.java |
Fibonacci.ces | : generated from Fibonacci.java |
FibonacciNew.ces | |
Hanoi.ces | : generated from Hanoi.java |
Incr.ces | : generated from Incr.java |
LinEqSolve.ces | : generated from LinearEq.java |
ListInter.ces | : generated from ListInter.java |
ListReverse.ces | : generated from ListReverse.java |
MatMult.ces | : generated from MatMult.java |
Matrixinverse.ces | : generated from Inverse.java |
MergeList.ces | : generated from MergeList.java |
Polynomial.ces | : generated from Polynomial.java |
Power.ces | : generated from Power.java |
SelectOrd.ces | : generated from SelectOrd.java |
ms.ces |
Basic examples
This set of examples consists of cost relations with different kind of complexities.
ack.ces | |
direct_n_log_n.ces | |
divide_and_conquer.ces | |
exponential.ces | |
linear.ces | |
logarithmic.ces | |
merge.ces | |
ms.ces | |
mspe.ces | |
n_log_n.ces | |
no_cover_point.ces | |
quadratic.ces |