blob: 0f3db2f59cf9409f8d1ada5a51a4326462b4bbe9 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
|
/******************************************************************************
* 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 "cvc5_private.h"
#ifndef CVC5__PREPROCESSING__PASSES__BV_ABSTRACTION_H
#define CVC5__PREPROCESSING__PASSES__BV_ABSTRACTION_H
#include "preprocessing/preprocessing_pass.h"
namespace cvc5 {
namespace preprocessing {
namespace passes {
class BvAbstraction : public PreprocessingPass
{
public:
BvAbstraction(PreprocessingPassContext* preprocContext);
protected:
PreprocessingPassResult applyInternal(
AssertionPipeline* assertionsToPreprocess) override;
};
} // namespace passes
} // namespace preprocessing
} // namespace cvc5
#endif /* CVC5__PREPROCESSING__PASSES__BV_ABSTRACTION_H */
|