A workbench for combinatorial computing, and standard sets of data that
can be used for benchmark tests of competing methods by Donald Knuth.
Also includes demonstration programs and games that make use of the data.
Gerald Pfeifer <gerald@FreeBSD.org>
rpm-build-perl is required to build Perl RPM packages;
it contains scripts for automatic dependency tracking,
RPM macros for Perl.
The SMV (Symbolic Model Verifier) system is a tool for
checking finite state systems against specifications
in the temporal logic CTL (Computational Tree Logic).
One specifies the finite state system (finite automaton,
Mealy machine, full adder circuit, ..) as a Kripke
structure in the SMV language and provides specifications
in CTL. The model checking algorithm allows to determine
if the Kripke structure fulfills the specifications.
Driver based class to calculate holidays in Austria.
Driver based class to calculate holidays in Brazil.
Driver based class to calculate holidays in Denmark.
Driver based class to calculate Discordian holidays.
Driver based class to calculate holidays in England and Wales.
Driver based class to calculate holidays in Germany.
Driver based class to calculate holidays in Iceland.