default search action
ACM Transactions on Programming Languages and Systems (TOPLAS), Volume 27
Volume 27, Number 1, January 2005
- Zhong Shao, Valery Trifonov, Bratin Saha, Nikolaos Papaspyrou:
A type system for certified binaries. 1-45 - Haruo Hosoya, Jerome Vouillon, Benjamin C. Pierce:
Regular expression types for XML. 46-90 - Yanhong A. Liu, Scott D. Stoller, Ning Li, Tom Rothamel:
Optimizing aggregate array computations in loops. 91-125 - Jens Palsberg, Tian Zhao, Trevor Jim:
Automatic discovery of covariant read-only fields. 126-162 - Olaf Chitil:
Pretty printing with lazy dequeues. 163-184
Volume 27, Number 2, March 2005
- Radu Rugina, Martin C. Rinard:
Symbolic bounds analysis of pointers, array indices, and accessed memory regions. 185-235 - Marco Gavanelli, Evelina Lamma, Paola Mello, Michela Milano:
Dealing with incomplete knowledge on CLP(FD) variable domains. 236-263 - Atsushi Igarashi, Naoki Kobayashi:
Resource usage analysis. 264-313 - Thomas Ball, Todd D. Millstein, Sriram K. Rajamani:
Polymorphic predicate abstraction. 314-343 - François Pottier, Christian Skalka, Scott F. Smith:
A systematic approach to static access control. 344-382
Volume 27, Number 3, May 2005
- Adam L. Buchsbaum, Haim Kaplan, Anne Rogers, Jeffery R. Westbrook:
Corrigendum: a new, simpler linear-time dominators algorithm. 383-387 - Christian Schulte, Peter J. Stuckey:
When do bounds and domain propagation lead to the same search space? 388-425 - Dibyendu Das, U. Ramakrishna:
A practical and fast iterative algorithm for phi-function computation using DJ graphs. 426-440 - Luc Moreau, Christian Queinnec:
Resource aware programming. 441-476 - George C. Necula, Jeremy Condit, Matthew Harren, Scott McPeak, Westley Weimer:
CCured: type-safe retrofitting of legacy software. 477-526 - Thi Viet Nga Nguyen, François Irigoin:
Efficient and effective array bound checking. 527-570 - Max Hailperin:
Comparing conservative coalescing criteria. 571-582
Volume 27, Number 4, July 2005
- Godmar Back, Wilson C. Hsieh:
The KaffeOS Java runtime system. 583-630 - Xiangyu Zhang, Rajiv Gupta, Youtao Zhang:
Cost and precision tradeoffs of dynamic data slicing algorithms. 631-661 - Mary W. Hall, Saman P. Amarasinghe, Brian R. Murphy, Shih-Wei Liao, Monica S. Lam:
Interprocedural parallelization analysis in SUIF. 662-731 - Toshio Suganuma, Toshiaki Yasue, Motohiro Kawahito, Hideaki Komatsu, Toshio Nakatani:
Design and evaluation of dynamic optimizations for a Java just-in-time compiler. 732-785 - Rajeev Alur, Michael Benedikt, Kousha Etessami, Patrice Godefroid, Thomas W. Reps, Mihalis Yannakakis:
Analysis of recursive state machines. 786-818
Volume 27, Number 5, September 2005
- Joseph Gil, Yoav Zibin:
Efficient subtyping tests with PQ-encoding. 819-856 - Tom Hirschowitz, Xavier Leroy:
Mixin modules in a call-by-value setting. 857-881 - Bjorn De Sutter, Bruno De Bus, Koen De Bosschere:
Link-time binary rewriting techniques for program compaction. 882-945 - Xavier Vera, Jaume Abella, Josep Llosa, Antonio González:
An accurate cost model for guiding data locality transformations. 946-987 - Raymond T. Boute:
Functional declarative language design and predicate calculus: a practical approach. 988-1047
Volume 27, Number 6, November 2005
- Michael W. Hicks, Scott Nettles:
Dynamic software updating. 1049-1096 - Katherine Barabash, Ori Ben-Yitzhak, Irit Goft, Elliot K. Kolodner, Victor Leikehman, Yoav Ossia, Avi Owshanko, Erez Petrank:
A parallel, incremental, mostly concurrent garbage collector for servers. 1097-1146 - Arne J. Glenstrup, Neil D. Jones:
Termination analysis and specialization-point insertion in offline partial evaluation. 1147-1215 - Peter J. Stuckey, Martin Sulzmann:
A theory of overloading. 1216-1269 - Peter A. Buhr, Ashif S. Harji:
Implicit-signal monitors. 1270-1343 - Luc Moreau, Peter Dickman, Richard E. Jones:
Birrell's distributed reference listing revisited. 1344-1395
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.