diff options
Diffstat (limited to 'src/preprocessing/passes/ackermann.cpp')
| -rw-r--r-- | src/preprocessing/passes/ackermann.cpp | 45 |
1 files changed, 23 insertions, 22 deletions
diff --git a/src/preprocessing/passes/ackermann.cpp b/src/preprocessing/passes/ackermann.cpp index 525d0b243..6b2f142fc 100644 --- a/src/preprocessing/passes/ackermann.cpp +++ b/src/preprocessing/passes/ackermann.cpp @@ -1,25 +1,26 @@ -/********************* */ -/*! \file ackermann.cpp - ** \verbatim - ** Top contributors (to current version): - ** Ying Sheng, Yoni Zohar, Aina Niemetz - ** 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 Ackermannization preprocessing pass. - ** - ** This implements the Ackermannization preprocessing pass, which enables - ** very limited theory combination support for eager bit-blasting via - ** Ackermannization. It reduces constraints over the combination of the - ** theories of fixed-size bit-vectors and uninterpreted functions as - ** described in - ** 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): + * Ying Sheng, Yoni Zohar, Aina Niemetz + * + * 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. + * **************************************************************************** + * + * Ackermannization preprocessing pass. + * + * This implements the Ackermannization preprocessing pass, which enables + * very limited theory combination support for eager bit-blasting via + * Ackermannization. It reduces constraints over the combination of the + * theories of fixed-size bit-vectors and uninterpreted functions as + * described in + * 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 "preprocessing/passes/ackermann.h" |