Package statechum.analysis.learning

Examples of statechum.analysis.learning.Smt


  public Smt getSolver()
  {
    if (smtSolver != null)
      return smtSolver;
    Smt.loadLibrary();Smt.closeStdOut();
    smtSolver = new Smt();
    if (usingLowLevelFunctions) smtSolver.loadData(knownTraces);
    return smtSolver;
  }
View Full Code Here


  /** Checks if a path condition corresponding to an abstract state is satisfiable.
   * @return false if a path leading to the supplied state is not satisfiable.
   */
  protected boolean checkSatisfiability(String variableDeclarations,String condition)
  {
    Smt solver = getSolver();
    solver.pushContext();
    String whatToCheck = LabelRepresentation.getAssertionFromVarAndAxiom(variableDeclarations,condition);
    //System.err.println("CHECK: "+whatToCheck);
    solver.loadData(whatToCheck);
    boolean outcome = solver.check();
    solver.popContext();return outcome;   
  }
View Full Code Here

  public Smt getSolver()
  {
    if (smtSolver != null)
      return smtSolver;
    Smt.loadLibrary();Smt.closeStdOut();
    smtSolver = new Smt();
    if (usingLowLevelFunctions) smtSolver.loadData(knownTraces);
    return smtSolver;
  }
View Full Code Here

  /** Checks if a path condition corresponding to an abstract state is satisfiable.
   * @return false if a path leading to the supplied state is not satisfiable.
   */
  protected boolean checkSatisfiability(String variableDeclarations,String condition)
  {
    Smt solver = getSolver();
    solver.pushContext();
    String whatToCheck = SmtLabelRepresentation.getAssertionFromVarAndAxiom(variableDeclarations,condition);
    //System.err.println("CHECK: "+whatToCheck);
    solver.loadData(whatToCheck);
    boolean outcome = solver.check();
    solver.popContext();return outcome;   
  }
View Full Code Here

  public Smt getSolver()
  {
    if (smtSolver != null)
      return smtSolver;
    Smt.loadLibrary();Smt.closeStdOut();
    smtSolver = new Smt();
    if (usingLowLevelFunctions) smtSolver.loadData(knownTraces);
    return smtSolver;
  }
View Full Code Here

  /** Checks if a path condition corresponding to an abstract state is satisfiable.
   * @return false if a path leading to the supplied state is not satisfiable.
   */
  protected boolean checkSatisfiability(String variableDeclarations,String condition)
  {
    Smt solver = getSolver();
    solver.pushContext();
    String whatToCheck = SmtLabelRepresentation.getAssertionFromVarAndAxiom(variableDeclarations,condition);
    //System.err.println("CHECK: "+whatToCheck);
    solver.loadData(whatToCheck);
    boolean outcome = solver.check();
    solver.popContext();return outcome;   
  }
View Full Code Here

  public Smt getSolver()
  {
    if (smtSolver != null)
      return smtSolver;
    Smt.loadLibrary();Smt.closeStdOut();
    smtSolver = new Smt();
    if (usingLowLevelFunctions) smtSolver.loadData(knownTraces);
    return smtSolver;
  }
View Full Code Here

  /** Checks if a path condition corresponding to an abstract state is satisfiable.
   * @return false if a path leading to the supplied state is not satisfiable.
   */
  protected boolean checkSatisfiability(String variableDeclarations,String condition)
  {
    Smt solver = getSolver();
    solver.pushContext();
    String whatToCheck = SmtLabelRepresentation.getAssertionFromVarAndAxiom(variableDeclarations,condition);
    //System.err.println("CHECK: "+whatToCheck);
    solver.loadData(whatToCheck);
    boolean outcome = solver.check();
    solver.popContext();return outcome;   
  }
View Full Code Here

    lbls.parseLabel(INITMEM+" "+LabelRepresentation.XM_DATA.POST+ " (and (= m_N 0) (= m_N 1))");
    lbls.parseLabel("add"+" "+LabelRepresentation.XM_DATA.POST+ " (= m_N (+ m_M 1))");
    lbls.parseLabel("remove"+" "+LabelRepresentation.XM_DATA.PRE+ " (> m_N 0)");
    lbls.parseLabel("remove"+" "+LabelRepresentation.XM_DATA.POST+ " (= m_N (- m_M 1))");
    final LearnerGraph graph = new LearnerGraph(config);
    Smt.loadLibrary();Smt.closeStdOut();final Smt smt = new Smt();
    final List<String> sequence = Arrays.asList(new String[]{});

    Helper.checkForCorrectException(new whatToRun() { public void run() {
      lbls.AugmentAbstractStates(smt,sequence, graph,true);// initial state
    }},IllegalArgumentException.class,"unsatisfiable");
View Full Code Here

    lbls.parseLabel(INITMEM+" "+LabelRepresentation.XM_DATA.POST+ " (and (= m_N 0) (= m_N 1))");
    lbls.parseLabel("add"+" "+LabelRepresentation.XM_DATA.POST+ " (= m_N (+ m_M 1))");
    lbls.parseLabel("remove"+" "+LabelRepresentation.XM_DATA.PRE+ " (> m_N 0)");
    lbls.parseLabel("remove"+" "+LabelRepresentation.XM_DATA.POST+ " (= m_N (- m_M 1))");
    final LearnerGraph graph = new LearnerGraph(config);
    Smt.loadLibrary();Smt.closeStdOut();final Smt smt = new Smt();
    final List<String> sequence = Arrays.asList(new String[]{});
   
    lbls.AugmentAbstractStates(smt,sequence, graph,false);// initial state
  }
View Full Code Here

TOP

Related Classes of statechum.analysis.learning.Smt

Copyright © 2018 www.massapicom. All rights reserved.
All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.