TOPLAS 2005

33 papers

1. A parallel, incremental, mostly concurrent garbage collector for servers · Katherine Barabash, Ori Ben-Yitzhak, Irit Goft, Elliot K. Kolodner, Victor Leikehman, Yoav Ossia + 2 more
2. A practical and fast iterative algorithm for phi-function computation using DJ graphs · Dibyendu Das, U. Ramakrishna
3. A systematic approach to static access control · François Pottier, Christian Skalka, Scott F. Smith
4. A theory of overloading · Peter J. Stuckey, Martin Sulzmann
5. A type system for certified binaries · Zhong Shao, Valery Trifonov, Bratin Saha, Nikolaos Papaspyrou
6. An accurate cost model for guiding data locality transformations · Xavier Vera, Jaume Abella, Josep Llosa, Antonio González
7. Analysis of recursive state machines · Rajeev Alur, Michael Benedikt, Kousha Etessami, Patrice Godefroid, Thomas W. Reps, Mihalis Yannakakis
8. Automatic discovery of covariant read-only fields · Jens Palsberg, Tian Zhao, Trevor Jim
9. Birrell's distributed reference listing revisited · Luc Moreau, Peter Dickman, Richard E. Jones
10. CCured: type-safe retrofitting of legacy software · George C. Necula, Jeremy Condit, Matthew Harren, Scott McPeak, Westley Weimer
11. Comparing conservative coalescing criteria · Max Hailperin
12. Corrigendum: a new, simpler linear-time dominators algorithm · Adam L. Buchsbaum, Haim Kaplan, Anne Rogers, Jeffery R. Westbrook
13. Cost and precision tradeoffs of dynamic data slicing algorithms · Xiangyu Zhang, Rajiv Gupta, Youtao Zhang
14. Dealing with incomplete knowledge on CLP(FD) variable domains · Marco Gavanelli, Evelina Lamma, Paola Mello, Michela Milano
15. Design and evaluation of dynamic optimizations for a Java just-in-time compiler · Toshio Suganuma, Toshiaki Yasue, Motohiro Kawahito, Hideaki Komatsu, Toshio Nakatani
16. Dynamic software updating · Michael W. Hicks, Scott Nettles
17. Efficient and effective array bound checking · Thi Viet Nga Nguyen, François Irigoin
18. Efficient subtyping tests with PQ-encoding · Joseph Gil, Yoav Zibin
19. Functional declarative language design and predicate calculus: a practical approach · Raymond T. Boute
20. Implicit-signal monitors · Peter A. Buhr, Ashif S. Harji
21. Interprocedural parallelization analysis in SUIF · Mary W. Hall, Saman P. Amarasinghe, Brian R. Murphy, Shih-Wei Liao, Monica S. Lam
22. Link-time binary rewriting techniques for program compaction · Bjorn De Sutter, Bruno De Bus, Koen De Bosschere
23. Mixin modules in a call-by-value setting · Tom Hirschowitz, Xavier Leroy
24. Optimizing aggregate array computations in loops · Yanhong A. Liu, Scott D. Stoller, Ning Li, Tom Rothamel
25. Polymorphic predicate abstraction · Thomas Ball, Todd D. Millstein, Sriram K. Rajamani
26. Pretty printing with lazy dequeues · Olaf Chitil
27. Regular expression types for XML · Haruo Hosoya, Jerome Vouillon, Benjamin C. Pierce
28. Resource aware programming · Luc Moreau, Christian Queinnec
29. Resource usage analysis · Atsushi Igarashi, Naoki Kobayashi
30. Symbolic bounds analysis of pointers, array indices, and accessed memory regions · Radu Rugina, Martin C. Rinard
31. Termination analysis and specialization-point insertion in offline partial evaluation · Arne J. Glenstrup, Neil D. Jones
32. The KaffeOS Java runtime system · Godmar Back, Wilson C. Hsieh
33. When do bounds and domain propagation lead to the same search space? · Christian Schulte, Peter J. Stuckey