 07 Jul, 2015 7 commits


POTTIER Francois authored

POTTIER Francois authored
A slight speed improvement, maybe 5%.

POTTIER Francois authored
This seems to save a little time, but not as much as hoped.

POTTIER Francois authored

POTTIER Francois authored

POTTIER Francois authored

POTTIER Francois authored

 06 Jul, 2015 8 commits


POTTIER Francois authored

POTTIER Francois authored
This leads to slightly fewer questions in the main analysis (10% on c.mly) and many fewer nodes considered during backward search (4K instead of 60K on c.mly), yet it is slightly slower (+10% on c.mly).

POTTIER Francois authored

POTTIER Francois authored

POTTIER Francois authored

POTTIER Francois authored

POTTIER Francois authored

POTTIER Francois authored

 03 Jul, 2015 25 commits


POTTIER Francois authored

POTTIER Francois authored

POTTIER Francois authored
Generalized [Dijkstra] to return all distances.

POTTIER Francois authored

POTTIER Francois authored

POTTIER Francois authored

POTTIER Francois authored

POTTIER Francois authored

POTTIER Francois authored

POTTIER Francois authored

POTTIER Francois authored

POTTIER Francois authored
Added [Dijkstra], homemade. Modified [Coverage] to use [Dijkstra]. Also found a heavy bug where [causes_an_error] used [s] instead of [s']?

POTTIER Francois authored

POTTIER Francois authored

POTTIER Francois authored
This actually speeds things up (almost 2x).

POTTIER Francois authored

POTTIER Francois authored

POTTIER Francois authored
New performance counter [bs].

POTTIER Francois authored

POTTIER Francois authored
entry states.

POTTIER Francois authored
triggering an error in this state. This is about 10x faster for alphaCaml.mly. Still, alphaprolog.mly does not go through.

POTTIER Francois authored
Try to reach a pair (s', z) only if this pair causes an error.

POTTIER Francois authored

POTTIER Francois authored

POTTIER Francois authored
The second analysis (backward search) replaces them.
