The CLP Heap Solver has been integrated in the web interface of PET. The following table allows the user to run a set of benchmarks and compare the results obtained by the standard execution of PET with no aliasing, the execution of PET considering aliasing explicitly and the execution of PET using the CLP Heap Solver.
Benchmark | PET Standard | PET+Aliasing | CLP Heap Solver |
---|---|---|---|
DoublyLinkedList.add | Run | Run | Run |
NodeSequence.removeAt | Run | Run | Run |
NodeSequence.replaceAt | Run | Run | Run |
SortedListPriorityQueue.insert | Run | Run | Run |
SortedListPriorityQueue.remove | Run | Run | Run |
BinarySearchTree.addAll | Run | Run | Run |
BinarySearchTree.find | Run | Run | Run |
BinarySearchTree.findAll | Run | Run | Run |
BinarySearchTree.insert | Run | Run | Run |
BinarySearchTree.remove | Run | Run | Run |
HeapPriorityQueue.insert | Run | Run | Run |
HeapPriorityQueue.remove | Run | Run | Run |