Elamur Research⌕
☰
home / venues / Proceedings of the ACM SIGPLAN… / 2015 / papers

Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation 2015: all accepted papers

59 papers · the most cited first · ← Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation 2015

  1. Verdi: a framework for implementing and formally verifying distributed systems ↗James R. Wilcox, Doug Woos, Pavel Panchekha et al.270 citations
  2. Synthesizing data structure transformations from input-output examples ↗John Feser, Swarat Chaudhuri, Işıl Dillig251 citations
  3. A simpler, safer programming and execution model for intermittent systems ↗Brandon Lucia, Benjamin Ransford200 citations
  4. Type-and-example-directed program synthesisPeter-Michael Osera, Steve Zdancewic185 citations · our summary
  5. Automatically improving accuracy for floating point expressions ↗Pavel Panchekha, Alex Sanchez-Stern, James R. Wilcox et al.168 citations
  6. Many-core compiler fuzzing ↗Christopher Lidbury, Andrei Lascu, Nathan Chong et al.143 citations
  7. Provably correct peephole optimizations with alive ↗Nuno P. Lopes, David Menendez, Santosh Nagarakatte et al.129 citations
  8. Automatic error elimination by horizontal code transfer across multiple applications ↗Stelios Sidiroglou, Eric Lahtinen, Fan Long et al.114 citations
  9. KJS: a complete formal semantics of JavaScript ↗Daejun Park, Andrei R Stefanescu, Grigore Roşu107 citations
  10. Defining the undefinedness of C ↗Chris Hathhorn, Chucky Ellison, Grigore Roşu103 citations
  11. Mechanized verification of fine-grained concurrent programs ↗Ilya Sergey, Aleksandar Nanevski, Anindya Banerjee101 citations
  12. FlashRelate: extracting relational data from semi-structured spreadsheets using examples ↗Daniel W. Barowy, Sumit Gulwani, Ted Hart et al.100 citations
  13. Efficient synthesis of network updates ↗Jedidiah McClurg, Hossein Hojjat, Pavol Černý et al.99 citations
  14. Compositional certified resource bounds ↗Quentin Carbonneaux, Jan Hoffmann, Zhong Shao96 citations
  15. Autotuning algorithmic choice for input sensitivity ↗Yufei Ding, Jason Ansel, Kalyan K. Veeramachaneni et al.90 citations
  16. Loop and data transformations for sparse matrix code ↗Anand Venkat, Mary W. Hall, Michelle Mills Strout89 citations
  17. Stateless model checking concurrent programs with maximal causality reduction ↗Jeff Huang88 citations
  18. Dynamic partial order reduction for relaxed memory models ↗Naling Zhang, Markus Kusano, Chao Wang85 citations
  19. Static detection of asymptotic performance bugs in collection traversals ↗Oswaldo Olivo, Işıl Dillig, Calvin Lin83 citations
  20. Declarative programming over eventually consistent data stores ↗KC Sivaramakrishnan, Gowtham Kaki, Suresh Jagannathan82 citations
  21. A formal C memory model supporting integer-pointer casts ↗Jeehoon Kang, Chung-Kil Hur, William Mansky et al.46 citations
  22. Exploring and enforcing security guarantees via program dependence graphs ↗Andrew Johnson, Lucas Waye, Scott Moore et al.44 citations
  23. Interactive parser synthesis by example ↗Alan Leung, John Sarracino, Sorin Lerner42 citations
  24. Synthesizing racy tests ↗Malavika Samak, Murali Krishna Ramanathan, Suresh Jagannathan42 citations
  25. Blame and coercion: together again for the first time ↗Jeremy G. Siek, Peter J. Thiemann, Philip L. Wadler41 citations
  26. Termination and non-termination specification inference ↗Ton Chanh Le, Shengchao Qin, Wei-Ngan Chin39 citations
  27. Verifying read-copy-update in a logic for weak memory ↗Joseph Tassarotti, Derek R. Dreyer, Viktor Vafeiadis39 citations
  28. Automatic induction proofs of data-structures in imperative programs ↗Duc-Hiep Chu, Joxan Jaffar, Minh-Thai Trinh38 citations
  29. Asynchronous programming, analysis and testing with state machines ↗Pantazis Deligiannis, Alastair F. Donaldson, Jeroen Ketema et al.37 citations
  30. Concurrency debugging with differential schedule projections ↗Nuno Machado, Brandon Lucia, Luı́s Rodrigues36 citations
  31. Relatively complete counterexamples for higher-order programs ↗Phúc C. Nguyễn, David Van Horn35 citations
  32. Celebrating diversity: a mixture of experts approach for runtime mapping in dynamic environments ↗Murali Krishna Emani, Michael O’Boyle33 citations
  33. Efficient synthesis of probabilistic programs ↗Aditya V. Nori, Sherjil Ozair, Sriram K. Rajamani et al.32 citations
  34. Making numerical program analysis fast ↗Gagandeep Singh, Markus Püschel, Martin Vechev32 citations
  35. Zero-overhead metaprogramming: reflection and metaobject protocols fast and without compromises ↗Stefan Marr, Chris Seaton, Sté́phane Ducasse32 citations
  36. Diagnosing type errors with class ↗Danfeng Zhang, Andrew C. Myers, Dimitrios Vytiniotis et al.31 citations
  37. Synthesis of machine code from semantics ↗Venkatesh Srinivasan, Thomas Reps30 citations
  38. Helium: lifting high-performance stencil kernels from stripped x86 binaries to halide DSL code ↗Charith Mendis, Jeffrey Bosboom, Kevin Wu et al.29 citations
  39. Relaxing safely: verified on-the-fly garbage collection for x86-TSO ↗Peter Gammie, Antony L. Hosking, Kai Engelhardt28 citations
  40. Efficient execution of recursive programs on commodity vector hardware ↗Bin Ren, Youngjoon Jo, Sriram Krishnamoorthy et al.25 citations
  41. Optimizing off-chip accesses in multicores ↗Wei Ding, Xulong Tang, Mahmut Kandemir et al.23 citations
  42. Lightweight, flexible object-oriented generics ↗Yizhou Zhang, Matthew C. Loring, Guido Salvaneschi et al.22 citations
  43. Synthesizing parallel graph programs via automated planning ↗Dimitrios Prountzos, Roman Manevich, Keshav K. Pingali22 citations
  44. Monitoring refinement via symbolic reasoning ↗Michael Emmi, Constantin Enea, Jad Hamza21 citations
  45. Light: replay via tightly bounded recording ↗Peng Liu, Xiangyu Zhang, Omer Tripp et al.20 citations
  46. Peer-to-peer affine commitment using bitcoin ↗Karl Crary, Michael J. Sullivan19 citations
  47. Tree dependence analysis ↗Yusheng Weijiang, Shruthi Balakrishna, Jianqiao Liu et al.18 citations
  48. Synthesis of ranking functions using extremal counterexamples ↗Laure Gonnord, David P. Monniaux, Gabriel Radanne17 citations
  49. The Push/Pull model of transactions ↗Eric Koskinen, Matthew Parkinson17 citations
  50. Improving compiler scalability: optimizing large programs at small price ↗Sanyam Mehta, Pen-Chung Yew15 citations
  51. Verification of producer-consumer synchronization in GPU programs ↗Rahul R. Sharma, Michael Bauer, Alex Aiken13 citations
  52. Composing concurrency control ↗Ofri Ziv, Alex Aiken, Guy Golan-Gueta et al.10 citations
  53. Algorithmic debugging of real-world haskell programs: deriving dependencies from the cost centre stack ↗Maarten Faddegon, Olaf Chitil8 citations
  54. Profile-guided meta-programming ↗William J. Bowman, Swaha Miller, Vincent St-Amour et al.8 citations
  55. Finding counterexamples from parsing conflicts ↗Chinawat Isradisaikul, Andrew C. Myers6 citations
  56. LaminarIR: compile-time queues for structured streams ↗Yousun Ko, Bernd Burgstaller, Bernhard Scholz6 citations
  57. Verification of a cryptographic primitive: SHA-256 (abstract) ↗Andrew W. Appel6 citations
  58. DAG inlining: a decision procedure for reachability-modulo-theories in hierarchical programs ↗Akash Lal, Shaz Qadeer4 citations
  59. Preventing glitches and short circuits in high-level self-timed chip specifications ↗Stephen Longfield, Brittany Nkounkou, Rajit Manohar et al.1 citation

↑ back to top

This page in Markdown → https://md.research.elamur.ai/free/en/venues/proceedings-of-the-acm-sigplan-conference-on-programming-language-design-and/2015/papers/