Examples of InequalitySolver

ptolemy.graph.InequalitySolver

An algorithm to solve a set of inequality constraints. This algorithm is based on J. Rehof and T. Mogensen, "Tractable Constraints in Finite Semilattices," Third International Static Analysis Symposium, pp. 285-301, Vol 1145 of Lecture Notes in Computer Science, Springer, Sept., 1996.

The algorithm in Rehof works for definite inequalities. This class does not enforce this requirement. However, if the inequalities are not definite, this solver may not be able to find the solution even when the set of inequalities is satisfiable. See the above paper for details.

This solver supports finding both the least and greatest solutions (if they exist). It assumes that the CPO passed to the constructor is a lattice, but it does not verify it. If the algorithm finds that the LUB or GLB of some elements does not exist, an Exception is thrown. @author Yuhong Xiong @version $Id: InequalitySolver.java,v 1.93 2007/12/06 18:22:56 cxh Exp $ @since Ptolemy II 0.2 @Pt.ProposedRating Green (cxh) @Pt.AcceptedRating Red (cxh)

             }
             */


            if (constraintList.size() > 0) {
                CPO cpo = TypeLattice.lattice();
                InequalitySolver solver = new InequalitySolver(cpo);
                Iterator constraints = constraintList.iterator();


                solver.addInequalities(constraints);


                try {
                    // Find the least solution (most specific types)
                    solver.solveLeast();
                } catch (InvalidStateException ex) {
                    throw new InvalidStateException(topLevel, ex,
                            "The basic type lattic was: "
                                    + TypeLattice.basicLattice());
                }

            System.out.println("Starting type specialization");
        }


        _unsafeLocals = unsafeLocals;


        _solver = new InequalitySolver(new JavaTypeLattice());


        //TypeLattice.lattice());
        _objectToInequalityTerm = new HashMap();


        // Get the variables.

            System.out.println("Starting type specialization list");
        }


        _unsafeLocals = unsafeLocals;


        _solver = new InequalitySolver(new JavaTypeLattice()); //TypeLattice.lattice());
        _objectToInequalityTerm = new HashMap();


        for (Iterator classes = list.iterator(); classes.hasNext();) {
            SootClass theClass = (SootClass) classes.next();
            _collectVariables(theClass, _debug);

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.

Examples of InequalitySolver

Examples of ptolemy.graph.InequalitySolver

Examples of ptolemy.graph.InequalitySolver

Examples of ptolemy.graph.InequalitySolver