ACM Transactions on Programming Languages and Systems
2005
- A type system for certified binariesby: Zhong Shao, Valery Trifonov, Bratin Saha, Nikolaos Papaspyrou v. 27 i. 1 p. 1 - 45
- Regular expression types for XMLby: Haruo Hosoya, Jerome Vouillon, Benjamin C. Pierce v. 27 i. 1 p. 46 - 90
- Optimizing aggregate array computations in loopsby: Yanhong A. Liu, Scott D. Stoller, Ning Li, Tom Rothamel v. 27 i. 1 p. 91 - 125
- Automatic discovery of covariant read-only fieldsby: Jens Palsberg, Tian Zhao, Trevor Jim v. 27 i. 1 p. 126 - 162
- Pretty printing with lazy dequeuesby: Olaf Chitil v. 27 i. 1 p. 163 - 184
- Symbolic bounds analysis of pointers, array indices, and accessed memory regionsby: Radu Rugina, Martin C. Rinard v. 27 i. 2 p. 185 - 235
- Dealing with incomplete knowledge on CLP(FD) variable domainsby: Marco Gavanelli, Evelina Lamma, Paola Mello, Michela Milano v. 27 i. 2 p. 236 - 263
- Resource usage analysisby: Atsushi Igarashi, Naoki Kobayashi v. 27 i. 2 p. 264 - 313
- Polymorphic predicate abstractionby: Thomas Ball, Todd D. Millstein, Sriram K. Rajamani v. 27 i. 2 p. 314 - 343
- A systematic approach to static access controlby: François Pottier, Christian Skalka, Scott F. Smith v. 27 i. 2 p. 344 - 382
- Corrigendum: a new, simpler linear-time dominators algorithmby: Adam L. Buchsbaum, Haim Kaplan, Anne Rogers, Jeffery Westbrook v. 27 i. 3 p. 383 - 387
- When do bounds and domain propagation lead to the same search space?by: Christian Schulte, Peter J. Stuckey v. 27 i. 3 p. 388 - 425
- A practical and fast iterative algorithm for phi-function computation using DJ graphsby: Dibyendu Das, U. Ramakrishna v. 27 i. 3 p. 426 - 440
- Resource aware programmingby: Luc Moreau, Christian Queinnec v. 27 i. 3 p. 441 - 476
- CCured: type-safe retrofitting of legacy softwareby: George C. Necula, Jeremy Condit, Matthew Harren, Scott McPeak, Westley Weimer v. 27 i. 3 p. 477 - 526
- Efficient and effective array bound checkingby: Thi Viet Nga Nguyen, François Irigoin v. 27 i. 3 p. 527 - 570
- Comparing conservative coalescing criteriaby: Max Hailperin v. 27 i. 3 p. 571 - 582
- The KaffeOS Java runtime systemby: Godmar Back, Wilson C. Hsieh v. 27 i. 4 p. 583 - 630
- Cost and precision tradeoffs of dynamic data slicing algorithmsby: Xiangyu Zhang, Rajiv Gupta, Youtao Zhang v. 27 i. 4 p. 631 - 661
- Interprocedural parallelization analysis in SUIFby: Mary W. Hall, Saman P. Amarasinghe, Brian R. Murphy, Shih-Wei Liao, Monica S. Lam v. 27 i. 4 p. 662 - 731
- Design and evaluation of dynamic optimizations for a Java just-in-time compilerby: Toshio Suganuma, Toshiaki Yasue, Motohiro Kawahito, Hideaki Komatsu, Toshio Nakatani v. 27 i. 4 p. 732 - 785
- Analysis of recursive state machinesby: Rajeev Alur, Michael Benedikt, Kousha Etessami, Patrice Godefroid, Thomas W. Reps, Mihalis Yannakakis v. 27 i. 4 p. 786 - 818
- An interval constraint system for lattice domainsby: Antonio J. Fernández, Patricia M. Hill v. 26 i. 1 p. 1 - 46
- Send-receive considered harmful: Myths and realities of message passingby: Sergei Gorlatch v. 26 i. 1 p. 47 - 56
- Access control for mobile agents: The calculus of boxed ambientsby: Michele Bugliesi, Giuseppe Castagna, Silvia Crafa v. 26 i. 1 p. 57 - 124
- Synthesis of fault-tolerant concurrent programsby: Paul C. Attie, Anish Arora, E. Allen Emerson v. 26 i. 1 p. 125 - 185
- On exponential-time completeness of the circularity problem for attribute grammarsby: Pei-Chi Wu v. 26 i. 1 p. 186 - 190
- Offline partial evaluation can be as accurate as online partial evaluationby: Niels H. Christensen, Robert Glück v. 26 i. 1 p. 191 - 220
- Logic of global synchronyby: Yifeng Chen, Jeff W. Sanders v. 26 i. 2 p. 221 - 262
- A fast and accurate framework to analyze and optimize cache memory behaviorby: Xavier Vera, Nerina Bermudo, Josep Llosa, Antonio González v. 26 i. 2 p. 263 - 300
- Hancock: A language for analyzing transactional data streamsby: Corinna Cortes, Kathleen Fisher, Daryl Pregibon, Anne Rogers, Frederick Smith v. 26 i. 2 p. 301 - 338
- Modular refinement of hierarchic reactive machinesby: Rajeev Alur, Radu Grosu v. 26 i. 2 p. 339 - 369
- Traversals of object structures: Specification and Efficient Implementationby: Karl J. Lieberherr, Boaz Patt-Shamir, Doug Orleans v. 26 i. 2 p. 370 - 412
- A framework for the integration of partial evaluation and abstract interpretation of logic programsby: Michael Leuschel v. 26 i. 3 p. 413 - 463
- An unfold/fold transformation framework for definite logic programsby: Abhik Roychoudhury, K. Narayan Kumar, C. R. Ramakrishnan, I. V. Ramakrishnan v. 26 i. 3 p. 464 - 509
- Natural semantics as a static program analysis frameworkby: Sabine Glesner, Wolf Zimmermann v. 26 i. 3 p. 510 - 577
- JR: Flexible distributed programming in an extended Javaby: Aaron W. Keen, Tingjian Ge, Justin T. Maris, Ronald A. Olsson v. 26 i. 3 p. 578 - 608
- First-class monadic schedulesby: Rajiv Mirani, Paul Hudak v. 26 i. 4 p. 609 - 651
- Polymorphic specialization for MLby: Simon Helsen, Peter Thiemann v. 26 i. 4 p. 652 - 701
- Symmetry and reduced symmetry in model checkingby: A. Prasad Sistla, Patrice Godefroid v. 26 i. 4 p. 702 - 734
- Optimistic register coalescingby: Jinpyo Park, Soo-Mook Moon v. 26 i. 4 p. 735 - 765
- Guest editorialby: Martin Odersky, Benjamin C. Pierce v. 26 i. 5 p. 767 - 768
- Modern concurrency abstractions for C#by: Nick Benton, Luca Cardelli, Cédric Fournet v. 26 i. 5 p. 769 - 804
- Extensible objects without labelsby: Christopher A. Stone v. 26 i. 5 p. 805 - 835
- Modular typechecking for hierarchically extensible datatypes and functionsby: Todd D. Millstein, Colin Bleckner, Craig Chambers v. 26 i. 5 p. 836 - 889
- A semantics for advice and dynamic join points in aspect-oriented programmingby: Mitchell Wand, Gregor Kiczales, Christopher Dutchyn v. 26 i. 5 p. 890 - 910
- The pattern calculusby: C. Barry Jay v. 26 i. 6 p. 911 - 937
- A fast, memory-efficient register allocation framework for embedded systemsby: Sathyanarayanan Thammanur, Santosh Pande v. 26 i. 6 p. 938 - 974
- Automatic tiling of iterative stencil loopsby: Zhiyuan Li, Yonghong Song v. 26 i. 6 p. 975 - 1028
- A tail-recursive machine with stack inspectionby: John Clements, Matthias Felleisen v. 26 i. 6 p. 1029 - 1052
- Mobile safe ambientsby: Francesca Levi, Davide Sangiorgi v. 25 i. 1 p. 1 - 69
- Pointer analysis for structured parallel programsby: Radu Rugina, Martin C. Rinard v. 25 i. 1 p. 70 - 116
- Information flow inference for MLby: François Pottier, Vincent Simonet v. 25 i. 1 p. 117 - 158
- Intensional analysis of quantified typesby: Bratin Saha, Valery Trifonov, Zhong Shao v. 25 i. 2 p. 159 - 209
- A transformational approach to binary translation of delayed branchesby: Norman Ramsey, Cristina Cifuentes v. 25 i. 2 p. 210 - 224
- PolyTOIL: A type-safe polymorphic object-oriented languageby: Kim B. Bruce, Angela Schuett, Robert van Gent, Adrian Fiech v. 25 i. 2 p. 225 - 290
- A foundation for embedded languagesby: Morten Rhiger v. 25 i. 3 p. 291 - 315
- Eliminating synchronization bottlenecks using adaptive replicationby: Martin C. Rinard, Pedro C. Diniz v. 25 i. 3 p. 316 - 359
- Stack inspection: Theory and variantsby: Cédric Fournet, Andrew D. Gordon v. 25 i. 3 p. 360 - 399
- Rank 2 intersection types for local definitions and conditional expressionsby: Ferruccio Damiani v. 25 i. 4 p. 401 - 451
- Automatic program specialization for Javaby: Ulrik Pagh Schultz, Julia L. Lawall, Charles Consel v. 25 i. 4 p. 452 - 499
- Continuous program optimization: A case studyby: Thomas Kistler, Michael Franz v. 25 i. 4 p. 500 - 548
- The receptive distributed pi-calculusby: Roberto M. Amadio, Gérard Boudol, Cédric Lhoussaine v. 25 i. 5 p. 549 - 577
- Class analyses as abstract interpretations of trace semanticsby: Fausto Spoto, Thomas P. Jensen v. 25 i. 5 p. 578 - 630
- Generating LR syntax error messages from examplesby: Clinton L. Jeffery v. 25 i. 5 p. 631 - 640
- Jam - designing a Java extension with mixinsby: Davide Ancona, Giovanni Lagorio, Elena Zucca v. 25 i. 5 p. 641 - 712
- Escape analysis for JavaTM: Theory and practiceby: Bruno Blanchet v. 25 i. 6 p. 713 - 775
- Fractal symbolic analysisby: Vijay Menon, Keshav Pingali, Nikolay Mateev v. 25 i. 6 p. 776 - 813
- Extending Java for high-level Web service constructionby: Aske Simon Christensen, Anders Møller, Michael I. Schwartzbach v. 25 i. 6 p. 814 - 875
- Stack allocation and synchronization optimizations for Java using escape analysisby: Jong-Deok Choi, Manish Gupta, Mauricio J. Serrano, Vugranam C. Sreedhar, Samuel P. Midkiff v. 25 i. 6 p. 876 - 910
- Automatic data and computation decomposition on distributed memory parallel computersby: PeiZong Lee, Zvi M. Kedem v. 24 i. 1 p. 1 - 50
- An assume-guarantee rule for checking simulationby: Thomas A. Henzinger, Shaz Qadeer, Sriram K. Rajamani, Serdar Tasiran v. 24 i. 1 p. 51 - 64
- Efficient and precise array access analysisby: Yunheung Paek, Jay Hoeflinger, David A. Padua v. 24 i. 1 p. 65 - 109
- Guest editorialby: Kathleen Fisher, Benjamin C. Pierce v. 24 i. 2 p. 111 - 111
- Type-preserving compilation of Featherweight Javaby: Christopher League, Zhong Shao, Valery Trifonov v. 24 i. 2 p. 112 - 152
- More dynamic object reclassification: Fickle||by: Sophia Drossopoulou, Ferruccio Damiani, Mariangiola Dezani-Ciancaglini, Paola Giannini v. 24 i. 2 p. 153 - 191
- The apprentice challengeby: J. Strother Moore, George Porter v. 24 i. 3 p. 193 - 216
- Parametric shape analysis via 3-valued logicby: Shmuel Sagiv, Thomas W. Reps, Reinhard Wilhelm v. 24 i. 3 p. 217 - 298
- Handling irreducible loops: optimized node splitting versus DJ-graphsby: Sebastian Unger, Frank Mueller v. 24 i. 4 p. 299 - 333
- Compiling language definitions: the ASF+SDF compilerby: Mark van den Brand, Jan Heering, Paul Klint, Pieter A. Olivier v. 24 i. 4 p. 334 - 368
- Automatic derivation of compiler machine descriptionsby: Christian S. Collberg v. 24 i. 4 p. 369 - 408
- Register tiling in nonrectangular iteration spacesby: Marta Jiménez, José M. Llabería, Agustin Fernández v. 24 i. 4 p. 409 - 453
- On loops, dominators, and dominance frontiersby: G. Ramalingam v. 24 i. 5 p. 455 - 490
- Data abstraction and information hidingby: K. Rustan M. Leino, Greg Nelson v. 24 i. 5 p. 491 - 553
- The undecidability of associativity and commutativity analysisby: Arthur Charlesworth v. 24 i. 5 p. 554 - 565
- Information flow vs. resource access in the asynchronous pi-calculusby: Matthew Hennessy, James Riely v. 24 i. 5 p. 566 - 591
- On the usefulness of type and liveness accuracy for garbage collection and leak detectionby: Martin Hirzel, Amer Diwan, Johannes Henkel v. 24 i. 6 p. 593 - 624
- Practical extraction techniques for Javaby: Frank Tip, Peter F. Sweeney, Chris Laffra, Aldo Eisma, David Streeter v. 24 i. 6 p. 625 - 666
- Efficient and effective branch reordering using profile databy: Minghui Yang, Gang-Ryung Uh, David B. Whalley v. 24 i. 6 p. 667 - 697
- Repairing syntax errors in LR parsersby: Rafael Corchuelo, José Antonio Pérez, Antonio Ruiz Cortés, Miguel Toro v. 24 i. 6 p. 698 - 710
- Type-Safe linking with recursive DLLs and shared librariesby: Dominic Duggan v. 24 i. 6 p. 711 - 804
- Semiring-based contstraint logic programming: syntax and semanticsby: Stefano Bistarelli, Francesca Rossi v. 23 i. 1 p. 1 - 29
- Using types to analyze and optimize object-oriented programsby: Amer Diwan, Kathryn S. McKinley, J. Eliot B. Moss v. 23 i. 1 p. 30 - 72
- Scheduling time-constrained instructions on pipelined processorsby: Allen Leung, Krishna V. Palem, Amir Pnueli v. 23 i. 1 p. 73 - 103
- A schema for interprocedural modification side-effect analysis with pointer aliasingby: Barbara G. Ryder, William Landi, Phil Stocks, Sean Zhang, Rita Altucher v. 23 i. 2 p. 105 - 186
- Synthesis of concurrent programs for an atomic read/write model of computationby: Paul C. Attie, E. Allen Emerson v. 23 i. 2 p. 187 - 242
- Type elaboration and subtype completion for Java bytecodeby: Todd B. Knoblock, Jakob Rehof v. 23 i. 2 p. 243 - 272
- Model checking of hierarchical state machinesby: Rajeev Alur, Mihalis Yannakakis v. 23 i. 3 p. 273 - 303
- Transformations of CCP programsby: Sandro Etalle, Maurizio Gabbrielli, Maria Chiara Meo v. 23 i. 3 p. 304 - 395
- Featherweight Java: a minimal core calculus for Java and GJby: Atsushi Igarashi, Benjamin C. Pierce, Philip Wadler v. 23 i. 3 p. 396 - 450
- Error repair with validation in LR-based parsingby: Ik-Soon Kim, Kwang-Moo Choe v. 23 i. 4 p. 451 - 471
- Parallel execution of prolog programs: a surveyby: Gopal Gupta, Enrico Pontelli, Khayri A. M. Ali, Mats Carlsson, Manuel V. Hermenegildo v. 23 i. 4 p. 472 - 602
- Operator strength reductionby: Keith D. Cooper, L. Taylor Simpson, Christopher A. Vick v. 23 i. 5 p. 603 - 625
- Mechanizing a theory of program composition for UNITYby: Lawrence C. Paulson v. 23 i. 5 p. 626 - 656
- An indexed model of recursive types for foundational proof-carrying codeby: Andrew W. Appel, David A. McAllester v. 23 i. 5 p. 657 - 683
- A framework for call graph construction algorithmsby: David Grove, Craig Chambers v. 23 i. 6 p. 685 - 746
- Efficient Java RMI for parallel programmingby: Jason Maassen, Rob van Nieuwpoort, Ronald Veldema, Henri E. Bal, Thilo Kielmann, Ceriel J. H. Jacobs, Rutger F. H. Hofman v. 23 i. 6 p. 747 - 775
- Lessons learned about one-way, dataflow constraints in the Garnet and Amulet graphical toolkitsby: Bradley T. Vander Zanden, Richard L. Halterman, Brad A. Myers, Richard G. McDaniel, Robert C. Miller, Pedro A. Szekely, Dario A. Giuse, David S. Kosbie v. 23 i. 6 p. 776 - 796
- Local type inferenceby: Benjamin C. Pierce, David N. Turner v. 22 i. 1 p. 1 - 44
- Lazy rewriting on eager machineryby: Wan Fokkink, Jasper Kamperman, Pum Walters v. 22 i. 1 p. 45 - 86
- An automata-theortetic approach to modular model checkingby: Orna Kupferman, Moshe Y. Vardi v. 22 i. 1 p. 87 - 128
- Efficient and safe-for-space closure conversionby: Zhong Shao, Andrew W. Appel v. 22 i. 1 p. 129 - 161
- Undecidability of context-sensitive data-independence analysisby: Thomas W. Reps v. 22 i. 1 p. 162 - 186
- Incremental analysis of constraint logic programsby: Manuel V. Hermenegildo, German Puebla, Kim Marriott, Peter J. Stuckey v. 22 i. 2 p. 187 - 223
- Generation of LR parsers by partial evaluationby: Michael Sperber, Peter Thiemann v. 22 i. 2 p. 224 - 264
- From flop to megaflops: Java for technical computingby: José E. Moreira, Samuel P. Midkiff, Manish Gupta v. 22 i. 2 p. 265 - 295
- Independence in CLP languagesby: Maria J. García de la Banda, Manuel V. Hermenegildo, Kim Marriott v. 22 i. 2 p. 296 - 339
- Type-based analysis of uncaught exceptionsby: Xavier Leroy, François Pessaux v. 22 i. 2 p. 340 - 377
- Compiler techniques for code compactionby: Saumya K. Debray, William S. Evans, Robert Muth, Bjorn De Sutter v. 22 i. 2 p. 378 - 415
- Context-sensitive synchronization-sensitive analysis is undecidableby: G. Ramalingam v. 22 i. 2 p. 416 - 430
- Fusion-based register allocationby: Guei-Yuan Lueh, Thomas R. Gross, Ali-Reza Adl-Tabatabai v. 22 i. 3 p. 431 - 470
- Java bytecode compression for low-end embedded systemsby: Lars Ræder Clausen, Ulrik Pagh Schultz, Charles Consel, Gilles Muller v. 22 i. 3 p. 471 - 489
- Automated data-member layout of help objects to improve memory-hierarchy performanceby: Thomas Kistler, Michael Franz v. 22 i. 3 p. 490 - 505
- Integrating object-oriented programming and protected objects in Ada 95by: Andy J. Wellings, Bob Johnson, Bo Sanden, Jörg Kienzle, Thomas Wolf, Stephen Michell v. 22 i. 3 p. 506 - 539
- Understanding class hierarchies using concept analysisby: Gregor Snelting, Frank Tip v. 22 i. 3 p. 540 - 582
- Graph rewrite systems for program optimizationby: Uwe Aßmann v. 22 i. 4 p. 583 - 637
- Standard fixpoint iteration for Java bytecode verificationby: Zhenyu Qian v. 22 i. 4 p. 638 - 672
- Program transformation and runtime support for threaded MPI execution on shared-memory machinesby: Hong Tang, Kai Shen, Tao Yang v. 22 i. 4 p. 673 - 700
- Typed memory management via static capabilitiesby: David Walker, Karl Crary, J. Gregory Morrisett v. 22 i. 4 p. 701 - 771
- Optimizing memory usage in the polyhedral modelby: Fabien Quilleré, Sanjay V. Rajopadhye v. 22 i. 5 p. 773 - 815
- A balanced code placement frameworkby: Reinhard von Hanxleden, Ken Kennedy v. 22 i. 5 p. 816 - 860
- Sets and constraint logic programmingby: Agostino Dovier, Carla Piazza, Enrico Pontelli, Gianfranco Rossi v. 22 i. 5 p. 861 - 931
- The benefits and costs of DyC's run-time optimizationsby: Brian Grant, Markus Mock, Matthai Philipose, Craig Chambers, Susan J. Eggers v. 22 i. 5 p. 932 - 972
- Extending Graham-Glanville techniques for optimal code generationby: Maya Madhavan, Priti Shankar, Siddhartha Rai, U. Ramakrishna v. 22 i. 6 p. 973 - 1001
- The role of commutativity in constraint propagation algorithmsby: Krzysztof R. Apt v. 22 i. 6 p. 1002 - 1036
- Syntactic type abstractionby: Dan Grossman, J. Gregory Morrisett, Steve Zdancewic v. 22 i. 6 p. 1037 - 1080
- On Failure of the Pruning Technique in ``Error Repair in Shift-Reduce Parsers''by: Eberhard Bertsch, Mark-Jan Nederhof v. 21 i. 1 p. 1 - 10
- Dynamic Typing for Distributed Programming in Polymorphic Languagesby: Dominic Duggan v. 21 i. 1 p. 11 - 45
- Specification and Verification of Fault-Tolerance, Timing, and Schedulingby: Zhiming Liu, Mathai Joseph v. 21 i. 1 p. 46 - 89
- A Type System for Java Bytecode Subroutinesby: Raymie Stata, Martín Abadi v. 21 i. 1 p. 90 - 137
- Space-Efficient Scheduling of Nested Parallelismby: Girija J. Narlikar, Guy E. Blelloch v. 21 i. 1 p. 138 - 173
- Identifying Loops in Almost Linear Timeby: G. Ramalingam v. 21 i. 2 p. 175 - 188
- Effectivness of Abstract Interpretation in Automatic Parallelization: A Case Study in Logic Programmingby: Francisco Bueno, Maria J. García de la Banda, Manuel V. Hermenegildo v. 21 i. 2 p. 189 - 239
- A Provably Time-Efficient Parallel Implementation of Full Speculationby: John Greiner, Guy E. Blelloch v. 21 i. 2 p. 240 - 285
- Techniques for the Translation of MATLAB Programs into Fortran 90by: Luiz De Rose, David A. Padua v. 21 i. 2 p. 286 - 323
- 'C and tcc: A Language and Compiler for Dynamic Code Generationby: Massimiliano Poletto, Wilson C. Hsieh, Dawson R. Engler, M. Frans Kaashoek v. 21 i. 2 p. 324 - 369
- Componential Set-Based Analysisby: Cormac Flanagan, Matthias Felleisen v. 21 i. 2 p. 370 - 416
- Reasoning about Grover's quantum search algorithm using probabilistic wpby: Michael J. Butler, Pieter H. Hartel v. 21 i. 3 p. 417 - 429
- Compile-time memory reuse in logic programming languages through update in placeby: Gudjon Gudjonsson, William H. Winsborough v. 21 i. 3 p. 430 - 501
- Should your specification language be typedby: Leslie Lamport, Lawrence C. Paulson v. 21 i. 3 p. 502 - 526
- From system F to typed assembly languageby: J. Gregory Morrisett, David Walker, Karl Crary, Neal Glew v. 21 i. 3 p. 527 - 568
- Efficient logic variables for distributed computingby: Seif Haridi, Peter Van Roy, Per Brand, Michael Mehl, Ralf Scheidhauer, Gert Smolka v. 21 i. 3 p. 569 - 626
- Partial redundancy elimination in SSA formby: Robert Kennedy, Sun Chan, Shin-Ming Liu, Raymond Lo, Peng Tu, Fred C. Chow v. 21 i. 3 p. 627 - 676
- Specificational functionsby: Joseph M. Morris, Alexander Bunkenburg v. 21 i. 3 p. 677 - 701
- Cache miss equations: a compiler framework for analyzing and tuning memory behaviorby: Somnath Ghosh, Margaret Martonosi, Sharad Malik v. 21 i. 4 p. 703 - 746
- Model-checking concurrent systems with unbounded integer variables: symbolic representations, approximations, and experimental resultsby: Tevfik Bultan, Richard Gerber, William Pugh v. 21 i. 4 p. 747 - 789
- Dependency analysis for Standard MLby: Matthias Blume v. 21 i. 4 p. 790 - 812
- Hierarchical modularityby: Matthias Blume, Andrew W. Appel v. 21 i. 4 p. 813 - 847
- Interprocedural pointer alias analysisby: Michael Hind, Michael G. Burke, Paul R. Carini, Jong-Deok Choi v. 21 i. 4 p. 848 - 894
- Linear scan register allocationby: Massimiliano Poletto, Vivek Sarkar v. 21 i. 5 p. 895 - 913
- Linearity and the pi-calculusby: Naoki Kobayashi, Benjamin C. Pierce, David N. Turner v. 21 i. 5 p. 914 - 947
- Sharing and groundness dependencies in logic programsby: Michael Codish, Harald Søndergaard, Peter J. Stuckey v. 21 i. 5 p. 948 - 976
- Procedure placement using temporal-ordering informationby: Nicholas C. Gloy, Michael D. Smith v. 21 i. 5 p. 977 - 1027
- Static correlated branch predictionby: Cliff Young, Michael D. Smith v. 21 i. 5 p. 1028 - 1075
- Specification and dialogue control of visual interaction through visual rewriting systemsby: Paolo Bottoni, Maria Francesca Costabile, Piero Mussio v. 21 i. 6 p. 1077 - 1136
- Constraint-based termination analysis of logic programsby: Stefaan Decorte, Danny De Schreye, Henk Vandecasteele v. 21 i. 6 p. 1137 - 1195
- The type system for object initializatiion in the Jave bytecode languageby: Stephen N. Freund, John C. Mitchell v. 21 i. 6 p. 1196 - 1250
- A global communication optimization technique based on data-flow analysis and linear algebraby: Mahmut T. Kandemir, Prithviraj Banerjee, Alok N. Choudhary, J. Ramanujam, Nagaraj Shenoy v. 21 i. 6 p. 1251 - 1297
- Solving Shape-Analysis Problems in Languages with Destructive Updatingby: Shmuel Sagiv, Thomas W. Reps, Reinhard Wilhelm v. 20 i. 1 p. 1 - 50
- Synthesis of Concurrent Systems with Many Similar Processesby: Paul C. Attie, E. Allen Emerson v. 20 i. 1 p. 51 - 115
- Fast Algorithms for Compressed Multimethod Dispatch Table Generationby: Eric Dujardin, Eric Amiel, Eric Simon v. 20 i. 1 p. 116 - 165
- Polymorphic Splitting: An Effective Polyvariant Flow Analysisby: Andrew K. Wright, Suresh Jagannathan v. 20 i. 1 p. 166 - 207
- Controlling Generalization amd Polyvariance in Partial Deduction of Normal Logic Programsby: Michael Leuschel, Bern Martens, Danny De Schreye v. 20 i. 1 p. 208 - 258
- "Maximal-munch" Tokenization in Linear Timeby: Thomas W. Reps v. 20 i. 2 p. 259 - 273
- A Study of the Applicability of Existing Exception-Handling Techniques to Component-Base Real-Time Software Technologyby: Jun Lang, David B. Stewart v. 20 i. 2 p. 274 - 301
- Isomorph-Free Model Enumeration: A New Method for Checking Relational Specificationsby: Daniel Jackson, Somesh Jha, Craig Damon v. 20 i. 2 p. 302 - 343
- A Systematic Study of Functional Language Implementationsby: Rémi Douence, Pascal Fradet v. 20 i. 2 p. 344 - 387
- A New Framework for Elimination-Based Data Flow Analysis Using DJ Graphsby: Vugranam C. Sreedhar, Guang R. Gao, Yong-Fong Lee v. 20 i. 2 p. 388 - 435
- A Partially Deadlock-Free Typed Process Calculusby: Naoki Kobayashi v. 20 i. 2 p. 436 - 482
- The Design, Implementation, and Evaluation of Jadeby: Martin C. Rinard, Monica S. Lam v. 20 i. 3 p. 483 - 545
- Static Caching for Incremental Computationby: Yanhong A. Liu, Scott D. Stoller, Tim Teitelbaum v. 20 i. 3 p. 546 - 585
- An Abstract Machine for Tabled Execution of Fixed-Order Stratified Logic Programsby: Konstantinos F. Sagonas, Terrance Swift v. 20 i. 3 p. 586 - 634
- Constraint-Based Array Dependence Analysisby: William Pugh, David Wonnacott v. 20 i. 3 p. 635 - 678
- Within ARM's Reach: Compilation of Left-Linear Rewrite Systems via Minimal Rewrite Systemsby: Wan Fokkink, Jasper Kamperman, Pum Walters v. 20 i. 3 p. 679 - 706
- Proofs about a Folklore Let-Polymorphic Type Inference Algorithmby: Oukseh Lee, Kwangkeun Yi v. 20 i. 4 p. 707 - 723
- A Region Inference Algorithmby: Mads Tofte, Lars Birkedal v. 20 i. 4 p. 724 - 767
- Partial Evaluation of Functional Logic Programsby: María Alpuente, Moreno Falaschi, Germán Vidal v. 20 i. 4 p. 768 - 844
- A Practical and Flexible Flow Analysis for Higher-Order Languagesby: J. Michael Ashley, R. Kent Dybvig v. 20 i. 4 p. 845 - 868
- Automatic Data Layout for Distributed-Memory Machinesby: Ken Kennedy, Ulrich Kremer v. 20 i. 4 p. 869 - 916
- Compositional Verification of Concurrent Systems Using Petri-Net-Based Condensation Rulesby: Eric Y. T. Juan, Jeffrey J. P. Tsai, Tadao Murata v. 20 i. 5 p. 917 - 979
- Efficient and Flexible Incremental Parsingby: Tim A. Wagner, Susan L. Graham v. 20 i. 5 p. 980 - 1013
- Alma-O: An Imperative Language That Supports Declarative Programmingby: Krzysztof R. Apt, Jacob Brunekreef, Vincent Partington, Andrea Schaerf v. 20 i. 5 p. 1014 - 1066
- A Logical Model for Relational Abstract Domainsby: Roberto Giacobazzi, Francesca Scozzari v. 20 i. 5 p. 1067 - 1109
- Dynamic Currency Determination in Optimized Programsby: Dhananjay M. Dhamdhere, K. V. Sankaranarayanan v. 20 i. 6 p. 1111 - 1130
- A Task- and Data-Parallel Programming Language Based on Shared Objectsby: Saniya Ben Hassen, Henri E. Bal, Ceriel J. H. Jacobs v. 20 i. 6 p. 1131 - 1170
- Finitary Fairnessby: Rajeev Alur, Thomas A. Henzinger v. 20 i. 6 p. 1171 - 1194
- Space/Time-Efficient Scheduling and Execution of Parallel Irregular Computationsby: Tao Yang, Cong Fu v. 20 i. 6 p. 1195 - 1222
- Optimizing Compilation of CLP(R)by: Andrew D. Kelly, Kim Marriott, Andrew D. Macdonald, Peter J. Stuckey, Roland H. C. Yap v. 20 i. 6 p. 1223 - 1250
- Equality-based flow analysis versus recursive typesby: Jens Palsberg v. 20 i. 6 p. 1251 - 1264
- A New, Simpler Linear-Time Dominators Algorithmby: Adam L. Buchsbaum, Haim Kaplan, Anne Rogers, Jeffery Westbrook v. 20 i. 6 p. 1265 - 1296
- Cost-Optimal Code Motionby: Max Hailperin v. 20 i. 6 p. 1297 - 1322
- Precise Flow-Insensitive May-Alias Analysis is NP-Hardby: Susan Horwitz v. 19 i. 1 p. 1 - 6
- Complementation in Abstract Interpretationby: Agostino Cortesi, Gilberto Filé, Roberto Giacobazzi, Catuscia Palamidessi, Francesco Ranzato v. 19 i. 1 p. 7 - 47
- Lightweight Closure Conversionby: Paul Steckler, Mitchell Wand v. 19 i. 1 p. 48 - 86
- A Practical Soft Type System for Schemeby: Andrew K. Wright, Robert Cartwright v. 19 i. 1 p. 87 - 152
- Implementing Signatures for C++by: Gerald Baumgartner, Vincent F. Russo v. 19 i. 1 p. 153 - 187
- Evidence-Based Static Branch Prediction Using Machine Learningby: Brad Calder, Dirk Grunwald, Michael P. Jones, Donald C. Lindsay, James H. Martin, Michael Mozer, Benjamin G. Zorn v. 19 i. 1 p. 188 - 222
- Pure Versus Impure Lispby: Nicholas Pippenger v. 19 i. 2 p. 223 - 238
- Incremental Computation of Dominator Treesby: Vugranam C. Sreedhar, Guang R. Gao, Yong-Fong Lee v. 19 i. 2 p. 239 - 252
- Abstract Interpretation of Reactive Systemsby: Dennis Dams, Rob Gerth, Orna Grumberg v. 19 i. 2 p. 253 - 291
- Protocol Specifications and Component Adaptorsby: Daniel M. Yellin, Robert E. Strom v. 19 i. 2 p. 292 - 333
- Formally Based Profiling for Higher-Order Functional Languagesby: Patrick M. Sansom, Simon L. Peyton Jones v. 19 i. 2 p. 334 - 385
- Symboloc Model Checking for Event-Driven Real-Time Systemsby: Jin Yang, Aloysius K. Mok, Farn Wang v. 19 i. 2 p. 386 - 412
- On the Use of Regular Expressions for Searching Textby: Charles L. A. Clarke, Gordon V. Cormack v. 19 i. 3 p. 413 - 426
- Kleene Algebra with Testsby: Dexter Kozen v. 19 i. 3 p. 427 - 443
- Formal Derivation of Efficient Parallel Programs by Construction of List Homomorphismsby: Zhenjiang Hu, Hideya Iwasaki, Masato Takeichi v. 19 i. 3 p. 444 - 461
- Optimal Control Dependence Computation and the Roman Chariots Problemby: Keshav Pingali, Gianfranco Bilardi v. 19 i. 3 p. 462 - 491
- Specifying Representations of Machine Instructionsby: Norman Ramsey, Mary F. Fernandez v. 19 i. 3 p. 492 - 524
- Slicing Real-Time Programs for Enhanced Schedulabilityby: Richard Gerber, Seongsoo Hong v. 19 i. 3 p. 525 - 555
- Nesting of Reducible and Irreducible Loopsby: Paul Havlak v. 19 i. 4 p. 557 - 567
- Interprocedural Control Flow Analysis of First-Order Programs with Tail-Call Optimizationby: Saumya K. Debray, Todd A. Proebsting v. 19 i. 4 p. 568 - 585
- A Refinement Calculus for the Synthesis of Verified Hardware Descriptions in VHDLby: Peter T. Breuer, Carlos Delgado Kloos, Andrés Marín López, Natividad Martínez Madrid, Luis Sánchez Fernández v. 19 i. 4 p. 585 - 616
- Utilizing Symmetry when Model-Checking under Fairness Assumptions: An Automata-Theoretic Approachby: E. Allen Emerson, A. Prasad Sistla v. 19 i. 4 p. 617 - 638
- Toward a Complete Transformational Toolkit for Compilersby: Jan A. Bergstra, T. B. Dinesh, John Field, Jan Heering v. 19 i. 5 p. 639 - 684
- Proving Concurrent Constraint Programs Correctby: Frank S. de Boer, Maurizio Gabbrielli, Elena Marchiori, Catuscia Palamidessi v. 19 i. 5 p. 685 - 725
- Verifying Parameterized Networksby: Edmund M. Clarke, Orna Grumberg, Somesh Jha v. 19 i. 5 p. 726 - 750
- Disjunctive Program Analysis for Algebraic Data Typesby: Thomas P. Jensen v. 19 i. 5 p. 751 - 803
- Mobile Objects in Distributed Ozby: Peter Van Roy, Seif Haridi, Per Brand, Gert Smolka, Michael Mehl, Ralf Scheidhauer v. 19 i. 5 p. 804 - 851
- Parallelizing Nonnumerical Code with Selective Scheduling and Software Pipeliningby: Soo-Mook Moon, Kemal Ebcioglu v. 19 i. 6 p. 853 - 898
- Combinatory Formaulations of Concurrent Languagesby: N. Raja, R. K. Shyamasundar v. 19 i. 6 p. 899 - 915
- A Reflection on Call-by-Valueby: Amr Sabry, Philip Wadler v. 19 i. 6 p. 916 - 941
- Commutativity Analysis: A New Analysis Technique for Parallelizing Compilersby: Martin C. Rinard, Pedro C. Diniz v. 19 i. 6 p. 942 - 991
- A Practical Framework for Demand-Driven Interprocedural Data Flow Analysisby: Evelyn Duesterwald, Rajiv Gupta, Mary Lou Soffa v. 19 i. 6 p. 992 - 1030
- Making Graphs Reducible with Controlled Node Splittingby: Johan Janssen, Henk Corporaal v. 19 i. 6 p. 1031 - 1052
- An Approach for Exploring Code-Improving Transformationsby: Deborah Whitfield, Mary Lou Soffa v. 19 i. 6 p. 1053 - 1084
- A Note on "On the Conversion of Indirect to Direct Recursion"by: Ting Yu, Owen Kaser v. 19 i. 6 p. 1085 - 1087
- Iteration Abstraction in Satherby: Stephan Murer, Stephen M. Omohundro, David Stoutamire, Clemens A. Szyperski v. 18 i. 1 p. 1 - 15
- On the Optimality of Change Propagation for Incremental Evaluation of Hierarchical Attribute Grammarsby: Alan Carle, Lori L. Pollock v. 18 i. 1 p. 16 - 29
- An Incremental Algorithm for Satisfying Hierarchies of Multiway Dataflow Constraintsby: Brad T. Vander Zanden v. 18 i. 1 p. 30 - 72
- Conditional Attribute Grammarsby: John Boyland v. 18 i. 1 p. 73 - 108
- Type Classes in Haskellby: Cordelia V. Hall, Kevin Hammond, Simon L. Peyton Jones, Philip Wadler v. 18 i. 2 p. 109 - 138
- Handling Floating-Point Exceptions in Numeric Programsby: John R. Hauser v. 18 i. 2 p. 139 - 174
- Total Correctness by Local Improvement in the Transformation of Functional Programsby: David Sands v. 18 i. 2 p. 175 - 234
- Storage Assignment to Decrease Code Sizeby: Stan Y. Liao, Srinivas Devadas, Kurt Keutzer, Steven W. K. Tjiang, Albert Wang v. 18 i. 3 p. 235 - 253
- Polymorphic typing of Variables and Referencesby: Geoffrey Smith, Dennis M. Volpano v. 18 i. 3 p. 254 - 267
- Parallelism for Free: Efficient and Optimal Bitvector Analyses for Parallel Programsby: Jens Knoop, Bernhard Steffen, Jürgen Vollmer v. 18 i. 3 p. 268 - 299
- Iterated Register Coalescingby: Lal George, Andrew W. Appel v. 18 i. 3 p. 300 - 324
- Probabilistic Predicate Transformersby: Carroll Morgan, Annabelle McIver, Karen Seidel v. 18 i. 3 p. 325 - 353
- Reconciling Responsiveness with Performance in Pure Object-Orieted Languagesby: Urs Hölzle, David Ungar v. 18 i. 4 p. 355 - 400
- On Subtyping and Matchingby: Martín Abadi, Luca Cardelli v. 18 i. 4 p. 401 - 423
- Improving Data Locality with Loop Transformationsby: Kathryn S. McKinley, Steve Carr, Chau-Wen Tseng v. 18 i. 4 p. 424 - 453
- Compositional Parallel Programming Languagesby: Ian T. Foster v. 18 i. 4 p. 454 - 476
- Symbolic Analysis for Parallelizing Compilersby: Mohammad R. Haghighat, Constantine D. Polychronopoulos v. 18 i. 4 p. 477 - 518
- Constrained Types and Their Expressivenessby: Jens Palsberg, Scott F. Smith v. 18 i. 5 p. 519 - 527
- Principles and Practice of Unification Factoringby: Steven Dawson, C. R. Ramakrishnan, Steven Skiena, Terrance Swift v. 18 i. 5 p. 528 - 563
- Global Analysis of Constraint Logic Programsby: Maria J. García de la Banda, Manuel V. Hermenegildo, Maurice Bruynooghe, Veroniek Dumortier, Gerda Janssens, Wim Simoens v. 18 i. 5 p. 564 - 614
- Indirect Distributed Garbage Collection: Handling Object Migrationby: José M. Piquer v. 18 i. 5 p. 615 - 647
- Identifying Loops Using DJ Graphsby: Vugranam C. Sreedhar, Guang R. Gao, Yong-Fong Lee v. 18 i. 6 p. 649 - 658
- Using Dataflow Analysis Techniques to Reduce Ownership Overhead in Cache Coherence Protocolsby: Jonas Skeppstedt, Per Stenström v. 18 i. 6 p. 659 - 682
- Demand-Driven Register Allocationby: Todd A. Proebsting, Charles N. Fischer v. 18 i. 6 p. 683 - 710
- A Natural Semantics for Eiffel Dynamic Bindingby: Isabelle Attali, Denis Caromel, Sidi O. Ehmety v. 18 i. 6
