- 11 Oct, 2012 14 commits
-
-
Guillaume Melquiond authored
-
MARCHE Claude authored
-
MARCHE Claude authored
-
Guillaume Melquiond authored
-
Guillaume Melquiond authored
-
Guillaume Melquiond authored
-
Guillaume Melquiond authored
Fix the naming of the symmetric conjunction and document the splitting behavior of the asymmetric disjunction.
-
Guillaume Melquiond authored
-
Guillaume Melquiond authored
-
Guillaume Melquiond authored
-
Guillaume Melquiond authored
-
Guillaume Melquiond authored
Fix some documentation typos. Add an empty line at the end of replayer_macros.tex to work around a bug in hevea's lstlisting implementation.
-
Guillaume Melquiond authored
-
Guillaume Melquiond authored
-
- 10 Oct, 2012 12 commits
-
-
Guillaume Melquiond authored
-
Guillaume Melquiond authored
-
Guillaume Melquiond authored
-
Guillaume Melquiond authored
Use the actual html generated by why3session rather than an image for the html version of the documentation.
-
Guillaume Melquiond authored
Do not update the proof duration if it changed by less than 10% or 0.1s, so as to avoid diff noise in session files.
-
Guillaume Melquiond authored
The only significant difference between these functions is that the first one is calling a callback function at each step, while the second one is generating a report at the end. Any other differences are likely to be actual bugs, which hopefully are now fixed. Now both functions call a third one, which accepts callbacks that encompass all the previous features. Disclaimer: the code is ugly.
-
MARCHE Claude authored
allows to show the warnings in the nightly bench
-
MARCHE Claude authored
-
Claude Marche authored
-
Claude Marche authored
-
Claude Marche authored
-
Claude Marche authored
-
- 09 Oct, 2012 7 commits
-
-
Guillaume Melquiond authored
-
Guillaume Melquiond authored
-
Guillaume Melquiond authored
-
MARCHE Claude authored
-
François Bobot authored
-
Guillaume Melquiond authored
If the user happens to select all the goals in the IDE and press replay, a quadratic number of proof attempts are actually scheduled: each goal is scheduled as many times as it has ancestors. This patch fixes it.
-
Guillaume Melquiond authored
With the previous code, one could start with an original time limit of a few seconds and end up with proof attempts running for several minutes after a few unsuccessful tries with provers that are aware of the actual limit. Now, the actual time limit is never more than twice the user-defined one.
-
- 08 Oct, 2012 7 commits
-
-
Claude Marche authored
-
Claude Marche authored
-
MARCHE Claude authored
-
Asma Tafat-Bouzid authored
-
Asma Tafat-Bouzid authored
-
Jean-Christophe Filliâtre authored
-
Jean-Christophe Filliâtre authored
-