Abstract is missing.
- Promising-ARM/RISC-V: a simpler and faster operational concurrency modelChristopher Pulte, Jean Pichon-Pharabod, Jeehoon Kang, Sung Hwan Lee, Chung-Kil Hur. 1-15 [doi]
- Accelerating sequential consistency for Java with speculative compilationLun Liu, Todd D. Millstein, Madanlal Musuvathi. 16-30 [doi]
- Renaissance: benchmarking suite for parallel applications on the JVMAleksandar Prokopec, Andrea Rosà, David Leopoldseder, Gilles Duboscq, Petr Tuma 0001, Martin Studener, Lubomír Bulej, Yudi Zheng, Alex Villazón, Doug Simon, Thomas Würthinger, Walter Binder. 31-47 [doi]
- LoCal: a language for programs operating on serialized dataMichael Vollmer, Chaitanya Koparkar, Mike Rainey, Laith Sakka, Milind Kulkarni 0001, Ryan R. Newton. 48-62 [doi]
- Scenic: a language for scenario specification and scene generationDaniel J. Fremont, Tommaso Dreossi, Shromona Ghosh, Xiangyu Yue, Alberto L. Sangiovanni-Vincentelli, Sanjit A. Seshia. 63-78 [doi]
- Compiling KB-sized machine learning models to tiny IoT devicesSridhar Gopinath, Nikhil Ghanathe, Vivek Seshadri, Rahul Sharma. 79-95 [doi]
- Model checking for weakly consistent librariesMichalis Kokologiannakis, Azalea Raad, Viktor Vafeiadis. 96-110 [doi]
- Towards certified separate compilation for concurrent programsHanru Jiang, Hongjin Liang, Siyang Xiao, Junpeng Zha, Xinyu Feng. 111-125 [doi]
- Robustness against release/acquire semanticsOri Lahav, Roy Margalit. 126-141 [doi]
- CHET: an optimizing compiler for fully-homomorphic neural-network inferencingRoshan Dathathri, Olli Saarikivi, Hao Chen 0030, Kim Laine, Kristin E. Lauter, Saeed Maleki, Madanlal Musuvathi, Todd Mytkowicz. 142-156 [doi]
- Usuba: high-throughput and constant-time ciphers, by constructionDarius Mercadier, Pierre-Évariste Dagand. 157-173 [doi]
- FaCT: a DSL for timing-sensitive computationSunjay Cauligi, Gary Soeller, Brian Johannesmeyer, Fraser Brown, Riad S. Wahby, John Renner, Benjamin Grégoire, Gilles Barthe, Ranjit Jhala, Deian Stefan. 174-189 [doi]
- Scalable verification of probabilistic networksSteffen Smolka, Praveen Kumar, David M. Kahn, Nate Foster, Justin Hsu, Dexter Kozen, Alexandra Silva 0001. 190-203 [doi]
- Cost analysis of nondeterministic probabilistic programsPeixin Wang, Hongfei Fu 0001, Amir Kafshdar Goharshady, Krishnendu Chatterjee, Xudong Qin, Wenjun Shi. 204-220 [doi]
- Gen: a general-purpose probabilistic programming system with programmable inferenceMarco F. Cusumano-Towner, Feras A. Saad, Alexander K. Lew, Vikash K. Mansinghka. 221-236 [doi]
- Incremental precision-preserving symbolic inference for probabilistic programsJieyuan Zhang, Jingling Xue. 237-252 [doi]
- Resource-guided program synthesisTristan Knoth, Di Wang, Nadia Polikarpova, Jan Hoffmann 0002. 253-268 [doi]
- Using active learning to synthesize models of applications that access databasesJiasi Shen 0001, Martin C. Rinard. 269-285 [doi]
- Synthesizing database programs for schema refactoringYuepeng Wang 0001, James Dong, Rushi Shah, Isil Dillig. 286-300 [doi]
- Synthesis and machine learning for heterogeneous extractionArun Iyer, Manohar Jonnalagedda, Suresh Parthasarathy, Arjun Radhakrishna, Sriram K. Rajamani. 301-315 [doi]
- AutoPersist: an easy-to-use Java NVM framework based on reachabilityThomas Shull, Jian Huang, Josep Torrellas. 316-332 [doi]
- Mesh: compacting memory management for C/C++ applicationsBobby Powers, David Tench, Emery D. Berger, Andrew McGregor 0001. 333-346 [doi]
- Panthera: holistic memory management for big data processing over hybrid memoriesChenxi Wang, Huimin Cui, Ting Cao, John Zigman, Haris Volos, Onur Mutlu, Fang Lv, Xiaobing Feng 0002, Guoqing Harry Xu. 347-362 [doi]
- Lightweight multi-language syntax transformation with parser parser combinatorsRijnard van Tonder, Claire Le Goues. 363-378 [doi]
- A typed, algebraic approach to parsingNeelakantan R. Krishnaswami, Jeremy Yallop. 379-393 [doi]
- Genie: a generator of natural language semantic parsers for virtual assistant commandsGiovanni Campagna, Silei Xu, Mehrad Moradshahi, Richard Socher, Monica S. Lam. 394-410 [doi]
- Lazy counterfactual symbolic executionWilliam T. Hallahan, Anton Xue, Maxwell Troy Bland, Ranjit Jhala, Ruzica Piskac. 411-424 [doi]
- Sound regular expression semantics for dynamic symbolic execution of JavaScriptBlake Loring, Duncan Mitchell, Johannes Kinder. 425-438 [doi]
- Effective floating-point analysis via weak-distance minimizationZhoulai Fu, Zhendong Su. 439-452 [doi]
- Huron: hybrid false sharing detection and repairTanvir Ahmed Khan, Yifan Zhao, Gilles Pokam, Barzan Mozafari, Baris Kasikci. 453-468 [doi]
- Model-driven transformations for multi- and many-core CPUsMartin Kong, Louis-Noël Pouchet. 469-484 [doi]
- Parallelism-centric what-if and differential analysesAdarsh Yoga, Santosh Nagarakatte. 485-501 [doi]
- Verifying message-passing programs with dependent behavioural typesAlceste Scalas, Nobuko Yoshida, Elias Benussi. 502-516 [doi]
- Toward efficient gradual typing for structural types via coercionsAndre Kuhlenschmidt, Deyaaeldeen Almahallawi, Jeremy G. Siek. 517-532 [doi]
- Bidirectional type checking for relational propertiesEzgi Çiçek, Weihao Qu, Gilles Barthe, Marco Gaboardi, Deepak Garg 0001. 533-547 [doi]
- Parser-directed fuzzingBjörn Mathis, Rahul Gopinath, Michaël Mera, Alexander Kampmann, Matthias Höschele, Andreas Zeller. 548-560 [doi]
- Continuously reasoning about programs using differential Bayesian inferenceKihong Heo, Mukund Raghothaman, Xujie Si, Mayur Naik. 561-575 [doi]
- Sparse record and replay with controlled schedulingChristopher Lidbury, Alastair F. Donaldson. 576-593 [doi]
- Sparse computation data dependence simplification for efficient compiler-generated inspectorsMahdi Soltan Mohammadi, Tomofumi Yuki, Kazem Cheshmi, Eddie C. Davis, Mary W. Hall, Maryam Mehri Dehnavi, Payal Nandy, Catherine Olschanowsky, Anand Venkat, Michelle Mills Strout. 594-609 [doi]
- Modular divide-and-conquer parallelization of nested loopsAzadeh Farzan, Victor Nicolet. 610-624 [doi]
- Generating piecewise-regular code from irregular structuresTravis Augustine, Janarthanan Sarma, Louis-Noël Pouchet, Gabriel Rodríguez 0001. 625-639 [doi]
- ILC: a calculus for composable, computational cryptographyKevin Liao, Matthew A. Hammer, Andrew Miller. 640-654 [doi]
- Proving differential privacy with shadow executionYuxin Wang, Zeyu Ding, Guanhong Wang, Daniel Kifer, Danfeng Zhang. 655-669 [doi]
- Data-trace types for distributed stream processing systemsKonstantinos Mamouras, Caleb Stanford, Rajeev Alur, Zachary G. Ives, Val Tannen. 670-685 [doi]
- An inductive synthesis framework for verifiable reinforcement learningHe Zhu, Zikang Xiong, Stephen Magill, Suresh Jagannathan. 686-701 [doi]
- Programming support for autonomizing softwareWen-Chuan Lee, Peng Liu, Yingqi Liu, ShiQing Ma, Xiangyu Zhang. 702-716 [doi]
- Wootz: a compiler-based framework for fast CNN pruning via composabilityHui Guan, Xipeng Shen, Seung-Hwan Lim. 717-730 [doi]
- Optimization and abstraction: a synergistic approach for analyzing neural network robustnessGreg Anderson, Shankara Pailoor, Isil Dillig, Swarat Chaudhuri. 731-744 [doi]
- Unsupervised learning of API aliasing specificationsJan Eberhardt, Samuel Steffen, Veselin Raychev, Martin T. Vechev. 745-759 [doi]
- Scalable taint specification inference with big codeVictor Chibotaru, Benjamin Bichsel, Veselin Raychev, Martin T. Vechev. 760-774 [doi]
- Learning stateful preconditions modulo a test generatorAngello Astorga, P. Madhusudan, Shambwaditya Saha, Shiyu Wang, Tao Xie. 775-787 [doi]
- SLING: using dynamic analysis to infer program invariants in separation logicTon Chanh Le, Guolong Zheng, ThanhVu Nguyen. 788-801 [doi]
- Abstract interpretation under speculative executionMeng Wu, Chao Wang 0001. 802-815 [doi]
- A fast analytical model of fully associative cachesTobias Gysi, Tobias Grosser, Laurin Brandner, Torsten Hoefler. 816-829 [doi]
- Sound, fine-grained traversal fusion for heterogeneous treesLaith Sakka, Kirshanthan Sundararajah, Ryan R. Newton, Milind Kulkarni 0001. 830-844 [doi]
- Size-change termination as a contract: dynamically and statically enforcing termination for higher-order programsPhuc C. Nguyen, Thomas Gilray, Sam Tobin-Hochstadt, David Van Horn. 845-859 [doi]
- SemCluster: clustering of imperative programming assignments based on quantitative semantic featuresDavid Mitchel Perry, Dohyeong Kim, Roopsha Samanta, Xiangyu Zhang. 860-873 [doi]
- Computing summaries of string loops in C for better testing and refactoringTimotej Kapus, Oren Ish-Shalom, Shachar Itzhaky, Noam Rinetzky, Cristian Cadar. 874-888 [doi]
- Reusable inline caching for JavaScript performanceJiho Choi, Thomas Shull, Josep Torrellas. 889-901 [doi]
- Composable, sound transformations of nested recursion and loopsKirshanthan Sundararajah, Milind Kulkarni 0001. 902-917 [doi]
- Low-latency graph streaming using compressed purely-functional treesLaxman Dhulipala, Guy E. Blelloch, Julian Shun. 918-934 [doi]
- Co-optimizing memory-level parallelism and cache-level parallelismXulong Tang, Mahmut Taylan Kandemir, Mustafa Karaköy, Meenakshi Arunachalam. 935-949 [doi]
- Characterising renaming within OCaml's module system: theory and implementationReuben N. S. Rowe, Hugo Férée, Simon J. Thompson, Scott Owens. 950-965 [doi]
- Type-level computations for Ruby librariesMilod Kazerounian, Sankha Narayan Guria, Niki Vazou, Jeffrey S. Foster, David Van Horn. 966-979 [doi]
- Replication-aware linearizabilityChao Wang, Constantin Enea, Suha Orhun Mutluergil, Gustavo Petri. 980-993 [doi]
- DFix: automatically fixing timing bugs in distributed systemsGuangpu Li, Haopeng Liu, Xianglan Chen, Haryadi S. Gunawi, Shan Lu. 994-1009 [doi]
- Ignis: scaling distribution-oblivious systems with light-touch distributionNikos Vasilakis, Ben Karel, Yash Palkhiwala, John Sonchack, André DeHon, Jonathan M. Smith. 1010-1026 [doi]
- Semantic program alignment for equivalence checkingBerkeley R. Churchill, Oded Padon, Rahul Sharma 0001, Alex Aiken. 1027-1040 [doi]
- Verified compilation on a verified processorAndreas Lööw, Ramana Kumar, Yong Kiam Tan, Magnus O. Myreen, Michael Norrish, Oskar Abrahamsson, Anthony C. J. Fox. 1041-1053 [doi]
- Argosy: verifying layered storage systems with recovery refinementTej Chajed, Joseph Tassarotti, M. Frans Kaashoek, Nickolai Zeldovich. 1054-1068 [doi]
- Simple and precise static analysis of untrusted Linux kernel extensionsElazar Gershuni, Nadav Amit, Arie Gurfinkel, Nina Narodytska, Jorge A. Navas, Noam Rinetzky, Leonid Ryzhyk, Mooly Sagiv. 1069-1084 [doi]
- Transactional concurrency control for intermittent, energy-harvesting computing systemsEmily Ruppel, Brandon Lucia. 1085-1100 [doi]
- Supporting peripherals in intermittent systems with just-in-time checkpointsKiwan Maeng, Brandon Lucia. 1101-1116 [doi]
- Verification of programs under the release-acquire semanticsParosh Aziz Abdulla, Jatin Arora, Mohamed Faouzi Atig, Shankara Narayanan Krishna. 1117-1132 [doi]
- A complete formal semantics of x86-64 user-level instruction set architectureSandeep Dasgupta, Daejun Park 0001, Theodoros Kasampalis, Vikram S. Adve, Grigore Rosu. 1133-1148 [doi]
- An applied quantum Hoare logicLi Zhou, Nengkun Yu, Mingsheng Ying. 1149-1162 [doi]