1. 30 Sep, 2011 2 commits
    • Andrei Paskevich's avatar
      add the option --realize to Main · 9ab0704b
      Andrei Paskevich authored
      How to use it:
      
          why3 --realize -D drivers/coq-realize.drv -T real.Real -o .
      
              produces Real.v in the current directory
      
          why3 --realize -D drivers/coq-realize.drv -T real.Real
      
              produces real/Real.v in the loadpath near real.why
              (the directory "real" must exist)
      
      If a realization file is already there, it is passed to
      the printer in order to preserve the proofs.
      
      Instead of -D <driver_file>, you can use -P <prover>,
      if that prover uses a corresponding driver. However,
      the prover itself is not used.
      
      You can only realize theories from the loadpath.
      
      At the moment, coq-realize.drv is the only driver
      capable to realize theories in some sensible way.
      For any other driver, the results may be funny.
      
      Realization of WhyML modules is not possible so far.
      
      Realization may break if you directories and filenames
      contain non-alphanumeric symbols.
      
      The whole thing is in very preliminary stage.
      Use with caution.
      9ab0704b
    • MARCHE Claude's avatar
      alternative timeout regexp for vampire · 75e1e522
      MARCHE Claude authored
      75e1e522
  2. 29 Sep, 2011 2 commits
  3. 28 Sep, 2011 1 commit
  4. 26 Sep, 2011 1 commit
  5. 18 Sep, 2011 2 commits
  6. 16 Sep, 2011 2 commits
  7. 13 Sep, 2011 1 commit
  8. 02 Sep, 2011 1 commit
  9. 31 Aug, 2011 1 commit
  10. 23 Aug, 2011 2 commits
    • Guillaume Melquiond's avatar
    • Guillaume Melquiond's avatar
      Add a new transformation that instantiates the axioms marked with the · 4d7dd217
      Guillaume Melquiond authored
      meta "instantiate : auto" on as many terms as possible.
      
      The transformation is rather naive, since it doesn't look for term
      candidates under quantifiers, if-then-else, let-in, and so on. So it can
      only appear late in the transformation pipe.
      
      It is only enabled for Gappa and its target axioms are the ones that state
      that any floating-point value is bounded. It was the last transformation
      from Why2 still missing in Why3.
      
      Thanks to this transformation, Gappa is now able to prove all the safety
      obligations from the following code, including the ones about division and
      downcast, which is definitely frightening.
      
      /*@ assigns \nothing;
        @ ensures \result == \abs(x);
        @*/
      extern double fabs(double x);
      
      /*@ requires \valid(AB_Ptr) && \valid(CD_Ptr);
        @ assigns *AB_Ptr, *CD_Ptr;
        @ ensures \abs(*AB_Ptr) <= 6.111111e-2;
        @ ensures \abs(*CD_Ptr) <= 6.111111e-2;
        @ */
      void limitValue(float *AB_Ptr, float *CD_Ptr)
      {
         double Fabs_AB, Fabs_CD;
         double max;
      
         Fabs_AB = fabs (*AB_Ptr);
         Fabs_CD = fabs (*CD_Ptr);
      
         max = Fabs_AB;
         if (Fabs_CD > Fabs_AB)  max = Fabs_CD;
      
         if ( max > 6.111111e-2)
         {
            *AB_Ptr = (float) (((*AB_Ptr) * 6.111111e-2) / max);
            *CD_Ptr = (float) (((*CD_Ptr) * 6.111111e-2) / max);
         }
      }
      4d7dd217
  11. 22 Aug, 2011 1 commit
    • Guillaume Melquiond's avatar
      Detect syntax errors in CVC3 files. · a4d0d0fe
      Guillaume Melquiond authored
      Note that CVC3 doesn't care about syntax errors and it will still answer
      valid at the end. Currently, CVC3 chokes on the following kind of
      declarations (Div_mult, Abs_real_pos, and so on).
      
        ASSERT
        (FORALL (x : INT, y : INT, z : INT):PATTERN (div(((x * y) + z), x)):
        (((0 < x) AND ((0 <= y) AND (0 <= z))) => (div(((x * y) + z), x) = (y +
        div(z, x)))));
      a4d0d0fe
  12. 26 Jul, 2011 1 commit
    • Jean-Christophe Filliatre's avatar
      Coq output: recursive definitions · 59b180cb
      Jean-Christophe Filliatre authored
      introduced new transformation eliminate_non_struct_recursion for that purpose
      uses Decl.check_termination tomake the check and the pretty-print
      (could probably be improved to avoid 3 calls to check_termination)
      59b180cb
  13. 06 Jul, 2011 1 commit
  14. 05 Jul, 2011 3 commits
  15. 29 Jun, 2011 1 commit
  16. 07 Jun, 2011 1 commit
  17. 05 Jun, 2011 2 commits
  18. 04 Jun, 2011 2 commits
  19. 03 Jun, 2011 1 commit
  20. 30 May, 2011 1 commit
  21. 27 May, 2011 1 commit
  22. 22 May, 2011 2 commits
  23. 20 May, 2011 1 commit
  24. 11 May, 2011 1 commit
  25. 03 May, 2011 2 commits
  26. 02 May, 2011 1 commit
  27. 29 Apr, 2011 1 commit
  28. 28 Apr, 2011 1 commit
  29. 21 Apr, 2011 1 commit