5 Matching Annotations
  1. May 2019
  2. Oct 2018
  3. Nov 2015
    1. This problem is precisely the kind of problem that FSMs are very good at resolving. If you can enumerate the states, and events, then you know the number of paths though the system. So if Given/When/Then statements are truly nothing more than state transitios, all we need to do is enumerate the number of GIVENs and the number of WHENs. The number of scenarios will simply be the product of the two.

      Main observation here is that BDD is essentially a syntax for specifying states and transitions in a state machine. If all possible states and events can be enumerated, you can quantify what proportion of paths through the system have been tested

  4. Sep 2015
    1. les bases de données deviennent de plus en plus des métaphores conceptuelles qui structurent notre expérience du monde et de nous-mêmes.

      Faire une topologie des métaphores. Quid du rôle joué par les API dans ces métaphores ?