Table of Contents

• The case for evolvable softwareStephanie Forrest. 1 [doi]
• Art, science, and fearBenjamin C. Pierce. 2 [doi]
• To achieve our highest goals, we must be willing to abandon themKenneth O. Stanley. 3 [doi]
• Efficient modular glass box software model checkingMichael Roberson, Chandrasekhar Boyapati. 4-21 [doi]
• An experiment about static and dynamic type systems: doubts about the positive impact of static type systems on development timeStefan Hanenberg. 22-35 [doi]
• A simple inductive synthesis methodology and its applicationsShachar Itzhaky, Sumit Gulwani, Neil Immerman, Mooly Sagiv. 36-46 [doi]
• A domain-specific approach to architecturing error handling in pervasive computingJulien Mercadal, Quentin Enard, Charles Consel, Nicolas Loriant. 47-61 [doi]
• G-Finder: routing programming questions closer to the expertsWei Li, Charles Zhang, Songlin Hu. 62-73 [doi]
• Agility in contextRashina Hoda, Philippe Kruchten, James Noble, Stuart Marshall. 74-88 [doi]
• Lime: a Java-compatible and synthesizable language for heterogeneous architecturesJoshua S. Auerbach, David F. Bacon, Perry Cheng, Rodric M. Rabbah. 89-108 [doi]
• From OO to FPGA: fitting round objects into square hardware?Stephen Kou, Jens Palsberg. 109-124 [doi]
• An input-centric paradigm for program dynamic optimizationsKai Tian, Yunlian Jiang, Eddy Z. Zhang, Xipeng Shen. 125-139 [doi]
• Composable specifications for structured shared-memory communicationBenjamin P. Wood, Adrian Sampson, Luis Ceze, Dan Grossman. 140-159 [doi]
• Do I use the wrong definition?: DeFuse: definition-use invariants for detecting concurrency and sequential bugsYao Shi, Soyeon Park, Zuoning Yin, Shan Lu, Yuanyuan Zhou, Wenguang Chen, Weimin Zheng. 160-174 [doi]
• Scalable and systematic detection of buggy inconsistencies in source codeMark Gabel, Junfeng Yang, Yuan Yu, Moisés Goldszmidt, Zhendong Su. 175-190 [doi]
• A study of Java s non-Java memoryKazunori Ogata, Dai Mikurube, Kiyokuni Kawachiya, Scott Trent, Tamiya Onodera. 191-204 [doi]
• Hera-JVM: a runtime system for heterogeneous multi-core architecturesRoss McIlroy, Joe Sventek. 205-222 [doi]
• Cross-language, type-safe, and transparent object sharing for co-located managed runtimesMichal Wegiel, Chandra Krintz. 223-240 [doi]
• Instrumentation and sampling strategies for cooperative concurrency bug isolationGuoliang Jin, Aditya V. Thakur, Ben Liblit, Shan Lu. 241-255 [doi]
• What can the GC compute efficiently?: a language for heap assertions at GC timeChristoph Reichenbach, Neil Immerman, Yannis Smaragdakis, Edward Aftandilian, Samuel Z. Guyer. 256-269 [doi]
• Monitor optimization via stutter-equivalent loop transformationRahul Purandare, Matthew B. Dwyer, Sebastian G. Elbaum. 270-285 [doi]
• Specifying and implementing refactoringsMax Schäfer, Oege de Moor. 286-301 [doi]
• A graph-based approach to API usage adaptationHoan Anh Nguyen, Tung Thanh Nguyen, Gary Wilson Jr., Anh Tuan Nguyen, Miryung Kim, Tien N. Nguyen. 302-321 [doi]
• Component adaptation and assembly using interface relationsStephen Kell. 322-340 [doi]
• Type classes as objects and implicitsBruno C. d. S. Oliveira, Adriaan Moors, Martin Odersky. 341-360 [doi]
• Supporting dynamic, third-party code customizations in JavaScript using aspectsBenjamin S. Lerner, Herman Venter, Dan Grossman. 361-376 [doi]
• Dynamic parallelization of recursive code: part 1: managing control flow interactions with the continuatorCharlotte Herzeel, Pascal Costanza. 377-396 [doi]
• Symbolic heap abstraction with demand-driven axiomatization of memory invariantsIsil Dillig, Thomas Dillig, Alex Aiken. 397-410 [doi]
• A dynamic evaluation of the precision of static heap abstractionsPercy Liang, Omer Tripp, Mayur Naik, Mooly Sagiv. 411-427 [doi]
• Parallel inclusion-based points-to analysisMario Méndez-Lojo, Augustine Mathew, Keshav Pingali. 428-443 [doi]
• The Spoofax language workbench: rules for declarative specification of languages and IDEsLennart C. L. Kats, Eelco Visser. 444-463 [doi]
• MetaFJig: a meta-circular composition language for Java-like classesMarco Servetto, Elena Zucca. 464-483 [doi]
• Modular logic metaprogrammingKarl Klose, Klaus Ostermann. 484-503 [doi]
• Reasoning about multiple related abstractions with MultiStarStephan van Staden, Cristiano Calcagno. 504-519 [doi]
• Homogeneous family sharingXin Qi, Andrew C. Myers. 520-538 [doi]
• Mostly modular compilation of crosscutting concerns by contextual predicate dispatchShigeru Chiba, Atsushi Igarashi, Salikh Zakirov. 539-554 [doi]
• Random testing for higher-order, stateful programsCasey Klein, Matthew Flatt, Robby Findler. 555-566 [doi]
• The two-state solution: native and serializable continuations accordJay A. McCarthy. 567-582 [doi]
• Back to the futures: incremental parallelization of existing sequential runtime systemsJames Swaine, Kevin Tew, Peter A. Dinda, Robby Findler, Matthew Flatt. 583-597 [doi]
• Ownership and immutability in generic JavaYoav Zibin, Alex Potanin, Paley Li, Mahmood Ali, Michael D. Ernst. 598-617 [doi]
• Tribal ownershipNicholas R. Cameron, James Noble, Tobias Wrigstad. 618-633 [doi]
• A time-aware type system for data-race protection and guaranteed initializationNicholas D. Matsakis, Thomas R. Gross. 634-651 [doi]
• Automatic atomic region identification in shared memory SPMD programsGautam Upadhyaya, Samuel P. Midkiff, Vijay S. Pai. 652-670 [doi]
• Task types for pervasive atomicityAditya Kulkarni, Yu David Liu, Scott F. Smith. 671-690 [doi]
• Concurrent programming with revisions and isolation typesSebastian Burckhardt, Alexandro Baldassin, Daan Leijen. 691-707 [doi]
• SPUR: a trace-based JIT compiler for CILMichael Bebenita, Florian Brandner, Manuel Fähndrich, Francesco Logozzo, Wolfram Schulte, Nikolai Tillmann, Herman Venter. 708-725 [doi]
• Refactoring references for library migrationPuneet Kapur, Bradley Cossette, Robert J. Walker. 726-738 [doi]
• Performance analysis of idle programsErik A. Altman, Matthew Arnold, Stephen Fink, Nick Mitchell. 739-753 [doi]
• Registration-based language abstractionsSamuel Davis, Gregor Kiczales. 754-773 [doi]
• Pinocchio: bringing reflection to life with first-class interpretersToon Verwaest, Camillo Bruni, David Gurtner, Adrian Lienhard, Oscar Nierstrasz. 774-789 [doi]
• Concurrency by modularity: design patterns, a case in pointHridesh Rajan, Steven M. Kautz, Wayne Rowcliffe. 790-805 [doi]
• Patterns and statistical analysis for understanding reduced resource computingMartin C. Rinard, Henry Hoffmann, Sasa Misailovic, Stelios Sidiroglou. 806-821 [doi]
• Programming with time: cyber-physical programming with impromptuAndrew Sorensen, Henry Gardner. 822-834 [doi]
• Language virtualization for heterogeneous parallel computingHassan Chafi, Zach DeVito, Adriaan Moors, Tiark Rompf, Arvind K. Sujeeth, Pat Hanrahan, Martin Odersky, Kunle Olukotun. 835-847 [doi]
• Flexible modeling tools for pre-requirements analysis: conceptual architecture and research challengesHarold Ossher, Rachel K. E. Bellamy, Ian Simmonds, David Amid, Ateret Anaby-Tavor, Matthew Callery, Michael Desmond, Jacqueline de Vries, Amit Fisher, Sophia Krasikov. 848-864 [doi]
• To upgrade or not to upgrade: impact of online upgrades across multiple administrative domainsTudor Dumitras, Priya Narasimhan, Eli Tilevich. 865-876 [doi]
• Managing ambiguity in programming by finding unambiguous examplesKenneth C. Arnold, Henry Lieberman. 877-884 [doi]
• Better science through artRichard P. Gabriel, Kevin J. Sullivan. 885-900 [doi]
• Rubber ducks, nightmares, and unsaturated predicates: proto-scientific schemata are good for agileJenny Quillien, Dave West. 901-917 [doi]
• Pure and declarative syntax definition: paradise lost and regainedLennart C. L. Kats, Eelco Visser, Guido Wachsmuth. 918-932 [doi]
• Faith, hope, and love: an essay on software science s neglect of human factorsStefan Hanenberg. 933-946 [doi]
• The Tower of Babel did not failPaul Adamczyk, Munawar Hafiz. 947-957 [doi]