comments

git-svn-id: https://wala.svn.sourceforge.net/svnroot/wala/trunk@3540 f5eafffb-2e1d-0410-98e4-8ec43c5233c4

com.ibm.wala.core/src/com/ibm/wala/cfg/InducedCFG.java

@@ -483,11 +483,6 @@ public class InducedCFG extends AbstractCFG<SSAInstruction, InducedCFG.BasicBloc
       return start;
     }
 
-    /**
-     * Method getLastInstructionIndex.
-     * 
-     * @return int
-     */
     public int getLastInstructionIndex() {
       int exitNumber = InducedCFG.this.getNumber(exit());
       if (getGraphNodeId() == exitNumber) {
@@ -562,9 +557,6 @@ public class InducedCFG extends AbstractCFG<SSAInstruction, InducedCFG.BasicBloc
     }
   }
 
-  /**
-   * @see java.lang.Object#toString()
-   */
   @Override
   public String toString() {
     StringBuffer s = new StringBuffer("");

com.ibm.wala.core/src/com/ibm/wala/dataflow/IFDS/TabulationSolver.java

@@ -42,7 +42,6 @@ import com.ibm.wala.util.intset.MutableSparseIntSet;
 import com.ibm.wala.util.ref.ReferenceCleanser;
 
 /**
- * 
  * A precise interprocedural tabulation solver.
  * <p>
  * See Reps, Horwitz, Sagiv POPL 95.
@@ -50,17 +49,14 @@ import com.ibm.wala.util.ref.ReferenceCleanser;
  * This version differs in some ways from the POPL algorithm. In particular ...
  * <ul>
  * <li>to support exceptional control flow ... there may be several return sites for each call site.
- * <li>it supports an optional merge operator, useful for non-IFDS problems and widening
- * <li>it store summary edges at each callee instead of at each call site, to avoid unnecessary propagation during demand-driven
- * tabulation.
+ * <li>it supports an optional merge operator, useful for non-IFDS problems and widening.
+ * <li>it stores summary edges at each callee instead of at each call site.
  * </ul>
  * <p>
  * 
  * @param <T> type of node in the supergraph
  * @param <P> type of a procedure (like a box in an RSM)
  * @param <F> type of factoids propagated when solving this problem
- * 
- * @author sfink
  */
 public class TabulationSolver<T, P, F> {