array_theorem_producer.h

Go to the documentation of this file.

/*****************************************************************************/
/*!
 * \file array_theorem_producer.h
 * 
 * Author: Clark Barrett, 5/29/2003
 * 
 * Created: May 29 19:16:33 GMT 2003
 *
 * <hr>
 * Copyright (C) 2003 by the Board of Trustees of Leland Stanford
 * Junior University and by New York University. 
 *
 * License to use, copy, modify, sell and/or distribute this software
 * and its documentation for any purpose is hereby granted without
 * royalty, subject to the terms and conditions defined in the \ref
 * LICENSE file provided with this distribution.  In particular:
 *
 * - The above copyright notice and this permission notice must appear
 * in all copies of the software and related documentation.
 *
 * - THE SOFTWARE IS PROVIDED "AS-IS", WITHOUT ANY WARRANTIES,
 * EXPRESSED OR IMPLIED.  USE IT AT YOUR OWN RISK.
 * 
 * <hr>
 * 
 * CLASS: ArrayProofRules
 * 
 * 
 * Description: TRUSTED implementation of array proof rules.  DO
 * NOT use this file in any DP code, use the exported API in
 * array_proof_rules.h instead.
 * 
 */
/*****************************************************************************/
#ifndef _cvcl__theory_array__array_theorem_producer_h_
#define _cvcl__theory_array__array_theorem_producer_h_

#include "array_proof_rules.h"
#include "theorem_producer.h"

namespace CVCL {
  

  class ArrayTheoremProducer: public ArrayProofRules, public TheoremProducer {
  private:
    // Inserting flea proof arguments for a canonical sum
  public:
    // Constructor
    ArrayTheoremProducer(TheoremManager* tm) : TheoremProducer(tm) { }

    ////////////////////////////////////////////////////////////////////
    // Proof rules
    ////////////////////////////////////////////////////////////////////

    // ==>
    // write(store, index_0, v_0, index_1, v_1, ..., index_n, v_n) = store IFF
    //
    // read(store, index_n) = v_n &
    // index_{n-1} != index_n -> read(store, index_{n-1}) = v_{n-1} &
    // (index_{n-2} != index_{n-1} & index_{n-2} != index_n) -> read(store, index_{n-2}) = v_{n-2} &
    // ...
    // (index_1 != index_2 & ... & index_1 != index_n) -> read(store, index_1) = v_1
    // (index_0 != index_1 & index_0 != index_2 & ... & index_0 != index_n) -> read(store, index_0) = v_0
    Theorem rewriteSameStore(const Expr& e, int n);

    // ==> write(store, index, value) = write(...) IFF
    //       store = write(write(...), index, read(store, index)) &
    //       value = read(write(...), index)
    Theorem rewriteWriteWrite(const Expr& e);

    // ==> read(write(store, index1, value), index2) =
    //   ite(index1 = index2, value, read(store, index2))
    Theorem rewriteReadWrite(const Expr& e);

    // value = read(store, index) ==>
    //   write(store, index, value) = store
    Theorem rewriteRedundantWrite1(const Theorem& v_eq_r,
                                   const Expr& write);

    // ==>
    //   write(write(store, index, v1), index, v2) = write(store, index, v2)
    Theorem rewriteRedundantWrite2(const Expr& e);

    // ==>
    //   write(write(store, index1, v1), index2, v2) =
    //   write(write(store, index2, v2), index1, ite(index1 = index2, v2, v1))
    Theorem interchangeIndices(const Expr& e);
    // Beta reduction of array literal: |- (array x. f(x))[arg] = f(arg)
    Theorem readArrayLiteral(const Expr& e);

  }; // end of class ArrayTheoremProducer

} // end of namespace CVCL

#endif

---