blob: d45320266948126c1bd03e9064ed2ca135011f44 (
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
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
|
/********************* */
/*! \file theory_arrays.cpp
** \verbatim
** Original author: barrett
** Major contributors: none
** Minor contributors (to current version): mdeters
** This file is part of the CVC4 prototype.
** Copyright (c) 2009, 2010 The Analysis of Computer Systems Group (ACSys)
** Courant Institute of Mathematical Sciences
** New York University
** See the file COPYING in the top-level source directory for licensing
** information.\endverbatim
**
** \brief Implementation of the theory of arrays.
**
** Implementation of the theory of arrays.
**/
#include "theory/arrays/theory_arrays.h"
#include "theory/valuation.h"
#include "expr/kind.h"
using namespace std;
using namespace CVC4;
using namespace CVC4::kind;
using namespace CVC4::context;
using namespace CVC4::theory;
using namespace CVC4::theory::arrays;
TheoryArrays::TheoryArrays(Context* c, OutputChannel& out) :
Theory(THEORY_ARRAY, c, out)
{
}
TheoryArrays::~TheoryArrays() {
}
void TheoryArrays::addSharedTerm(TNode t) {
Debug("arrays") << "TheoryArrays::addSharedTerm(): "
<< t << endl;
}
void TheoryArrays::notifyEq(TNode lhs, TNode rhs) {
Debug("arrays") << "TheoryArrays::notifyEq(): "
<< lhs << " = " << rhs << endl;
}
void TheoryArrays::check(Effort e) {
while(!done()) {
Node assertion = get();
Debug("arrays") << "TheoryArrays::check(): " << assertion << endl;
}
Debug("arrays") << "TheoryArrays::check(): done" << endl;
}
Node TheoryArrays::getValue(TNode n, Valuation* valuation) {
NodeManager* nodeManager = NodeManager::currentNM();
switch(n.getKind()) {
case kind::VARIABLE:
Unhandled(kind::VARIABLE);
case kind::EQUAL: // 2 args
return nodeManager->
mkConst( valuation->getValue(n[0]) == valuation->getValue(n[1]) );
default:
Unhandled(n.getKind());
}
}
|
