default search action
PLDI 2014: Edinburgh, UK
- Michael F. P. O'Boyle, Keshav Pingali:
ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI '14, Edinburgh, United Kingdom - June 09 - 11, 2014. ACM 2014, ISBN 978-1-4503-2784-8
Keynote address
- Krishna V. Palem:
What exactly is inexact computation good for? 1
Parallelism 1
- Lindsey Kuper
, Aaron Todd, Sam Tobin-Hochstadt
Taming the parallel effect zoo: extensible deterministic parallelism with LVish. 2-14 - Rishi Surendran, Raghavan Raman, Swarat Chaudhuri, John M. Mellor-Crummey
Test-driven repair of data races in structured parallel programs. 15-25 - Sven Stork, Karl Naden, Joshua Sunshine, Manuel Mohr, Alcides Fonseca, Paulo Marques, Jonathan Aldrich:
Æminium: a permission based concurrent-by-default programming language approach. 26
Atomicity and memory models
- Suresh Jagannathan, Gustavo Petri, Jan Vitek, David Pichardie, Vincent Laporte:
Atomicity refinement for verified compilation. 27 - Swarnendu Biswas
DoubleChecker: efficient sound and precise atomicity checking. 28-39 - Jade Alglave, Luc Maranget, Michael Tautschnig:
Herding cats: modelling, simulation, testing, and data-mining for weak memory. 40
Compiler optimizations
- Tiark Rompf, Arvind K. Sujeeth, Kevin J. Brown, HyoukJoong Lee, Hassan Chafi, Kunle Olukotun
Surgical precision JIT compilers. 41-52 - Eric Schkufza, Rahul Sharma, Alex Aiken
Stochastic optimization of floating-point programs with tunable precision. 53-64 - Kevin Stock, Martin Kong
A framework for enhancing data reuse via associative reordering. 65-76
Types
- Zachary DeVito, Daniel Ritchie
First-class runtime generation of high-performance types using exotypes. 77-88 - Ben Greenman
Getting F-bounded polymorphism into shape. 89-99 - Axel Simon:
Optimal inference of fields in row-polymorphic records. 100-111
Probabilistic programming
- Adrian Sampson
Expressing and verifying probabilistic assertions. 112-122 - Mateus Borges, Antonio Filieri
Compositional solution space quantification for probabilistic software analysis. 123-132 - Chung-Kil Hur, Aditya V. Nori, Sriram K. Rajamani, Selva Samuel:
Slicing probabilistic programs. 133-144
Incremental computation and slicing
- Yufei Cai, Paolo G. Giarrusso, Tillmann Rendel, Klaus Ostermann:
A theory of changes for higher-order languages: incrementalizing λ-calculi by static differentiation. 145-155 - Matthew A. Hammer, Yit Phang Khoo, Michael Hicks
Adapton: composable, demand-driven incremental computation. 156-166 - Min Aung, Susan Horwitz, Richard Joiner, Thomas W. Reps:
Specialization slicing. 167
Keynote address
- Tony Hoare:
Laws of concurrent programming. 168
Parallelism 2
- Srinath Sridharan, Gagan Gupta, Gurindar S. Sohi:
Adaptive, efficient, parallel execution of parallel programs. 169-180 - Gagan Gupta, Srinath Sridharan, Gurindar S. Sohi:
Globally precise-restartable execution of parallel programs. 181-192 - Subrata Mitra, Ignacio Laguna, Dong H. Ahn, Saurabh Bagchi, Martin Schulz
Accurate application progress analysis for large-scale parallel debugging. 193-203
Bugs
- Sanket Tavarageri, Sriram Krishnamoorthy, P. Sadayappan
Compiler-assisted detection of transient memory errors. 204-215 - Vu Le, Mehrdad Afshari, Zhendong Su
Compiler validation via equivalence modulo inputs. 216-226 - Fan Long, Stelios Sidiroglou-Douskos, Martin C. Rinard:
Automatic runtime error repair and containment via recovery shepherding. 227-238
Static analysis 1
- Xin Zhang
On abstraction refinement for program analyses in Datalog. 239-248 - Xin Zhang
Hybrid top-down and bottom-up interprocedural analysis. 249-258 - Steven Arzt
FlowDroid: precise context, flow, field, object-sensitive and lifecycle-aware taint analysis for Android apps. 259-269
Verification 1
- Quentin Carbonneaux, Jan Hoffmann, Tahina Ramananandro, Zhong Shao
End-to-end verification of stack-space bounds for C programs. 270-281 - Thomas Ball, Nikolaj S. Bjørner, Aaron Gember, Shachar Itzhaky, Aleksandr Karbyshev
VeriCon: towards verifying controller programs in software-defined networks. 282-293 - Francesco Logozzo, Shuvendu K. Lahiri, Manuel Fähndrich, Sam Blackshear:
Verification modulo versions: towards usable verification. 294-304
Races
- Dimitar K. Dimitrov
Commutativity race detection. 305-315 - Pallavi Maiya, Aditya Kanade, Rupak Majumdar:
Race detection for Android applications. 316-325 - Chun-Hung Hsiao, Cristiano Pereira, Jie Yu, Gilles Pokam, Satish Narayanasamy
Race detection for event-driven mobile applications. 326-336 - Jeff Huang, Patrick O'Neil Meredith, Grigore Rosu:
Maximal sound predictive race detection with control flow abstraction. 337-348
Olio
- Yaniv David, Eran Yahav:
Tracelet-based code search in executables. 349-360 - Justin Pombrio, Shriram Krishnamurthi
Resugaring: lifting evaluation sequences through syntactic sugar. 361-371 - Reinhard von Hanxleden, Björn Duderstadt, Christian Motika, Steven Smyth, Michael Mendler, Joaquín Aguado, Stephen Mercer, Owen O'Brien:
SCCharts: sequentially constructive statecharts for safety-critical applications: HW/SW-synthesis for a conservative extension of synchronous statecharts. 372-383 - Loris D'Antoni, Margus Veanes, Benjamin Livshits, David Molnar:
Fast: a transducer-based language for tree manipulation. 384-394
Keynote address
- Jayadev Misra:
A personal perspective on concurrency. 395
Synthesis
- Phitchaya Mangpo Phothilimthana, Tikhon Jelvis
Chlorophyll: synthesis-aided compiler for low-power spatial architectures. 396-407 - Daniel Perelman
Test-driven synthesis. 408-418 - Veselin Raychev, Martin T. Vechev, Eran Yahav:
Code completion with statistical language models. 419-428
Verification 2
- David Greenaway, Japheth Lim, June Andronick, Gerwin Klein
Don't sweat the small stuff: formal verification of C code without the pain. 429-439 - Edgar Pek, Xiaokang Qiu
Natural proofs for data structure manipulation in C using separation logic. 440-451 - Daniel Ricketts, Valentin Robert
Automating formal proofs for reactive systems. 452-462
Static analysis 2
- Xiao Xiao, Qirun Zhang
Persistent pointer information. 463-474 - Hakjoo Oh, Wonchan Lee, Kihong Heo, Hongseok Yang, Kwangkeun Yi:
Selective context-sensitivity guided by impact pre-analysis. 475-484 - Yannis Smaragdakis, George Kastrinis, George Balatsouras:
Introspective analysis: context-sensitivity, across the board. 485-495
Scripting languages
- Wonsun Ahn, Jiho Choi, Thomas Shull, María Jesús Garzarán, Josep Torrellas:
Improving JavaScript performance by deconstructing the type system. 496-507 - John Vilk, Emery D. Berger
Doppio: breaking the browser language barrier. 508-518 - Li Lu, Weixing Ji, Michael L. Scott
Dynamic enforcement of determinism in a parallel scripting language. 519-529
Program generation
- Emina Torlak, Rastislav Bodík:
A lightweight symbolic virtual machine for solver-aided host languages. 530-541 - Vu Le, Sumit Gulwani:
FlashExtract: a framework for data extraction by examples. 542-553 - Marcelo Sousa, Isil Dillig, Dimitrios Vytiniotis, Thomas Dillig, Christos Gkantsidis:
Consolidation of queries with user-defined functions. 554-564
Security-correctness
- Loi Luu, Shweta Shinde
A model counter for constraints over unbounded strings. 565-576 - Ben Niu, Gang Tan
Modular control-flow integrity. 577-587 - Edward Z. Yang, David Mazières:
Dynamic space limits for Haskell. 588-598
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.
last updated on 2024-11-14 20:48 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: