ACM transactions on programming languages and systems

• 

  Año 2005, Vol. 27, Número 3

  • Corrigendum: A New, Simpler Linear-Time Dominators Algorithm

    Jeffery R. Westbrook, Haim Kaplan, Anne Rogers, Adam L. Buchsbaum

    págs. 383-387

    

  • When Do Bounds and Domain Propagation Lead to the Same Search Space?

    Christian Schulte, Peter J. Stuckey

    págs. 388-425

    

  • A Practical and Fast Iterative Algorithm for ø-Function Computation Using DJ Graphs

    U. Ramakrishna, Dibyendu Das

    págs. 426-440

    

  • Resource Aware Programming

    Christian Queinnec, Luc Moreau

    págs. 441-476

    

  • CCured: Type-Safe Retrofitting of Legacy Software

    George C. Necula, Jeremy Condit, Matthew Harren, Scott McPeak, Westley Weimer

    págs. 477-526

    

  • Efficient and Effective Array Bound Checking

    Thi Viet Nga Nguyen, François Irigoin

    págs. 527-570

    

  • Comparing Conservative Coalescing Criteria

    Max Hailperin

    págs. 571-582