Abstract is missing.
- The sequential prisonIvan Sutherland. 1-2 [doi]
- SHERIFF: precise detection and automatic mitigation of false sharingTongping Liu, Emery D. Berger. 3-18 [doi]
- Accentuating the positive: atomicity inference and enforcement using correct executionsDasarath Weeratunge, Xiangyu Zhang, Suresh Jagannathan. 19-34 [doi]
- SOS: saving time in dynamic race detection with stationary analysisDu Li, Witawas Srisa-an, Matthew B. Dwyer. 35-50 [doi]
- Testing atomicity of composed concurrent operationsOhad Shacham, Nathan Grasso Bronson, Alex Aiken, Mooly Sagiv, Martin T. Vechev, Eran Yahav. 51-64 [doi]
- Data-driven synthesis for object-oriented frameworksKuat Yessenov, Zhilei Xu, Armando Solar-Lezama. 65-82 [doi]
- Synthesis of first-order dynamic programming algorithmsYewen Pu, Rastislav Bodík, Saurabh Srivastava. 83-98 [doi]
- Kind analysis for MATLABJesse Doherty, Laurie J. Hendren, Soroush Radpour. 99-118 [doi]
- Tool-supported refactoring for JavaScriptAsger Feldthaus, Todd D. Millstein, Anders Møller, Max Schäfer, Frank Tip. 119-138 [doi]
- Integrated language definition testing: enabling test-driven language developmentLennart C. L. Kats, Rob Vermaas, Eelco Visser. 139-154 [doi]
- Catch me if you can: performance bug detection in the wildMilan Jovic, Andrea Adamoli, Matthias Hauswirth. 155-170 [doi]
- PREFAIL: a programmable tool for multiple-failure injectionPallavi Joshi, Haryadi S. Gunawi, Koushik Sen. 171-188 [doi]
- Synthesizing method sequences for high-coverage testingSuresh Thummalapenta, Tao Xie, Nikolai Tillmann, Jonathan de Halleux, Zhendong Su. 189-206 [doi]
- HAWKEYE: effective discovery of dataflow impediments to parallelizationOmer Tripp, Greta Yorsh, John Field, Mooly Sagiv. 207-224 [doi]
- Automatic fine-grain locking using shape propertiesGuy Golan-Gueta, Nathan Grasso Bronson, Alex Aiken, G. Ramalingam, Mooly Sagiv, Eran Yahav. 225-242 [doi]
- Safe parallel programming using dynamic dependence hintsChuanle Ke, Lei Liu, Chao Zhang, Tongxin Bai, Bryan Jacobs, Chen Ding. 243-258 [doi]
- Sprint: speculative prefetching of remote dataArun Raman, Greta Yorsh, Martin T. Vechev, Eran Yahav. 259-274 [doi]
- Asynchronous assertionsEdward Aftandilian, Samuel Z. Guyer, Martin T. Vechev, Eran Yahav. 275-288 [doi]
- Ribbons: a partially shared memory programming modelKevin J. Hoffman, Harrison Metzger, Patrick Eugster. 289-306 [doi]
- Why nothing matters: the impact of zeroingXi Yang, Stephen M. Blackburn, Daniel Frampton, Jennifer B. Sartor, Kathryn S. McKinley. 307-324 [doi]
- Trustworthy numerical computation in ScalaEva Darulova, Viktor Kuncak. 325-344 [doi]
- JET: exception checking in the Java native interfaceSiliang Li, Gang Tan. 345-358 [doi]
- Immutable specifications for more concise and precise verificationCristina David, Wei-Ngan Chin. 359-374 [doi]
- Hybrid partial evaluationAmin Shali, William R. Cook. 375-390 [doi]
- SugarJ: library-based syntactic language extensibilitySebastian Erdweg, Tillmann Rendel, Christian Kästner, Klaus Ostermann. 391-406 [doi]
- Reactive imperative programming with dataflow constraintsCamil Demetrescu, Irene Finocchi, Andrea Ribichini. 407-426 [doi]
- Two for the price of one: a model for parallel and incremental computationSebastian Burckhardt, Daan Leijen, Caitlin Sadowski, Jaeheon Yi, Thomas Ball. 427-444 [doi]
- A step towards transparent integration of input-consciousness into dynamic program optimizationsKai Tian, Eddy Z. Zhang, Xipeng Shen. 445-462 [doi]
- Enhancing locality for recursive traversals of recursive structuresYoungjoon Jo, Milind Kulkarni. 463-482 [doi]
- Flow-sensitive type recovery in linear-log timeMichael D. Adams 0001, Andrew W. Keep, Jan Midtgaard, Matthew Might, Arun Chauhan, R. Kent Dybvig. 483-498 [doi]
- Oracle scheduling: controlling granularity in implicitly parallel languagesUmut A. Acar, Arthur Charguéraud, Mike Rainey. 499-518 [doi]
- Kismet: parallel speedup estimates for serial programsDonghwan Jeon, Saturnino Garcia, Christopher M. Louie, Michael Bedford Taylor. 519-536 [doi]
- Efficiently speeding up sequential computation through the n-way programming modelRomain Cledat, Tushar Kumar, Santosh Pande. 537-554 [doi]
- Exploiting coarse-grain speculative parallelismHari K. Pyla, Calvin J. Ribbens, Srinidhi Varadarajan. 555-574 [doi]
- Scalable join patternsAaron Joseph Turon, Claudio V. Russo. 575-594 [doi]
- Product lines of theoremsBenjamin Delaware, William R. Cook, Don S. Batory. 595-608 [doi]
- Gradual typing for genericsLintaro Ina, Atsushi Igarashi. 609-624 [doi]
- A theory of substructural types and controlJesse A. Tov, Riccardo Pucella. 625-642 [doi]
- Benefits and barriers of user evaluation in software engineering researchRaymond P. L. Buse, Caitlin Sadowski, Westley Weimer. 643-656 [doi]
- Da capo con scala: design and analysis of a scala benchmark suite for the java virtual machineAndreas Sewe, Mira Mezini, Aibek Sarimbekov, Walter Binder. 657-676 [doi]
- Automated construction of JavaScript benchmarksGregor Richards, Andreas Gal, Brendan Eich, Jan Vitek. 677-694 [doi]
- Declaratively programming the mobile web with MoblZef Hemel, Eelco Visser. 695-712 [doi]
- First-class state change in plaidJoshua Sunshine, Karl Naden, Sven Stork, Jonathan Aldrich, Éric Tanter. 713-732 [doi]
- Cedalion: a language for language oriented programmingDavid H. Lorenz, Boaz Rosenan. 733-752 [doi]
- Self-adjusting stack machinesMatthew A. Hammer, Georg Neis, Yan Chen, Umut A. Acar. 753-772 [doi]
- JIT compilation policy for modern machinesPrasad A. Kulkarni. 773-788 [doi]
- Reducing trace selection footprint for large-scale Java applications without performance lossPeng Wu, Hiroshige Hayashizaki, Hiroshi Inoue, Toshio Nakatani. 789-804 [doi]
- Variability-aware parsing in the presence of lexical macros and conditional compilationChristian Kästner, Paolo G. Giarrusso, Tillmann Rendel, Sebastian Erdweg, Klaus Ostermann, Thorsten Berger. 805-824 [doi]
- Safe and atomic run-time code evolution for Java and its application to dynamic AOPThomas Würthinger, Danilo Ansaloni, Walter Binder, Christian Wimmer, Hanspeter Mössenböck. 825-844 [doi]
- A simple abstraction for complex concurrent indexesPedro da Rocha Pinto, Thomas Dinsdale-Young, Mike Dodds, Philippa Gardner, Mark J. Wheelhouse. 845-864 [doi]
- Composable, nestable, pessimistic atomic statementsZachary R. Anderson, David Gay. 865-884 [doi]
- Delegated isolationRoberto Lublinerman, Jisheng Zhao, Zoran Budimlic, Swarat Chaudhuri, Vivek Sarkar. 885-902 [doi]
- AC: composable asynchronous IO for native languagesTim Harris, Martín Abadi, Rebecca Isaacs, Ross McIlroy. 903-920 [doi]
- Virtual values for language extensionThomas H. Austin, Tim Disney, Cormac Flanagan. 921-938 [doi]
- Backstage Java: making a difference in metaprogrammingZachary Palmer, Scott F. Smith. 939-958 [doi]
- Flexible object layouts: enabling lightweight language extensions by intercepting slot accessToon Verwaest, Camillo Bruni, Mircea Lungu, Oscar Nierstrasz. 959-972 [doi]
- Type checking modular multiple dispatch with parametric polymorphism and multiple inheritanceEric E. Allen, Justin Hilburn, Scott Kilpatrick, Victor Luchangco, Sukyoung Ryu, David Chase, Guy L. Steele Jr.. 973-992 [doi]
- A syntactic type system for recursive modulesHyeonseung Im, Keiko Nakata, Jacques Garrigue, Sungwoo Park. 993-1012 [doi]
- Freedom before commitment: a lightweight type system for object initialisationAlexander J. Summers, Peter Müller. 1013-1032 [doi]
- Null dereference verification via over-approximated weakest pre-conditions analysisRavichandhran Madhavan, Raghavan Komondoor. 1033-1052 [doi]
- F4F: taint analysis of framework-based web applicationsManu Sridharan, Shay Artzi, Marco Pistoia, Salvatore Guarnieri, Omer Tripp, Ryan Berg. 1053-1068 [doi]
- RoleCast: finding missing security checks when you do not know what checks areSooel Son, Kathryn S. McKinley, Vitaly Shmatikov. 1069-1084 [doi]