-
Notifications
You must be signed in to change notification settings - Fork 19
/
Assignment-2.cpp
61 lines (50 loc) · 2.13 KB
/
Assignment-2.cpp
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
//===- Software-Verification-Teaching Assignment 2-------------------------------------//
//
// SVF: Static Value-Flow Analysis Framework for Source Code
//
// Copyright (C) <2013->
//
// This program 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.
// This program 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 this program. If not, see <http://www.gnu.org/licenses/>.
//
//===-----------------------------------------------------------------------===//
/*
// Software-Verification-Teaching Assignment 2 : ICFG graph traversal (Control-flow reachability analysis)
//
//
*/
#include "Assignment-2.h"
using namespace SVF;
using namespace SVFUtil;
/// TODO: Implement your context-sensitive ICFG traversal here to traverse each program path (once for any loop) from src edge to dst node
void ICFGTraversal::dfs(const ICFGEdge *src, const ICFGNode *dst) {
}
/// TODO: print each path once this method is called, and
/// add each path as a string into std::set<std::string> paths
/// Print the path in the format "START: 1->2->4->5->END", where -> indicate an ICFGEdge connects two ICFGNode IDs
void ICFGTraversal::printICFGPath()
{
}
/// Program entry, do not change
void ICFGTraversal::analyse()
{
std::set<const ICFGNode *> sources;
std::set<const ICFGNode *> sinks;
for (const ICFGNode *src : identifySource(sources)) {
assert(SVFUtil::isa<GlobalICFGNode>(src) && "dfs should start with GlobalICFGNode!");
for (const ICFGNode *sink: identifySink(sinks)) {
const IntraCFGEdge* startEdge = new IntraCFGEdge(nullptr,const_cast<ICFGNode*>(src));
handleIntra(startEdge);
dfs(startEdge, sink);
resetSolver();
}
}
}