<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="6.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Vineeth Kumar Paleri</style></author><author><style face="normal" font="default" size="100%">Y. N. Srikant</style></author><author><style face="normal" font="default" size="100%">Priti Shankar</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A Simple Algorithm for Partial Redundancy Elimination</style></title><secondary-title><style face="normal" font="default" size="100%">SIGPLAN Notices</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1998</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dl.acm.org/citation.cfm?doid=307824.307851</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">12</style></number><volume><style face="normal" font="default" size="100%">33</style></volume><pages><style face="normal" font="default" size="100%">35-43</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;The paper proposes a new algorithm for partial redundancy elimination based on the new concepts of safe partial availability and safe partial anticipability. These new concepts are derived by the integration of  the notion of safety into the definitions of partial availability and partial anticipability. It is both computationally and lifetime optimal and  requires four unidirectional analyses. The most important feature of the algorithm is its simplicity; the algorithm evolves naturally from the new concept of safe partial availability.&lt;/p&gt;
</style></abstract><notes><style face="normal" font="default" size="100%">&lt;p&gt;n/a&lt;/p&gt;
</style></notes></record></records></xml>