Freeness Analysis through Linear Refinement

Domains Decomposing Non-Redundant Sharing by Complementation . . . . . . . . . . . . . 69 Enea Zaffanella, Patricia M. Hill, Roberto Bagnara Freeness Analysis Through Linear Refinement . . . . . . . . . . . . . . . . . . . . . . . . . 85 Patricia Hill, Fausto Spoto Binary Decision Graphs. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 101 Laurent Mauborgne Binding-Time Analysis for Both Static and Dynamic Expressions . . . . . . . . 117 Kenichi Asai Concurrency Interpretation of Mobile Ambients . . . . . . . . . . . . . . . . . . . . . . . . . . . 134 Ren

• Type: Conference
• Year: 1999
• Where: AGP
• Authors: Patricia M. Hill, Fausto Spoto
• Keywords: AGP 1999, Artificial Intelligence, Bagnara Freeness Analysis, Hanne Riis Nielson, Kenichi Asai Concurrency