diff options
Diffstat (limited to 'src/preprocessing/passes/bv_abstraction.h')
| -rw-r--r-- | src/preprocessing/passes/bv_abstraction.h | 45 |
1 files changed, 23 insertions, 22 deletions
diff --git a/src/preprocessing/passes/bv_abstraction.h b/src/preprocessing/passes/bv_abstraction.h index c5d30124c..7e07653da 100644 --- a/src/preprocessing/passes/bv_abstraction.h +++ b/src/preprocessing/passes/bv_abstraction.h @@ -1,25 +1,26 @@ -/********************* */ -/*! \file bv_abstraction.h - ** \verbatim - ** Top contributors (to current version): - ** Mathias Preiner - ** This file is part of the CVC4 project. - ** Copyright (c) 2009-2021 by the authors listed in the file AUTHORS - ** in the top-level source directory and their institutional affiliations. - ** All rights reserved. See the file COPYING in the top-level source - ** directory for licensing information.\endverbatim - ** - ** \brief The BvAbstraction preprocessing pass - ** - ** Abstract common structures over small domains to UF. This preprocessing - ** is particularly useful on QF_BV/mcm benchmarks and can be enabled via - ** option `--bv-abstraction`. - ** For more information see 3.4 Refactoring Isomorphic Circuits in [1]. - ** - ** [1] Liana Hadarean, An Efficient and Trustworthy Theory Solver for - ** Bit-vectors in Satisfiability Modulo Theories - ** https://cs.nyu.edu/media/publications/hadarean_liana.pdf - **/ +/****************************************************************************** + * Top contributors (to current version): + * Mathias Preiner + * + * This file is part of the cvc5 project. + * + * Copyright (c) 2009-2021 by the authors listed in the file AUTHORS + * in the top-level source directory and their institutional affiliations. + * All rights reserved. See the file COPYING in the top-level source + * directory for licensing information. + * **************************************************************************** + * + * The BvAbstraction preprocessing pass. + * + * Abstract common structures over small domains to UF. This preprocessing + * is particularly useful on QF_BV/mcm benchmarks and can be enabled via + * option `--bv-abstraction`. + * For more information see 3.4 Refactoring Isomorphic Circuits in [1]. + * + * [1] Liana Hadarean, An Efficient and Trustworthy Theory Solver for + * Bit-vectors in Satisfiability Modulo Theories + * https://cs.nyu.edu/media/publications/hadarean_liana.pdf + */ #include "cvc4_private.h" |