http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
Second Symposium, PADO 2001, Aarhus, Denmark, May 21-23, 2001 : proceedings
1 online resource (viii, 277 pages) : illustrations
Program Analysis for Implicit Computational Complexity / Neil D. Jones -- Deriving Preconditions for Array Bound Check Elimination / Wei-Ngan Chin, Siau-Cheng Khoo and Dana N. Xu -- Type Systems for Useless-Variable Elimination / Adam Fischbach and John Hannan -- Boolean Constraints for Binding-Time Analysis / Kevin Glynn, Peter J. Stuckey and Martin Sulzmann / [and others] -- Constraint Abstractions / Jorgen Gustavsson and Josef Svenningsson -- Implementing Circularity Using Partial Evaluation / Julia L. Lawall -- Combining Forward and Backward Analyses of Temporal Properties / Damien Masse -- Numerical Power Analysis / Isabella Mastroeni -- Run-Time Bytecode Specialization / Hidehiko Masuhara and Akinori Yonezawa.
Includes bibliographical references and index.
Lecture notes in computer science ; 2053