ROSE  0.9.11.8
BinaryFeasiblePath.h
1 #ifndef ROSE_BinaryAnalysis_FeasiblePath_H
2 #define ROSE_BinaryAnalysis_FeasiblePath_H
3 
4 #include <BaseSemantics2.h>
5 #include <BinarySmtSolver.h>
6 #include <BinarySymbolicExprParser.h>
7 #include <Partitioner2/CfgPath.h>
8 #include <Sawyer/CommandLine.h>
9 #include <Sawyer/Message.h>
10 #include <boost/filesystem/path.hpp>
11 
12 namespace Rose {
13 namespace BinaryAnalysis {
14 
18 class FeasiblePath {
20  // Types and public data members
22 public:
24  enum SearchMode {
28  };
29 
34  };
35 
41  };
42 
44  enum IoMode { READ, WRITE };
45 
47  enum MayOrMust { MAY, MUST };
48 
50  typedef std::set<rose_addr_t> AddressSet;
51 
58  struct Expression {
60  std::string parsable;
63  Expression() {}
64  /*implicit*/ Expression(const std::string &parsable): parsable(parsable) {}
65  /*implicit*/ Expression(const SymbolicExpr::Ptr &expr): expr(expr) {}
66 
67  void print(std::ostream&) const;
68  };
69 
71  struct Settings {
72  // Path feasibility
75  size_t maxVertexVisit;
76  size_t maxPathLength;
77  size_t maxCallDepth;
79  std::vector<Expression> assertions;
80  std::vector<std::string> assertionLocations;
81  std::vector<rose_addr_t> summarizeFunctions;
83  std::string solverName;
91  // Null dereferences
92  struct NullDeref {
93  bool check;
95  bool constOnly;
97  NullDeref()
98  : check(false), mode(MUST), constOnly(false) {}
99  } nullDeref;
101  std::string exprParserDoc;
105  : searchMode(SEARCH_SINGLE_DFS), maxVertexVisit((size_t)-1), maxPathLength(200), maxCallDepth((size_t)-1),
106  maxRecursionDepth((size_t)-1), nonAddressIsFeasible(true), solverName("best"),
107  memoryParadigm(LIST_BASED_MEMORY), processFinalVertex(false), ignoreSemanticFailure(false),
108  kCycleCoefficient(0.0), edgeVisitOrder(VISIT_NATURAL), trackingCodeCoverage(true) {}
109  };
110 
113 
122 
124  struct VarDetail {
125  std::string registerName;
126  std::string firstAccessMode;
130  size_t memSize;
131  size_t memByteNumber;
134  VarDetail(): firstAccessInsn(NULL), memSize(0), memByteNumber(0) {}
135  std::string toString() const;
136  };
137 
140 
145  public:
146  enum Action {
149  };
150 
151  virtual ~PathProcessor() {}
152 
167  virtual Action found(const FeasiblePath &analyzer, const Partitioner2::CfgPath &path,
169  const SmtSolverPtr &solver) { return CONTINUE; }
170 
182  virtual void nullDeref(const FeasiblePath &analyzer, const Partitioner2::CfgPath &path,
184 
189  virtual void memoryIo(const FeasiblePath &analyzer, IoMode ioMode,
193  };
194 
199  rose_addr_t address;
200  int64_t stackDelta;
201  std::string name;
204  FunctionSummary(): stackDelta(SgAsmInstruction::INVALID_STACK_DELTA) {}
205 
207  FunctionSummary(const Partitioner2::ControlFlowGraph::ConstVertexIterator &cfgFuncVertex, uint64_t stackDelta);
208  };
209 
212 
217  public:
220  protected:
221  FunctionSummarizer() {}
222  public:
224  virtual void init(const FeasiblePath &analysis, FunctionSummary &summary /*in,out*/,
225  const Partitioner2::Function::Ptr &function,
226  Partitioner2::ControlFlowGraph::ConstVertexIterator cfgCallTarget) = 0;
227 
232  virtual bool process(const FeasiblePath &analysis, const FunctionSummary &summary,
234 
240  returnValue(const FeasiblePath &analysis, const FunctionSummary &summary,
242  };
243 
245  // Private data members
247 private:
248  const Partitioner2::Partitioner *partitioner_; // binary analysis context
249  RegisterDictionary *registers_; // registers augmented with "path" pseudo-register
250  RegisterDescriptor REG_RETURN_; // FIXME[Robb P Matzke 2016-10-11]: see source
251  Settings settings_;
252  FunctionSummaries functionSummaries_;
253  Partitioner2::CfgVertexMap vmap_; // relates CFG vertices to path vertices
254  Partitioner2::ControlFlowGraph paths_; // all possible paths, feasible or otherwise
255  Partitioner2::CfgConstVertexSet pathsBeginVertices_;// vertices of paths_ where searching starts
256  Partitioner2::CfgConstVertexSet pathsEndVertices_; // vertices of paths_ where searching stops
257  Partitioner2::CfgConstEdgeSet cfgAvoidEdges_; // CFG edges to avoid
258  Partitioner2::CfgConstVertexSet cfgEndAvoidVertices_;// CFG end-of-path and other avoidance vertices
259  FunctionSummarizer::Ptr functionSummarizer_; // user-defined function for handling function summaries
260  AddressSet reachedBlockVas_; // basic block addresses reached during analysis
261  static Sawyer::Attribute::Id POST_STATE; // stores semantic state after executing the insns for a vertex
262  static Sawyer::Attribute::Id POST_INSN_LENGTH; // path length in instructions at end of vertex
263  static Sawyer::Attribute::Id EFFECTIVE_K; // (double) effective maximimum path length
264 
265 
267  // Construction, destruction
269 public:
272  : registers_(NULL) {}
273 
274  virtual ~FeasiblePath() {}
275 
277  void reset() {
278  partitioner_ = NULL;
279  registers_ = NULL;
280  REG_PATH = REG_RETURN_ = RegisterDescriptor();
281  functionSummaries_.clear();
282  vmap_.clear();
283  paths_.clear();
284  pathsBeginVertices_.clear();
285  pathsEndVertices_.clear();
286  cfgAvoidEdges_.clear();
287  cfgEndAvoidVertices_.clear();
288  reachedBlockVas_.clear();
289  }
290 
292  static void initDiagnostics();
293 
294 
296  // Settings affecting behavior
298 public:
302  const Settings& settings() const { return settings_; }
303  Settings& settings() { return settings_; }
304  void settings(const Settings &s) { settings_ = s; }
312 
314  static std::string expressionDocumentation();
315 
316 
318  // Overridable processing functions
320 public:
327  buildVirtualCpu(const Partitioner2::Partitioner&, const Partitioner2::CfgPath*, PathProcessor*, const SmtSolver::Ptr&);
328 
335  virtual void
337  const Partitioner2::ControlFlowGraph::ConstVertexIterator &pathsBeginVertex);
338 
343  virtual void
345  const InstructionSemantics2::BaseSemantics::DispatcherPtr &cpu, size_t pathInsnIndex);
346 
350  virtual void
351  processIndeterminateBlock(const Partitioner2::ControlFlowGraph::ConstVertexIterator &vertex,
353  size_t pathInsnIndex);
354 
358  virtual void
359  processFunctionSummary(const Partitioner2::ControlFlowGraph::ConstVertexIterator &pathsVertex,
361  size_t pathInsnIndex);
362 
366  virtual void
368  const Partitioner2::ControlFlowGraph::ConstVertexIterator &pathsVertex,
369  size_t &pathInsnIndex /*in,out*/);
370 
372  virtual bool
373  shouldSummarizeCall(const Partitioner2::ControlFlowGraph::ConstVertexIterator &pathVertex,
375  const Partitioner2::ControlFlowGraph::ConstVertexIterator &cfgCallTarget);
376 
378  virtual bool
379  shouldInline(const Partitioner2::CfgPath &path, const Partitioner2::ControlFlowGraph::ConstVertexIterator &cfgCallTarget);
380 
389  FunctionSummarizer::Ptr functionSummarizer() const { return functionSummarizer_; }
390  void functionSummarizer(const FunctionSummarizer::Ptr &f) { functionSummarizer_ = f; }
393  // Utilities
396 public:
398  Partitioner2::ControlFlowGraph::ConstVertexIterator
399  pathToCfg(const Partitioner2::ControlFlowGraph::ConstVertexIterator &pathVertex) const;
400 
404 
407 
409  bool isFunctionCall(const Partitioner2::ControlFlowGraph::ConstVertexIterator&) const;
410 
412  void printPathVertex(std::ostream &out, const Partitioner2::ControlFlowGraph::Vertex &pathVertex,
413  size_t &insnIdx /*in,out*/) const;
414 
418  void printPath(std::ostream &out, const Partitioner2::CfgPath&) const;
419 
424  const Partitioner2::ControlFlowGraph::ConstVertexIterator &beginVertex,
425  const Partitioner2::CfgConstVertexSet &endVertices);
426 
428  // Functions for describing the search space
430 public:
431 
438  void
440  const Partitioner2::CfgConstVertexSet &cfgBeginVertices,
441  const Partitioner2::CfgConstVertexSet &cfgEndVertices,
444  void
445  setSearchBoundary(const Partitioner2::Partitioner &partitioner,
446  const Partitioner2::ControlFlowGraph::ConstVertexIterator &cfgBeginVertex,
447  const Partitioner2::ControlFlowGraph::ConstVertexIterator &cfgEndVertex,
453  // Functions for searching for paths
456 public:
461  void depthFirstSearch(PathProcessor &pathProcessor);
462 
463 
465  // Functions for getting the results
467 public:
472  const Partitioner2::Partitioner& partitioner() const;
473 
477  const FunctionSummaries& functionSummaries() const {
478  return functionSummaries_;
479  }
480 
485  const FunctionSummary& functionSummary(rose_addr_t entryVa) const;
486 
488  const VarDetail& varDetail(const InstructionSemantics2::BaseSemantics::StatePtr&, const std::string &varName) const;
489 
491  const VarDetails& varDetails(const InstructionSemantics2::BaseSemantics::StatePtr&) const;
492 
495 
501  double pathEffectiveK(const Partitioner2::CfgPath&) const;
502 
509  static size_t pathLength(const Partitioner2::CfgPath&);
510 
512  // Functions for code coverage
514 public:
519  const AddressSet& reachedBlockVas() const;
520 
522  // Private supporting functions
524 private:
525  static rose_addr_t virtualAddress(const Partitioner2::ControlFlowGraph::ConstVertexIterator &vertex);
526 
527  void insertCallSummary(const Partitioner2::ControlFlowGraph::ConstVertexIterator &pathsCallSite,
529  const Partitioner2::ControlFlowGraph::ConstEdgeIterator &cfgCallEdge);
530 
531  boost::filesystem::path emitPathGraph(size_t callId, size_t graphId); // emit paths graph to "rose-debug" directory
532 
533  // Pop an edge (or more) from the path and follow some other edge. Also, adjust the SMT solver's stack in a similar
534  // way. The SMT solver will have an initial state, plus one pushed state per edge of the path.
535  void backtrack(Partitioner2::CfgPath &path /*in,out*/, const SmtSolver::Ptr&);
536 
537  // Process one edge of a path to find any path constraints. When called, the cpu's current state should be the virtual
538  // machine state at it exists just prior to executing the target vertex of the specified edge.
539  //
540  // Returns a null pointer if the edge's assertion is trivially unsatisfiable, such as when the edge points to a basic block
541  // whose address doesn't match the contents of the instruction pointer register after executing the edge's source
542  // block. Otherwise, returns a symbolic expression which must be tree if the edge is feasible. For trivially feasible
543  // edges, the return value is the constant 1 (one bit wide; i.e., true).
544  SymbolicExpr::Ptr pathEdgeConstraint(const Partitioner2::ControlFlowGraph::ConstEdgeIterator &pathEdge,
546 
547  // Parse the expression if it's a parsable string, otherwise return the expression as is. */
548  Expression parseExpression(Expression, const std::string &where, SymbolicExprParser&) const;
549 
550  SymbolicExpr::Ptr expandExpression(const Expression&, SymbolicExprParser&);
551 
552  // Based on the last vertex of the path, insert user-specified assertions into the SMT solver.
553  void insertAssertions(const SmtSolver::Ptr&, const Partitioner2::CfgPath&,
554  const std::vector<Expression> &assertions, bool atEndOfPath, SymbolicExprParser&);
555 
556  // Size of vertex. How much of "k" does this vertex consume?
557  static size_t vertexSize(const Partitioner2::ControlFlowGraph::ConstVertexIterator&);
558 
559  // Insert the edge assertion and any applicable user assertions (after delayed expansion of the expressions' register
560  // and memory references), and run the solver, returning its result.
562  solvePathConstraints(SmtSolver::Ptr&, const Partitioner2::CfgPath&, const SymbolicExpr::Ptr &edgeAssertion,
563  const std::vector<Expression> &userAssertions, bool atEndOfPath, SymbolicExprParser&);
564 
565  // Mark vertex as being reached
566  void markAsReached(const Partitioner2::ControlFlowGraph::ConstVertexIterator&);
567 };
568 
569 } // namespace
570 } // namespace
571 
572 std::ostream& operator<<(std::ostream&, const Rose::BinaryAnalysis::FeasiblePath::Expression&);
573 
574 // Convert string to feasible path expression during command-line parsing
575 namespace Sawyer {
576  namespace CommandLine {
577  template<>
578  struct LexicalCast<Rose::BinaryAnalysis::FeasiblePath::Expression> {
579  static Rose::BinaryAnalysis::FeasiblePath::Expression convert(const std::string &src) {
581  }
582  };
583  }
584 }
585 
586 #endif
std::string firstAccessMode
How was variable first accessed ("read" or "write").
std::vector< rose_addr_t > summarizeFunctions
Functions to always summarize.
Sawyer::Container::Map< rose_addr_t, FunctionSummary > FunctionSummaries
Summaries for multiple functions.
MayOrMust mode
Check for addrs that may or must be null.
EdgeVisitOrder edgeVisitOrder
Order in which to visit edges.
virtual InstructionSemantics2::SymbolicSemantics::SValuePtr returnValue(const FeasiblePath &analysis, const FunctionSummary &summary, const InstructionSemantics2::SymbolicSemantics::RiscOperatorsPtr &ops)=0
Return value for function.
static bool isAnyEndpointReachable(const Partitioner2::ControlFlowGraph &cfg, const Partitioner2::ControlFlowGraph::ConstVertexIterator &beginVertex, const Partitioner2::CfgConstVertexSet &endVertices)
Determine whether any ending vertex is reachable.
rose_addr_t address
Address of summarized function.
SemanticMemoryParadigm memoryParadigm
Type of memory state when there's a choice to be made.
bool trackingCodeCoverage
If set, track which block addresses are reached.
double pathEffectiveK(const Partitioner2::CfgPath &) const
Effective maximum path length.
void printPathVertex(std::ostream &out, const Partitioner2::ControlFlowGraph::Vertex &pathVertex, size_t &insnIdx) const
Print one vertex of a path for debugging.
std::string parsable
String to be parsed as an expression.
Information stored per V_USER_DEFINED path vertex.
Sawyer::Container::Map< std::string, FeasiblePath::VarDetail > VarDetails
Variable detail by name.
void setSearchBoundary(const Partitioner2::Partitioner &partitioner, const Partitioner2::CfgConstVertexSet &cfgBeginVertices, const Partitioner2::CfgConstVertexSet &cfgEndVertices, const Partitioner2::CfgConstVertexSet &cfgAvoidVertices=Partitioner2::CfgConstVertexSet(), const Partitioner2::CfgConstEdgeSet &cfgAvoidEdges=Partitioner2::CfgConstEdgeSet())
Specify search boundary.
void depthFirstSearch(PathProcessor &pathProcessor)
Find all feasible paths.
virtual void processIndeterminateBlock(const Partitioner2::ControlFlowGraph::ConstVertexIterator &vertex, const InstructionSemantics2::BaseSemantics::DispatcherPtr &cpu, size_t pathInsnIndex)
Process an indeterminate block.
Base class for machine instructions.
Sawyer::Optional< rose_addr_t > returnFrom
This variable is the return value from the specified function.
Collection of streams.
Definition: Message.h:1579
boost::shared_ptr< class RiscOperators > RiscOperatorsPtr
Shared-ownership pointer to symbolic RISC operations.
FeasiblePath()
Constructs a new feasible path analyzer.
SearchMode
How to search for paths.
virtual bool process(const FeasiblePath &analysis, const FunctionSummary &summary, const InstructionSemantics2::SymbolicSemantics::RiscOperatorsPtr &ops)=0
Invoked when the analysis traverses the summary.
void clear()
Erase all mappings.
Definition: BiMap.h:63
std::set< ControlFlowGraph::ConstVertexIterator > CfgConstVertexSet
Set of CFG vertex pointers.
virtual void processFunctionSummary(const Partitioner2::ControlFlowGraph::ConstVertexIterator &pathsVertex, const InstructionSemantics2::BaseSemantics::DispatcherPtr &cpu, size_t pathInsnIndex)
Process a function summary vertex.
RegisterDescriptor REG_PATH
Descriptor of path pseudo-registers.
std::string name
Name of summarized function.
Sawyer::Optional< size_t > firstAccessIdx
Instruction position in path where this var was first read.
A collection of related switch declarations.
Main namespace for the ROSE library.
Parses symbolic expressions from text.
Satisfiable
Satisfiability constants.
size_t maxCallDepth
Max length of path in terms of function calls.
struct Rose::BinaryAnalysis::FeasiblePath::Settings::NullDeref nullDeref
Settings for null-dereference analysis.
Blast everything at once to the SMT solver.
Name space for the entire library.
std::vector< std::string > assertionLocations
Locations at which "constraints" are checked.
const FunctionSummaries & functionSummaries() const
Function summary information.
Partitioner2::CfgConstVertexSet cfgToPaths(const Partitioner2::CfgConstVertexSet &) const
Convert CFG vertices to path vertices.
virtual bool shouldInline(const Partitioner2::CfgPath &path, const Partitioner2::ControlFlowGraph::ConstVertexIterator &cfgCallTarget)
Determines whether a function call should be inlined.
virtual void memoryIo(const FeasiblePath &analyzer, IoMode ioMode, const InstructionSemantics2::BaseSemantics::SValuePtr &addr, const InstructionSemantics2::BaseSemantics::SValuePtr &value, const InstructionSemantics2::BaseSemantics::RiscOperatorsPtr &ops)
Function invoked every time a memory reference occurs.
static std::string expressionDocumentation()
Documentation for the symbolic expression parser.
void settings(const Settings &s)
Property: Settings used by this analysis.
boost::shared_ptr< class State > StatePtr
Shared-ownership pointer to a semantic state.
size_t maxPathLength
Limit path length in terms of number of instructions.
bool constOnly
If true, check only constants or sets of constants.
Base class for callbacks for function summaries.
boost::shared_ptr< class Dispatcher > DispatcherPtr
Shared-ownership pointer to a semantics instruction dispatcher.
AddressIntervalSet location
Location where constraint applies.
Visit edges in reverse of the natural order.
static InstructionSemantics2::BaseSemantics::StatePtr pathPostState(const Partitioner2::CfgPath &, size_t vertexIdx)
Get the state at the end of the specified vertex.
FunctionSummary()
Construct empty function summary.
bool nonAddressIsFeasible
Indeterminate/undiscovered vertices are feasible?
size_t maxVertexVisit
Max times to visit a particular vertex in one path.
Describes (part of) a physical CPU register.
size_t maxRecursionDepth
Max path length in terms of recursive function calls.
boost::shared_ptr< class RiscOperators > RiscOperatorsPtr
Shared-ownership pointer to a RISC operators object.
void reset()
Reset to initial state without changing settings.
A path through a control flow graph.
Definition: CfgPath.h:15
std::set< ControlFlowGraph::ConstEdgeIterator > CfgConstEdgeSet
Set of CFG edge pointers.
Information about a variable seen on a path.
virtual Action found(const FeasiblePath &analyzer, const Partitioner2::CfgPath &path, const InstructionSemantics2::BaseSemantics::DispatcherPtr &cpu, const SmtSolverPtr &solver)
Function invoked whenever a complete path is found.
FunctionSummarizer::Ptr functionSummarizer() const
Property: Function summary handling.
virtual bool shouldSummarizeCall(const Partitioner2::ControlFlowGraph::ConstVertexIterator &pathVertex, const Partitioner2::ControlFlowGraph &cfg, const Partitioner2::ControlFlowGraph::ConstVertexIterator &cfgCallTarget)
Determines whether a function call should be summarized instead of inlined.
bool isFunctionCall(const Partitioner2::ControlFlowGraph::ConstVertexIterator &) const
True if vertex is a function call.
SymbolicExpr::Ptr expr
Symbolic expression.
bool ignoreSemanticFailure
Whether to ignore instructions with no semantic info.
SearchMode searchMode
Method to use when searching for feasible paths.
size_t Id
Attribute identification.
Definition: Attribute.h:140
void clear()
Remove all vertices and edges.
Definition: Graph.h:1998
bool pathEndsWithFunctionCall(const Partitioner2::CfgPath &) const
True if path ends with a function call.
void printPath(std::ostream &out, const Partitioner2::CfgPath &) const
Print the path to the specified output stream.
std::set< rose_addr_t > AddressSet
Set of basic block addresses.
virtual InstructionSemantics2::BaseSemantics::DispatcherPtr buildVirtualCpu(const Partitioner2::Partitioner &, const Partitioner2::CfgPath *, PathProcessor *, const SmtSolver::Ptr &)
Create the virtual CPU.
const Settings & settings() const
Property: Settings used by this analysis.
size_t memByteNumber
Byte number for memory access.
int64_t stackDelta
Stack delta for summarized function.
Base class for reference counted objects.
Definition: SharedObject.h:64
double kCycleCoefficient
Coefficient for adjusting maxPathLengh during CFG cycles.
static Sawyer::CommandLine::SwitchGroup commandLineSwitches(Settings &settings)
Describe command-line switches.
virtual void nullDeref(const FeasiblePath &analyzer, const Partitioner2::CfgPath &path, IoMode ioMode, const InstructionSemantics2::BaseSemantics::SValuePtr &addr, SgAsmInstruction *)
Function invoked whenever a null pointer dereference is detected.
Sawyer::SharedPointer< FunctionSummarizer > Ptr
Reference counting pointer.
static Sawyer::Message::Facility mlog
Diagnostic output.
virtual void processVertex(const InstructionSemantics2::BaseSemantics::DispatcherPtr &cpu, const Partitioner2::ControlFlowGraph::ConstVertexIterator &pathsVertex, size_t &pathInsnIndex)
Process one vertex.
const VarDetails & varDetails(const InstructionSemantics2::BaseSemantics::StatePtr &) const
Details about all variables by name.
static size_t pathLength(const Partitioner2::CfgPath &)
Total length of path.
Partitioner2::ControlFlowGraph::ConstVertexIterator pathToCfg(const Partitioner2::ControlFlowGraph::ConstVertexIterator &pathVertex) const
Convert path vertex to a CFG vertex.
Visit edges in their natural, forward order.
const FunctionSummary & functionSummary(rose_addr_t entryVa) const
Function summary information.
const Partitioner2::Partitioner & partitioner() const
Property: Partitioner currently in use.
Defines registers available for a particular architecture.
Definition: Registers.h:35
const VarDetail & varDetail(const InstructionSemantics2::BaseSemantics::StatePtr &, const std::string &varName) const
Details about a variable.
virtual void processBasicBlock(const Partitioner2::BasicBlock::Ptr &bblock, const InstructionSemantics2::BaseSemantics::DispatcherPtr &cpu, size_t pathInsnIndex)
Process instructions for one basic block on the specified virtual CPU.
SymbolicExpr::Ptr memAddress
Address where variable is located.
Partitions instructions into basic blocks and functions.
Definition: Partitioner.h:293
const AddressSet & reachedBlockVas() const
Property: Addresses reached during analysis.
std::string solverName
Type of SMT solver.
EdgeVisitOrder
Edge visitation order.
void functionSummarizer(const FunctionSummarizer::Ptr &f)
Property: Function summary handling.
Settings & settings()
Property: Settings used by this analysis.
size_t memSize
Size of total memory access in bytes.
Container associating values with keys.
Definition: Sawyer/Map.h:66
std::string exprParserDoc
String documenting how expressions are parsed, empty for default.
bool processFinalVertex
Whether to process the last vertex of the path.
SgAsmInstruction * firstAccessInsn
Instruction address where this var was first read.
Settings that control this analysis.
static void initDiagnostics()
Initialize diagnostic output.
bool check
If true, look for null dereferences along the paths.
virtual void setInitialState(const InstructionSemantics2::BaseSemantics::DispatcherPtr &cpu, const Partitioner2::ControlFlowGraph::ConstVertexIterator &pathsBeginVertex)
Initialize state for first vertex of path.
Sawyer::Optional< rose_addr_t > initialStackPtr
Concrete value to use for stack pointer register initial value.
SemanticMemoryParadigm
Organization of semantic memory.
std::vector< Expression > assertions
Constraints to be satisfied at some point along the path.
virtual void init(const FeasiblePath &analysis, FunctionSummary &summary, const Partitioner2::Function::Ptr &function, Partitioner2::ControlFlowGraph::ConstVertexIterator cfgCallTarget)=0
Invoked when a new summary is created.