=========================
         DDJ 2.6
=========================
+ Implements the Loop Expansion technique. 
+ Implements an optimized (clever) version of Tree compresion. 
+ Augments the precision when highlighting the source code associated with a node. 
+ Allows the user to rename the methods associated with nodes in the ET (this is particularly useful when combined with Loop Expansion).
+ When selecting a Java file, it only displays those that really contain a method "main".

=========================
         DDJ 2.5
=========================
+ Works with Windows, Linux and Mac. 
+ Can debug programs without using the database (the database and the caches architecture is automatically used by the debugger only if it detects a database in the system). 
+ The tree compression and the balancing techniques are now compatible and can be used at the same time. 
+ Contains new hybrid strategies.
+ Implements Optimal D&Q. 
+ Implements the memento pattern for undo and redo cappabilities. 
+ The pannels in the GUI with information about nodes have been improved and they now show the information more readable.

=========================
         DDJ 2.4
=========================
+ Allows to debug programs without having generated their whole ET. 
+ Corrects some detected small bugs in the source code. 
+ Allows the debugger to automatically balance the ET.
+ Allows to project and collapse nodes of the ET .
+ The strategies for algorithmic debugging have been adapted to work with projected and collapsed nodes. 
+ The GUI is able to ask complex questions of projected/collapsed nodes.

=========================
         DDJ 2.3
=========================
+ Completely reorganizes the architecture. Now, four threads run in parallel constructing the ET and asking questions concurrently. 
+ The debugger can work now with incomplete ETs.
+ The GUI has been improved with the presentation cache.
+ The strategies for algorithmic debugging have been reimplemented.