UnCoVer (Using Coverability for Verification)
 All Classes Namespaces Functions Variables Typedefs Enumerations Enumerator Friends Pages
BackwardStepTest.h
1 /***************************************************************************
2  * Copyright (C) 2014 by Jan Stückrath <jan.stueckrath@uni-due.de> *
3  * *
4  * This program is free software; you can redistribute it and/or modify *
5  * it under the terms of the GNU General Public License as published by *
6  * the Free Software Foundation; either version 2 of the License, or *
7  * (at your option) any later version. *
8  * *
9  * This program is distributed in the hope that it will be useful, *
10  * but WITHOUT ANY WARRANTY; without even the implied warranty of *
11  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
12  * GNU General Public License for more details. *
13  * *
14  * You should have received a copy of the GNU General Public License *
15  * along with this program; if not, write to the *
16  * Free Software Foundation, Inc., *
17  * 51 Franklin St, Fifth Floor, Boston, MA 02110, USA *
18  ***************************************************************************/
19 
20 #ifndef BACKWARDSTEPTEST_H_
21 #define BACKWARDSTEPTEST_H_
22 
23 #include "../basic_types/Scenario.h"
24 #include "../graphs/GTS.h"
25 
26 namespace uncover {
27  namespace scenarios {
28 
35 
36  public:
37 
42 
46  virtual ~BackwardStepTest();
47 
51  virtual void run() override;
52 
53  protected:
54 
55  virtual void initialize(unordered_map<string,string>& parameters) override;
56 
57  private:
58 
62  enum Order {
67 
71  string rulesFilename;
72 
77 
81  shared_ptr<vector<graphs::Hypergraph_sp>> errorGraphs;
82 
86  bool optimize;
87 
91  bool injective;
92 
97 
98  };
99 
100  } /* namespace scenarios */
101 } /* namespace uncover */
102 
103 #endif /* BACKWARDSTEPTEST_H_ */
The minor ordering.
Definition: BackwardStepTest.h:64
bool injective
Stores whether matches are injective or conflict-free.
Definition: BackwardStepTest.h:91
BackwardStepTest()
Generates a new BackwardStepTest scenario without initializing its parameters.
Definition: BackwardStepTest.cpp:51
string rulesFilename
Stores the path and filename of the rules read.
Definition: BackwardStepTest.h:71
BackwardStepTest::Order order
Stores the order used.
Definition: BackwardStepTest.h:96
virtual void initialize(unordered_map< string, string > &parameters) override
Initializes the scenario with the given mapping, where the keys are parameter names.
Definition: BackwardStepTest.cpp:75
The subgraph ordering.
Definition: BackwardStepTest.h:66
shared_ptr< vector< graphs::Hypergraph_sp > > errorGraphs
Stores the loaded error graphs.
Definition: BackwardStepTest.h:81
virtual void run() override
Performs a single backward step with the rules and graphs with which this object was initialized...
Definition: BackwardStepTest.cpp:129
graphs::GTS_sp gts
Stores the loaded GTS.
Definition: BackwardStepTest.h:76
This test scenario takes a given set of rules and a given set of error graphs and performs a single b...
Definition: BackwardStepTest.h:34
A scenario is a subprogram using a set of input parameters to execute some algorithms, producing desired output.
Definition: Scenario.h:36
virtual ~BackwardStepTest()
Destroys this BackwardStepTest scenario.
Definition: BackwardStepTest.cpp:73
shared_ptr< GTS > GTS_sp
Alias for a shared pointer to a GTS object.
Definition: GTS.h:164
Order
This enumeration stores which order should be used.
Definition: BackwardStepTest.h:62
bool optimize
Stores whether optimization will be used or not.
Definition: BackwardStepTest.h:86