Abstract is missing.
- Data-driven inference of representation invariantsAnders Miltner, Saswat Padhi, Todd D. Millstein, David Walker. 1-15 [doi]
- Type error feedback via analytic program repairGeorgios Sakkas, Madeline Endres, Benjamin Cosman, Westley Weimer, Ranjit Jhala. 16-30 [doi]
- Synthesizing structured CAD models with equality saturation and inverse transformationsChandrakana Nandi, Max Willsey, Adam Anderson, James R. Wilcox, Eva Darulova, Dan Grossman, Zachary Tatlock. 31-44 [doi]
- Compiler and runtime support for continuation marksMatthew Flatt, R. Kent Dybvig. 45-58 [doi]
- Crafty: efficient, HTM-compatible persistent transactionsKaan Genç, Michael D. Bond, Guoqing Harry Xu. 59-74 [doi]
- From folklore to fact: comparing implementations of stacks and continuationsKavon Farvardin, John H. Reppy. 75-90 [doi]
- Typilus: neural type hintsMiltiadis Allamanis, Earl T. Barr, Soline Ducousso, Zheng Gao. 91-105 [doi]
- Learning nonlinear loop invariants with gated continuous logic networksJianan Yao, Gabriel Ryan, Justin Wong, Suman Jana, Ronghui Gu. 106-120 [doi]
- Blended, precise semantic program embeddingsKe Wang 0022, Zhendong Su. 121-134 [doi]
- Towards a verified range analysis for JavaScript JITsFraser Brown, John Renner, Andres Nötzli, Sorin Lerner, Hovav Shacham, Deian Stefan. 135-150 [doi]
- Binary rewriting without control flow recoveryGregory J. Duck, Xiang Gao, Abhik Roychoudhury. 151-163 [doi]
- BlankIt library debloating: getting what you want instead of cutting what you don'tChris Porter, Girish Mururu, Prithayan Barua, Santosh Pande. 164-180 [doi]
- Verifying concurrent search structure templatesSiddharth Krishna, Nisarg Patel, Dennis E. Shasha, Thomas Wies. 181-196 [doi]
- Armada: low-effort verification of high-performance concurrent programsJacob R. Lorch, Yixuan Chen, Manos Kapritsos, Bryan Parno, Shaz Qadeer, Upamanyu Sharma, James R. Wilcox, Xueyuan Zhao. 197-210 [doi]
- Decidable verification under a causally consistent shared memoryOri Lahav, Udi Boker. 211-226 [doi]
- Inductive sequentialization of asynchronous programsBernhard Kragl, Constantin Enea, Thomas A. Henzinger, Suha Orhun Mutluergil, Shaz Qadeer. 227-242 [doi]
- The essence of Bluespec: a core language for rule-based hardware designThomas Bourgeat, Clément Pit-Claudel, Adam Chlipala, Arvind. 243-257 [doi]
- LLHD: a multi-level intermediate representation for hardware description languagesFabian Schuiki, Andreas Kurth, Tobias Grosser, Luca Benini. 258-271 [doi]
- On the principles of differentiable quantum programming languagesShaopeng Zhu, Shih-Han Hung, Shouvanik Chakrabarti, Xiaodi Wu. 272-285 [doi]
- Silq: a high-level quantum language with safe uncomputation and intuitive semanticsBenjamin Bichsel, Maximilian Baader, Timon Gehr, Martin T. Vechev. 286-300 [doi]
- Improving program locality in the GC using hotnessAlbert Mingkun Yang, Erik Österlund, Tobias Wrigstad. 301-313 [doi]
- A marriage of pointer- and epoch-based reclamationJeehoon Kang, Jaehwang Jung. 314-328 [doi]
- CARAT: a case for virtual memory through compiler- and runtime-based address translationBrian Suchy, Simone Campanoni, Nikos Hardavellas, Peter A. Dinda. 329-345 [doi]
- Repairing and mechanising the JavaScript relaxed memory modelConrad Watt, Christopher Pulte, Anton Podkopaev, Guillaume Barbier, Stephen Dolan, Shaked Flur, Jean Pichon-Pharabod, Shu-yu Guo. 346-361 [doi]
- Promising 2.0: global optimizations in relaxed memory concurrencySung Hwan Lee, Minki Cho, Anton Podkopaev, Soham Chakraborty, Chung-Kil Hur, Ori Lahav, Viktor Vafeiadis. 362-376 [doi]
- NVTraverse: in NVRAM data structures, the destination is more important than the journeyMichal Friedman, Naama Ben-David, Yuanhao Wei, Guy E. Blelloch, Erez Petrank. 377-392 [doi]
- Predictable accelerator design with time-sensitive affine typesRachit Nigam, Sachille Atapattu, Samuel Thomas, Zhijing Li, Theodore Bauer, Yuwei Ye, Apurva Koti, Adrian Sampson, Zhiru Zhang. 393-407 [doi]
- Type-directed scheduling of streaming acceleratorsDavid Durst, Matthew Feldman, Dillon Huff, David Akeley, Ross G. Daly, Gilbert Louis Bernstein, Marco Patrignani, Kayvon Fatahalian, Pat Hanrahan. 408-422 [doi]
- FreezeML: complete and easy type inference for first-class polymorphismFrank Emrich, Sam Lindley, Jan Stolarek, James Cheney, Jonathan Coates. 423-437 [doi]
- Securing smart contract with runtime validationAo Li, Jemin Andrew Choi, Fan Long. 438-453 [doi]
- Ethainter: a smart contract security analyzer for composite vulnerabilitiesLexi Brent, Neville Grech, Sifis Lagouvardos, Bernhard Scholz, Yannis Smaragdakis. 454-469 [doi]
- Behavioral simulation for smart contractsSidi Mohamed Beillahi, Gabriela F. Ciocarlie, Michael Emmi, Constantin Enea. 470-486 [doi]
- Multi-modal synthesis of regular expressionsQiaochu Chen, Xinyu Wang 0006, Xi Ye, Greg Durrett, Isil Dillig. 487-502 [doi]
- Optimizing homomorphic evaluation circuits by program synthesis and term rewritingDongkwon Lee, Woosuk Lee, Hakjoo Oh, Kwangkeun Yi. 503-518 [doi]
- CacheQuery: learning replacement policies from hardware cachesPepe Vila, Pierre Ganty, Marco Guarnieri, Boris Köpf. 519-532 [doi]
- HipHop.js: (A)Synchronous reactive web programmingGérard Berry, Manuel Serrano. 533-545 [doi]
- EVA: an encrypted vector arithmetic language and compiler for efficient homomorphic computationRoshan Dathathri, Blagovesta Kostova, Olli Saarikivi, Wei Dai, Kim Laine, Madan Musuvathi. 546-561 [doi]
- Towards an API for the real numbersHans-J. Boehm. 562-576 [doi]
- Responsive parallelism with futures and stateStefan K. Muller, Kyle Singer, Noah Goldstein, Umut A. Acar, Kunal Agrawal, I-Ting Angelina Lee. 577-591 [doi]
- SympleGraph: distributed graph processing with precise loop-carried dependency guaranteeYouwei Zhuo, Jingji Chen, Qinyi Luo, Yanzhi Wang, Hailong Yang, Depei Qian, Xuehai Qian. 592-607 [doi]
- PMEvo: portable inference of port mappings for out-of-order processors by evolutionary optimizationFabian Ritter 0002, Sebastian Hack. 608-622 [doi]
- PMThreads: persistent memory threads harnessing versioned shadow copiesZhenwei Wu, Kai Lu, Andrew Nisbet, Wenzhe Zhang, Mikel Luján. 623-637 [doi]
- SCAF: a speculation-aware collaborative dependence analysis frameworkSotiris Apostolakis, Ziyang Xu, Zujun Tan, Greg Chan, Simone Campanoni, David I. August. 638-654 [doi]
- Scalable validation of binary liftersSandeep Dasgupta, Sushant Dinesh, Deepan Venkatesh, Vikram S. Adve, Christopher W. Fletcher. 655-671 [doi]
- Polynomial invariant generation for non-deterministic recursive programsKrishnendu Chatterjee, Hongfei Fu 0001, Amir Kafshdar Goharshady, Ehsan Kafshdar Goharshady. 672-687 [doi]
- Templates and recurrences: better togetherJason Breck, John Cyphert, Zachary Kincaid, Thomas W. Reps. 688-702 [doi]
- First-order quantified separatorsJason R. Koenig, Oded Padon, Neil Immerman, Alex Aiken. 703-717 [doi]
- Validating SMT solvers via semantic fusionDominik Winterer, Chengyu Zhang, Zhendong Su. 718-730 [doi]
- Debugging and detecting numerical errors in computation with positsSangeeta Chowdhary, Jay P. Lim, Santosh Nagarakatte. 731-746 [doi]
- SmartTrack: efficient predictive race detectionJake Roemer, Kaan Genç, Michael D. Bond. 747-762 [doi]
- Understanding memory and thread safety practices and issues in real-world Rust programsBoqin Qin, Yilun Chen, Zeming Yu, Linhai Song, Yiying Zhang. 763-779 [doi]
- Fast graph simplification for interleaved Dyck-reachabilityYuanbo Li, Qirun Zhang, Thomas W. Reps. 780-793 [doi]
- Static analysis of Java enterprise applications: frameworks and caches, the elephants in the roomAnastasios Antoniadis, Nikos Filippakis, Paddy Krishnan, Raghavendra Ramesh, Nicholas Allen, Yannis Smaragdakis. 794-807 [doi]
- Automated derivation of parametric data movement lower bounds for affine programsAuguste Olivry, Julien Langou, Louis-Noël Pouchet, P. Sadayappan, Fabrice Rastello. 808-822 [doi]
- Automatic generation of efficient sparse tensor format conversion routinesStephen Chou, Fredrik Kjolstad, Saman P. Amarasinghe. 823-838 [doi]
- OOElala: order-of-evaluation based alias analysis for compiler optimizationAnkush Phulia, Vaibhav Bhagee, Sorav Bansal. 839-853 [doi]
- Effective function merging in the SSA formRodrigo C. O. Rocha, Pavlos Petoumenos, Zheng Wang 0001, Murray Cole, Hugh Leather. 854-868 [doi]
- Proving almost-sure termination by omega-regular decompositionJianhui Chen, Fei He. 869-882 [doi]
- λPSI: exact inference for higher-order probabilistic programsTimon Gehr, Samuel Steffen, Martin T. Vechev. 883-897 [doi]
- Reactive probabilistic programmingGuillaume Baudart, Louis Mandel, Eric Atkinson, Benjamin Sherman, Marc Pouzet, Michael Carbin. 898-912 [doi]
- Constant-time foundations for the new spectre eraSunjay Cauligi, Craig Disselkoen, Klaus von Gleissenthall, Dean M. Tullsen, Deian Stefan, Tamara Rezk, Gilles Barthe. 913-926 [doi]
- Gillian, part i: a multi-language platform for symbolic executionJosé Fragoso Santos, Petar Maksimovic, Sacha-Élie Ayoun, Philippa Gardner. 927-942 [doi]
- Efficient handling of string-number conversionParosh Aziz Abdulla, Mohamed Faouzi Atig, Yu-Fang Chen, Bui Phi Diep, Julian Dolby, Petr Janku, Hsin-hung Lin, Lukás Holík, Wei-Cheng Wu. 943-957 [doi]
- NV: an intermediate language for verification of network control planesNick Giannarakis, Devon Loehr, Ryan Beckett, David Walker. 958-973 [doi]
- Detecting network load violations for distributed control planesKausik Subramanian, Anubhavnidhi Abhashkumar, Loris D'Antoni, Aditya Akella. 974-988 [doi]
- Compiler-directed soft error resilience for lightweight GPU register file protectionHongjune Kim, Jianping Zeng, Qingrui Liu, Mohammad Abdel-Majeed, Jaejin Lee, Changhee Jung. 989-1004 [doi]
- Adaptive low-overhead scheduling for periodic and reactive intermittent executionKiwan Maeng, Brandon Lucia. 1005-1021 [doi]
- Faster general parsing through context-free memoizationGrzegorz Herman. 1022-1035 [doi]
- Zippy LL(1) parsing with derivativesRomain Edelmann, Jad Hamza, Viktor Kuncak. 1036-1051 [doi]
- Debug information validation for optimized codeYuanbo Li, Shuo Ding, Qirun Zhang, Davide Italiano. 1052-1065 [doi]
- Semantic code search via equational reasoningVarot Premtoon, James Koppel, Armando Solar-Lezama. 1066-1082 [doi]
- Proving data-poisoning robustness in decision treesSamuel Drews, Aws Albarghouthi, Loris D'Antoni. 1083-1097 [doi]
- A study of the learnability of relational properties: model counting meets machine learning (MCML)Muhammad Usman 0024, Wenxi Wang, Marko Vasic, Kaiyuan Wang, Haris Vikalo, Sarfraz Khurshid. 1098-1111 [doi]
- Learning fast and precise numerical analysisJingxuan He, Gagandeep Singh, Markus Püschel, Martin T. Vechev. 1112-1127 [doi]
- Exact and approximate methods for proving unrealizability of syntax-guided synthesis problemsQinheping Hu, John Cyphert, Loris D'Antoni, Thomas W. Reps. 1128-1142 [doi]
- Question selection for interactive program synthesisRuyi Ji, Jingjing Liang, Yingfei Xiong, Lu Zhang, Zhenjiang Hu. 1143-1158 [doi]
- Reconciling enumerative and deductive program synthesisKangjing Huang, Xiaokang Qiu, Peiyuan Shen, Yanjun Wang. 1159-1174 [doi]