-
Notifications
You must be signed in to change notification settings - Fork 6k
/
Copy pathCHCSolverInterface.h
76 lines (61 loc) · 2.16 KB
/
CHCSolverInterface.h
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
/*
This file is part of solidity.
solidity is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
solidity is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with solidity. If not, see <http://www.gnu.org/licenses/>.
*/
// SPDX-License-Identifier: GPL-3.0
/**
* Interface for constrained Horn solvers.
*/
#pragma once
#include <libsmtutil/SolverInterface.h>
#include <map>
#include <unordered_map>
#include <vector>
namespace solidity::smtutil
{
class CHCSolverInterface : public SolverInterface
{
public:
CHCSolverInterface(std::optional<unsigned> _queryTimeout = {}): m_queryTimeout(_queryTimeout) {}
/// Takes a function declaration as a relation.
virtual void registerRelation(Expression const& _expr) = 0;
/// Takes an implication and adds as rule.
/// Needs to bound all vars as universally quantified.
virtual void addRule(Expression const& _expr, std::string const& _name) = 0;
using CexNode = Expression;
struct CexGraph
{
std::map<unsigned, CexNode> nodes;
std::map<unsigned, std::vector<unsigned>> edges;
};
struct InvariantInfo
{
/// Predicate definition as SMT expression
Expression expression;
/// Names of the formal arguments of the predicate definition
std::vector<std::string> variableNames;
};
/// Maps predicate to its definition as given by the solver and the formal arguments of the predicate
using Invariants = std::unordered_map<std::string, InvariantInfo>;
struct QueryResult
{
CheckResult answer;
Invariants invariants;
CexGraph cex;
};
/// Takes a function application _expr and checks for reachability.
/// @returns solving result, an invariant, and counterexample graph, if possible.
virtual QueryResult query(Expression const& _expr) = 0;
protected:
std::optional<unsigned> m_queryTimeout;
};
}