To e ectively parallelize real programs, parallelizing compilers need powerful symbolic analysis techniques [13, 6]. In previous work we have introduced an algorithm called range propagation [4] that provides such capabilities. Range propagation has been implemented in Polaris, a parallelizing Fortran compiler being developed at the University of Illinois [7]. Because the algorithm is relativel...

Many researchers have proposed programming languages that support incremental computation (IC), which allows programs to be efficiently re-executed after a small change to the input. However, existing implementations of such languages have two important drawbacks. First, recomputation is oblivious to specific demands on the program output; that is, if a program input changes, all dependencies w...

We discuss how to perform symbolic execution of large programs in a manner that is both compositional (hence more scalable) and demand-driven. Compositional symbolic execution means finding feasible interprocedural program paths by composing symbolic executions of feasible intraprocedural paths. By demand-driven, we mean that as few intraprocedural paths as possible are symbolically executed in...

abstract in agriculture, there is a lag between planting decision and supplying the produced commodity to the market. this makes the marketed commodities as predetermined variables and prices as market clearing factor. under such a condition, the inverse demand function in which price is a function of quantity is an appropriate tool for forecasting price responses to the injected quantities to ...

When the user input is first received by the erver, th system performs a string match comparing the user's answer to pre-stored answers. Each pre-stored answer is accompanied by a previously computed analysis for student model updates. Storing multiple answers allows for freer student input and, at an introductory level, involves little extra work. At an advanced level where exercises become ev...

We present new characterizations of the Raiffa and Kalai-Smorodinsky solutions based on strategyproofness of an allocation mechanism for an underlying economy with Leontief preferences. Our first result shows that the 2-player Kalai-Smorodinsky solution is the unique bargaining solution which if Efficient, Symmetric, Scale Invariant and Strategyproof on a Leontief economy. Next we consider the ...