.. PRBOT-its documentation master file, created by
   sphinx-quickstart on Wed Aug  4 16:10:52 2021.
   You can adapt this file completely to your liking, but it should at least
   contain the root `toctree` directive.

CTLog: SAT-Based Combinatorial Testing in Python
=========================================================================================================

**CTLog** is a complete framework for Combinatorial Testing of Constrained Systems Under Test developed by the `Logic & Optimization Group (LOG) <http://ulog.udl.cat/>`_ at the University of Lleida.
It uses Satisfiability (SAT) technology through the `OptiLog <http://hardlog.udl.cat/static/doc/optilog/html/index.html>`_ Python framework, also developed and mantained by the same research group.

CTLog implements all the algorithms that we developed in our research, such as ``MaxSAT MCAC`` and ``maxsat-its`` :cite:p:`DBLP:journals/corr/abs-2105-12552` and all the family of the ``BOT-its`` :cite:p:`DBLP:conf/cp/AnsoteguiOT21` algorithms.
It also implements several state-of-the-art algorithms for generating Mixed Covering Arrays with Constraints, such as ``IPOG`` :cite:p:`https://doi.org/10.1002/stvr.381` or ``CALOT`` :cite:p:`YamadaKACOB15`.

Additionally, we provide the ``SUT-G`` generator, which can be used to generate new Constrained Systems Under Tests where all these MCAC algorithms can be applied.

If you use CTLog in your research please cite our work::

    @article{ANSOTEGUI2024104791,
        title = {Effectively computing high strength mixed covering arrays with constraints},
        journal = {Journal of Parallel and Distributed Computing},
        volume = {185},
        pages = {104791},
        year = {2024},
        issn = {0743-7315},
        doi = {https://doi.org/10.1016/j.jpdc.2023.104791},
        url = {https://www.sciencedirect.com/science/article/pii/S0743731523001612},
        author = {Carlos Ansótegui and Eduard Torres},
        keywords = {Combinatorial testing, Satisfiability}
    }

CTLog in our research
~~~~~~~~~~~~~~~~~~~~~

In the following we present the list of algorithms used in our research that are implemented in CTLog:

   - Incomplete MaxSAT approaches for Combinatorial Testing :cite:p:`DBLP:journals/corr/abs-2105-12552`
       - :ref:`maxsat_mcac`
       - :ref:`calot`
       - :ref:`maxsat_its`
       - :ref:`bot_its` as an updated version of the *greedy* algorithm
  
   - Building High Strength Mixed Covering Arrays with Constraints :cite:p:`DBLP:conf/cp/AnsoteguiOT21`:
       - :ref:`bot_its`
       - :ref:`pbot_its`
       - :ref:`prbot_its`

   - Effectively Computing High Strength Mixed Covering Arrays with Constraints :cite:p:`ANSOTEGUI2024104791`:
       - :ref:`bot_its`
       - :ref:`pbot_its`
       - :ref:`prbot_its`
       - :ref:`parallel_prbot_its`

   - A Benchmark Generator for Combinatorial Testing (under review, preprint available `here <https://arxiv.org/abs/2301.08134>`_):
       - :ref:`sut_g` for the benchmark generator
       - :ref:`bot_its`, :ref:`pbot_its` and :ref:`ipog` for the tested algorithms

   - ReMiCA: Recursive Construction of High-Strength Mixed Covering Arrays
       - :ref:`remica`, the ReMiCA implementation
       - :ref:`weaken`, a *weaken-product* implementation reproducing :cite:p:`ukai2022accelerating`

.. toctree::
   :maxdepth: 2
   :caption: Contents:

   ctlog/installation.rst
   ctlog/ct-intro.rst
   ctlog/handson-ctlog.rst
   ctlog/input-formats.rst
   ctlog/mcac-algorithms.rst
   ctlog/sut-g.rst
   ctlog/use-cases.rst
   ctlog/cli.rst
   ctlog/references.rst
   ctlog/changelog.rst
   ctlog/glossary.rst
   ctlog/license.rst