J.Cai, R.Paige: Program Derivation by Fixed Point Computation. Science of Computer Programming 11, pp. 197--261, 1989.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....These include simplifications of the equation system, partitioning the equation system into strongly connected components processed in (reverse) topological order, widening to ensure convergence when Abs does not have finite height etc. a good overview of useful techniques may be found in [1, 6, 9, 16]. Also the flow variables may be decomposed to families of flow variables over simpler value spaces using the isomorphisms 4 f1g Abs 0 = Abs 0 (E 1 ] E 2 ) Abs 0 = E 1 Abs 0 ) Theta (E 2 Abs 0 ) E (Abs 0 Theta Abs 00 ) E Abs 0 ) Theta (E Abs 00 ) ....

J.Cai, R.Paige: Program Derivation by Fixed Point Computation. Science of Computer Programming 11, pp. 197--261, 1989.

....These include simplifications of the equation system, partitioning the equation system into strongly connected components processed in (reverse) topological order, widening to ensure convergence when Abs does not have finite height etc. a good overview of useful techniques may be found in [2, 7, 10, 17]. Also the flow variables may be decomposed to families of flow variables over simpler value spaces. 6 Static Processor Allocation The idea behind the static processor allocation is that all processes with the same label will be placed on the same processor and we would therefore like to know ....

J.Cai, R.Paige: Program Derivation by Fixed Point Computation. Science of Computer Programming 11, pp. 197--261, 1989.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC