-
Notifications
You must be signed in to change notification settings - Fork 0
/
test.json
1 lines (1 loc) · 66.6 KB
/
test.json
1
{"http://dl.acm.org/citation.cfm?id=1238844":{"title":"Barbara G. Ryder, Brent Hailpern: Proceedings of the Third ACM SIGPLAN History of Programming Languages Conference (HOPL-III), San Diego, California, USA, 9-10 June 2007. ACM 2007","address":"http://dl.acm.org/citation.cfm?id=1238844","index":0},"https://doi.org/10.1145/1238844.1238845":{"title":"William R. Cook: AppleScript. 1-21","address":"https://doi.org/10.1145/1238844.1238845","index":1,"label":true},"https://doi.org/10.1145/1238844.1238846":{"title":"Roberto Ierusalimschy, Luiz Henrique de Figueiredo, Waldemar Celes Filho: The evolution of Lua. 1-26","address":"https://doi.org/10.1145/1238844.1238846","index":2,"label":true},"https://doi.org/10.1145/1238844.1238847":{"title":"Niklaus Wirth: Modula-2 and Oberon. 1-10","address":"https://doi.org/10.1145/1238844.1238847","index":3,"label":true},"https://doi.org/10.1145/1238844.1238848":{"title":"Bjarne Stroustrup: Evolving a language in and for the real world: C++ 1991-2006. 1-59","address":"https://doi.org/10.1145/1238844.1238848","index":4,"label":true},"https://doi.org/10.1145/1238844.1238849":{"title":"David Harel: Statecharts in the making: a personal account. 1-43","address":"https://doi.org/10.1145/1238844.1238849","index":5,"label":true},"https://doi.org/10.1145/1238844.1238850":{"title":"Joe Armstrong: A history of Erlang. 1-26","address":"https://doi.org/10.1145/1238844.1238850","index":6,"comment":"asdasdasdasd"},"https://doi.org/10.1145/1238844.1238851":{"title":"Ken Kennedy, Charles Koelbel, Hans P. Zima: The rise and fall of High Performance Fortran: an historical object lesson. 1-22","address":"https://doi.org/10.1145/1238844.1238851","index":7},"https://doi.org/10.1145/1238844.1238853":{"title":"David M. Ungar, Randall B. Smith: Self. 1-50","address":"https://doi.org/10.1145/1238844.1238853","index":8},"https://doi.org/10.1145/1238844.1238852":{"title":"Lawrence Snyder: The design and development of ZPL. 1-37","address":"https://doi.org/10.1145/1238844.1238852","index":9},"https://doi.org/10.1145/1238844.1238854":{"title":"Bent Bruun Kristensen, Ole Lehrmann Madsen, Birger Møller-Pedersen: The when, why and why not of the BETA programming language. 1-57","address":"https://doi.org/10.1145/1238844.1238854","index":10},"https://doi.org/10.1145/1238844.1238855":{"title":"Andrew P. Black, Norman C. Hutchinson, Eric Jul, Henry M. Levy: The development of the Emerald programming language. 1-51","address":"https://doi.org/10.1145/1238844.1238855","index":11},"https://doi.org/10.1145/1238844.1238856":{"title":"Paul Hudak, John Hughes, Simon L. Peyton Jones, Philip Wadler: A history of Haskell: being lazy with class. 1-55","address":"https://doi.org/10.1145/1238844.1238856","index":12},"https://doi.org/10.1145/154766":{"title":"John A. N. Lee, Jean E. Sammet: History of Programming Languages Conference (HOPL-II), Preprints, Cambridge, Massachusetts, USA, April 20-23, 1993. ACM 1993, ISBN 0-89791-570-4","address":"https://doi.org/10.1145/154766","index":13},"https://doi.org/10.1145/154766.155361":{"title":"Per Brinch Hansen: Monitors and Concurrent Pascal: A Personal History. 1-35","address":"https://doi.org/10.1145/154766.155361","index":14},"https://doi.org/10.1145/154766.155362":{"title":"Alain Colmerauer, Philippe Roussel: The Birth of Prolog. 37-52","address":"https://doi.org/10.1145/154766.155362","index":15},"https://doi.org/10.1145/154766.155363":{"title":"Ralph E. Griswold, Madge T. Griswold: History of the Icon Programming Language. 53-68","address":"https://doi.org/10.1145/154766.155363","index":16},"https://doi.org/10.1145/154766.155364":{"title":"Alan C. Kay: The Early History of Smalltalk. 69-95","address":"https://doi.org/10.1145/154766.155364","index":17},"https://doi.org/10.1145/154766.155365":{"title":"C. H. Lindsey: A History of ALGOL 68. 97-132","address":"https://doi.org/10.1145/154766.155365","index":18},"https://doi.org/10.1145/154766.155367":{"title":"Barbara Liskov: A History of CLU. 133-147","address":"https://doi.org/10.1145/154766.155367","index":19},"https://doi.org/10.1145/154766.155368":{"title":"Richard E. Nance: A History of Discrete Event Simulation Programming Languages. 149-175","address":"https://doi.org/10.1145/154766.155368","index":20},"https://doi.org/10.1145/154766.155369":{"title":"Elizabeth D. Rather, Donald R. Colburn, Charles H. Moore: The Evolution of Forth. 177-199","address":"https://doi.org/10.1145/154766.155369","index":21},"https://doi.org/10.1145/154766.155580":{"title":"Dennis Ritchie: The Development of the C Language. 201-208","address":"https://doi.org/10.1145/154766.155580","index":22},"https://doi.org/10.1145/154766.155372":{"title":"Jean E. Sammet: The Beginning and Development of FORMAC (FORmula MAnipulation Compiler). 209-230","address":"https://doi.org/10.1145/154766.155372","index":23},"https://doi.org/10.1145/154766.155373":{"title":"Guy L. Steele Jr., Richard P. Gabriel: The Evolution of Lisp. 231-270","address":"https://doi.org/10.1145/154766.155373","index":24},"https://doi.org/10.1145/154766.155375":{"title":"Bjarne Stroustrup: A History of C++: 1979-1991. 271-297","address":"https://doi.org/10.1145/154766.155375","index":25},"https://doi.org/10.1145/154766.155376":{"title":"Williaam A. Whitaker: Ada - The Project: The DoD High Order Language Working Group. 299-331","address":"https://doi.org/10.1145/154766.155376","index":26},"https://doi.org/10.1145/154766.155378":{"title":"Niklaus Wirth: Recollections about the Development of Pascal. 333-342","address":"https://doi.org/10.1145/154766.155378","index":27},"https://doi.org/10.1145/800025":{"title":"Richard L. Wexelblat: History of Programming Languages, from the ACM SIGPLAN History of Programming Languages Conference, June 1-3, 1978, Los Angeles, California, USA. Academic Press / ACM 1981, ISBN 0-12-745040-8","address":"https://doi.org/10.1145/800025","index":28},"https://doi.org/10.1145/800025.1198339":{"title":"Jean E. Sammet: Conference chairman's opening remarks. 1-5","address":"https://doi.org/10.1145/800025.1198339","index":29},"https://doi.org/10.1145/800025.1198340":{"title":"Jean E. Sammet: Introduction of Captain Grace Murray Hopper. 5-7","address":"https://doi.org/10.1145/800025.1198340","index":30},"https://doi.org/10.1145/800025.1198341":{"title":"Grace Murray Hopper: Keynote address. 7-20","address":"https://doi.org/10.1145/800025.1198341","index":31},"https://doi.org/10.1145/800025.1198343":{"title":"Jean E. Sammet: Full text of all questions submitted. 23-24","address":"https://doi.org/10.1145/800025.1198343","index":32},"https://doi.org/10.1145/800025.1198345":{"title":"John Backus: The history of Fortran I, II, and III. 25-74","address":"https://doi.org/10.1145/800025.1198345","index":33},"https://doi.org/10.1145/800025.1198349":{"title":"Jan Lee: Full text of all questions submitted. 71-73","address":"https://doi.org/10.1145/800025.1198349","index":34},"https://doi.org/10.1145/800025.1198350":{"title":"Jan Lee: Biography of John Backus. 74","address":"https://doi.org/10.1145/800025.1198350","index":35},"https://doi.org/10.1145/800025.1198352":{"title":"Alan J. Perlis: The American side of the development of ALGOL. 75-91","address":"https://doi.org/10.1145/800025.1198352","index":36},"https://doi.org/10.1145/800025.1198353":{"title":"Peter Naur: The European side of the last phase of the development of ALGOL 60. 92-139","address":"https://doi.org/10.1145/800025.1198353","index":37},"https://doi.org/10.1145/800025.1198356":{"title":"Thomas Cheatham: Full text of all questions submitted. 167-170","address":"https://doi.org/10.1145/800025.1198356","index":38},"https://doi.org/10.1145/800025.1198357":{"title":"Thomas Cheatham: Biography of Alan J. Perlis. 171","address":"https://doi.org/10.1145/800025.1198357","index":39},"https://doi.org/10.1145/800025.1198358":{"title":"Thomas Cheatham: Biography of Peter Naur. 172","address":"https://doi.org/10.1145/800025.1198358","index":40},"https://doi.org/10.1145/800025.1198360":{"title":"John McCarthy: History of LISP. 173-185","address":"https://doi.org/10.1145/800025.1198360","index":41},"https://doi.org/10.1145/800025.1198364":{"title":"Barbara Liskov: Full text of all questions submitted. 196-197","address":"https://doi.org/10.1145/800025.1198364","index":42},"https://doi.org/10.1145/800025.1198365":{"title":"Barbara Liskov: Biography of John McCarthy. 197","address":"https://doi.org/10.1145/800025.1198365","index":43},"https://doi.org/10.1145/800025.1198367":{"title":"Jean E. Sammet: The early history of COBOL. 199-243","address":"https://doi.org/10.1145/800025.1198367","index":44},"https://doi.org/10.1145/800025.1198371":{"title":"Michael Marcotty: Full text of all questions submitted. 270-276","address":"https://doi.org/10.1145/800025.1198371","index":45},"https://doi.org/10.1145/800025.1198372":{"title":"Michael Marcotty: Biography of Jean E. Sammet. 277","address":"https://doi.org/10.1145/800025.1198372","index":46},"https://doi.org/10.1145/800025.1198374":{"title":"Douglas T. Ross: Origins of the APT language for automatically programmed tools. 279-338","address":"https://doi.org/10.1145/800025.1198374","index":47},"https://doi.org/10.1145/800025.1198377":{"title":"John B. Goodenough: Full text of all questions submitted. 366","address":"https://doi.org/10.1145/800025.1198377","index":48},"https://doi.org/10.1145/800025.1198378":{"title":"John B. Goodenough: Biography of Douglas T. Ross. 367","address":"https://doi.org/10.1145/800025.1198378","index":49},"https://doi.org/10.1145/800025.1198380":{"title":"Jules I. Schwartz: The development of JOVIAL. 369-388","address":"https://doi.org/10.1145/800025.1198380","index":50},"https://doi.org/10.1145/800025.1198383":{"title":"John B. Goodenough: Full text of all questions submitted. 399-400","address":"https://doi.org/10.1145/800025.1198383","index":51},"https://doi.org/10.1145/800025.1198384":{"title":"John B. Goodenough: Biography of Jules I. Schwartz. 401","address":"https://doi.org/10.1145/800025.1198384","index":52},"https://doi.org/10.1145/800025.1198386":{"title":"Geoffrey Gordon: The development of the General Purpose Simulation System (GPSS). 403-426","address":"https://doi.org/10.1145/800025.1198386","index":53},"https://doi.org/10.1145/800025.1198389":{"title":"Barbara Liskov: Full text of all questions submitted. 436-437","address":"https://doi.org/10.1145/800025.1198389","index":54},"https://doi.org/10.1145/800025.1198390":{"title":"Barbara Liskov: Biography of Geoffrey Gordon. 437","address":"https://doi.org/10.1145/800025.1198390","index":55},"https://doi.org/10.1145/800025.1198392":{"title":"Kristen Nygaard, Ole-Johan Dahl: The development of the SIMULA languages. 439-480","address":"https://doi.org/10.1145/800025.1198392","index":56},"https://doi.org/10.1145/800025.1198396":{"title":"Barbara Liskov: Full text of all questions submitted. 491","address":"https://doi.org/10.1145/800025.1198396","index":57},"https://doi.org/10.1145/800025.1198397":{"title":"Barbara Liskov: Biography of Kristen Nygaard. 492","address":"https://doi.org/10.1145/800025.1198397","index":58},"https://doi.org/10.1145/800025.1198398":{"title":"Barbara Liskov: Biography of Ole-Johan Dahl. 493","address":"https://doi.org/10.1145/800025.1198398","index":59},"https://doi.org/10.1145/800025.1198400":{"title":"Charles L. Baker: JOSS: JOHNNIAC open-shop system. 495-508","address":"https://doi.org/10.1145/800025.1198400","index":60},"https://doi.org/10.1145/800025.1198401":{"title":"Thomas Cheatham: Full text of all questions submitted. 508-511","address":"https://doi.org/10.1145/800025.1198401","index":61},"https://doi.org/10.1145/800025.1198402":{"title":"Thomas Cheatham: Biography of Charles L. Baker. 512-513","address":"https://doi.org/10.1145/800025.1198402","index":62},"https://doi.org/10.1145/800025.1198404":{"title":"Thomas E. Kurtz: BASIC. 515-537","address":"https://doi.org/10.1145/800025.1198404","index":63},"https://doi.org/10.1145/800025.1198407":{"title":"Thomas Cheatham: Full text of all questions submitted. 548-549","address":"https://doi.org/10.1145/800025.1198407","index":64},"https://doi.org/10.1145/800025.1198408":{"title":"Thomas Cheatham: Biography of Thomas E. Kurtz. 549","address":"https://doi.org/10.1145/800025.1198408","index":65},"https://doi.org/10.1145/800025.1198410":{"title":"George Radin: The early history and characteristics of PL/I. 551-575","address":"https://doi.org/10.1145/800025.1198410","index":66},"https://doi.org/10.1145/800025.1198414":{"title":"Robert F. Rosin: Full text of all questions submitted. 596-598","address":"https://doi.org/10.1145/800025.1198414","index":67},"https://doi.org/10.1145/800025.1198415":{"title":"Robert F. Rosin: Biography of George Radin. 599","address":"https://doi.org/10.1145/800025.1198415","index":68},"https://doi.org/10.1145/800025.1198417":{"title":"Ralph E. Griswold: A history of the SNOBOL programming languages. 601-645","address":"https://doi.org/10.1145/800025.1198417","index":69},"https://doi.org/10.1145/800025.1198420":{"title":"Jan Lee: Full text of all questions submitted. 659","address":"https://doi.org/10.1145/800025.1198420","index":70},"https://doi.org/10.1145/800025.1198421":{"title":"Jan Lee: Biography of Ralph E. Griswold. 660","address":"https://doi.org/10.1145/800025.1198421","index":71},"https://doi.org/10.1145/800025.1198423":{"title":"Adin D. Falkoff, Kenneth E. Iverson: The evolution of APL. 661-674","address":"https://doi.org/10.1145/800025.1198423","index":72},"https://doi.org/10.1145/800025.1198427":{"title":"Jan Lee: Full text of all questions submitted. 686-690","address":"https://doi.org/10.1145/800025.1198427","index":73},"https://doi.org/10.1145/800025.1198428":{"title":"Jan Lee: Biography of Adin D. Falkoff. 690","address":"https://doi.org/10.1145/800025.1198428","index":74},"https://doi.org/10.1145/800025.1198429":{"title":"Jan Lee: Biography of Kenneth E. Iverson. 691","address":"https://doi.org/10.1145/800025.1198429","index":75},"https://doi.org/10.1145/800025.1198335":{"title":"Appendixes. 693-746","address":"https://doi.org/10.1145/800025.1198335","index":76},"https://doi.org/10.1145/800025.1198336":{"title":"Richard L. Wexelblat: Afterword. 747-748","address":"https://doi.org/10.1145/800025.1198336","index":77},"https://doi.org/10.1145/3371069":{"title":"Davide Barbarossa, Giulio Manzonetto: Taylor subsumes Scott, Berry, Kahn and Plotkin. 1:1-1:23","address":"https://doi.org/10.1145/3371069","index":78},"https://doi.org/10.1145/3371070":{"title":"Martin Clochard, Claude Marché, Andrei Paskevich: Deductive verification with ghost monitors. 2:1-2:26","address":"https://doi.org/10.1145/3371070","index":79},"https://doi.org/10.1145/3371071":{"title":"Stephen Chang, Michael Ballantyne, Milo Turner, William J. Bowman: Dependent type systems as macros. 3:1-3:29","address":"https://doi.org/10.1145/3371071","index":80},"https://doi.org/10.1145/3371072":{"title":"Kenji Maillard, Catalin Hritcu, Exequiel Rivas, Antoine Van Muylder: The next 700 relational program logics. 4:1-4:33","address":"https://doi.org/10.1145/3371072","index":81},"https://doi.org/10.1145/3371073":{"title":"Yotam M. Y. Feldman, Neil Immerman, Mooly Sagiv, Sharon Shoham: Complexity and information in invariant inference. 5:1-5:29","address":"https://doi.org/10.1145/3371073","index":82},"https://doi.org/10.1145/3371074":{"title":"Jonas Kastberg Hinrichsen, Jesper Bengtson, Robbert Krebbers: Actris: session-type based reasoning in separation logic. 6:1-6:30","address":"https://doi.org/10.1145/3371074","index":83},"https://doi.org/10.1145/3371075":{"title":"Gilles Barthe, Sandrine Blazy, Benjamin Grégoire, Rémi Hutin, Vincent Laporte, David Pichardie, Alix Trieu: Formal verification of a constant-time preserving C compiler. 7:1-7:30","address":"https://doi.org/10.1145/3371075","index":84},"https://doi.org/10.1145/3371076":{"title":"Matthieu Sozeau, Simon Boulier, Yannick Forster, Nicolas Tabareau, Théo Winterhalter: Coq Coq correct! verification of type checking and erasure for Coq, in Coq. 8:1-8:28","address":"https://doi.org/10.1145/3371076","index":85},"https://doi.org/10.1145/3371077":{"title":"Jason Z. S. Hu, Ondrej Lhoták: Undecidability of d<: and its decidable fragments. 9:1-9:30","address":"https://doi.org/10.1145/3371077","index":86},"https://doi.org/10.1145/3371078":{"title":"Peter W. O'Hearn: Incorrectness logic. 10:1-10:32","address":"https://doi.org/10.1145/3371078","index":87},"https://doi.org/10.1145/3371079":{"title":"Azalea Raad, John Wickerson, Gil Neiger, Viktor Vafeiadis: Persistency semantics of the Intel-x86 architecture. 11:1-11:31","address":"https://doi.org/10.1145/3371079","index":88},"https://doi.org/10.1145/3371080":{"title":"Zheng Guo, Michael James, David Justo, Jiaxiao Zhou, Ziteng Wang, Ranjit Jhala, Nadia Polikarpova: Program synthesis by type-guided abstraction refinement. 12:1-12:28","address":"https://doi.org/10.1145/3371080","index":89},"https://doi.org/10.1145/3371081":{"title":"Azadeh Farzan, Anthony Vandikas: Reductions for safety proofs. 13:1-13:28","address":"https://doi.org/10.1145/3371081","index":90},"https://doi.org/10.1145/3371082":{"title":"Sung Kook Kim, Arnaud J. Venet, Aditya V. Thakur: Deterministic parallel fixpoint computation. 14:1-14:33","address":"https://doi.org/10.1145/3371082","index":91},"https://doi.org/10.1145/3371083":{"title":"G. A. Kavvos, Edward Morehouse, Daniel R. Licata, Norman Danner: Recurrence extraction for functional programs through call-by-push-value. 15:1-15:31","address":"https://doi.org/10.1145/3371083","index":92},"https://doi.org/10.1145/3371084":{"title":"Wonyeol Lee, Hangyeol Yu, Xavier Rival, Hongseok Yang: Towards verified stochastic variational inference for probabilistic programs. 16:1-16:33","address":"https://doi.org/10.1145/3371084","index":93},"https://doi.org/10.1145/3371085":{"title":"Andreas Pavlogiannis: Fast, sound, and effectively complete dynamic race prediction. 17:1-17:29","address":"https://doi.org/10.1145/3371085","index":94},"https://doi.org/10.1145/3371086":{"title":"Federico Aschieri, Francesco A. Genco: Par means parallel: multiplicative linear logic proofs as concurrent functional programs. 18:1-18:28","address":"https://doi.org/10.1145/3371086","index":95},"https://doi.org/10.1145/3371087":{"title":"Alexander K. Lew, Marco F. Cusumano-Towner, Benjamin Sherman, Michael Carbin, Vikash K. Mansinghka: Trace types and denotational semantics for sound programmable inference in probabilistic languages. 19:1-19:32","address":"https://doi.org/10.1145/3371087","index":96},"https://doi.org/10.1145/3371088":{"title":"Mengqi Liu, Lionel Rieg, Zhong Shao, Ronghui Gu, David Costanzo, Jung-Eun Kim, Man-Ki Yoon: Virtual timeline: a formal abstraction for verifying preemptive schedulers with temporal isolation. 20:1-20:31","address":"https://doi.org/10.1145/3371088","index":97},"https://doi.org/10.1145/3371089":{"title":"Gilles Barthe, Justin Hsu, Mingsheng Ying, Nengkun Yu, Li Zhou: Relational proofs for quantum programs. 21:1-21:29","address":"https://doi.org/10.1145/3371089","index":98},"https://doi.org/10.1145/3371090":{"title":"Michael Arntzenius, Neel Krishnaswami: Seminaïve evaluation for a higher-order functional language. 22:1-22:28","address":"https://doi.org/10.1145/3371090","index":99},"https://doi.org/10.1145/3371091":{"title":"Youngju Song, Minki Cho, Dongjoo Kim, Yonghyun Kim, Jeehoon Kang, Chung-Kil Hur: CompCertM: CompCert with C-assembly linking and lightweight modular verification. 23:1-23:31","address":"https://doi.org/10.1145/3371091","index":100},"https://doi.org/10.1145/3371092":{"title":"Martin A. T. Handley, Niki Vazou, Graham Hutton: Liquidate your assets: reasoning about resource usage in liquid Haskell. 24:1-24:27","address":"https://doi.org/10.1145/3371092","index":101},"https://doi.org/10.1145/3371093":{"title":"Peixin Wang, Hongfei Fu, Krishnendu Chatterjee, Yuxin Deng, Ming Xu: Proving expected sensitivity of probabilistic programs with randomized variable-dependent termination time. 25:1-25:30","address":"https://doi.org/10.1145/3371093","index":102},"https://doi.org/10.1145/3371094":{"title":"Parosh Aziz Abdulla, Mohamed Faouzi Atig, Rojin Rezvan: Parameterized verification under TSO is PSPACE-complete. 26:1-26:29","address":"https://doi.org/10.1145/3371094","index":103},"https://doi.org/10.1145/3371095":{"title":"Yannick Forster, Fabian Kunze, Marc Roth: The weak call-by-value λ-calculus is reasonable for both time and space. 27:1-27:23","address":"https://doi.org/10.1145/3371095","index":104},"https://doi.org/10.1145/3371096":{"title":"Roberto Bruni, Roberto Giacobazzi, Roberta Gori, Isabel Garcia-Contreras, Dusko Pavlovic: Abstract extensionality: on the properties of incomplete abstract interpretations. 28:1-28:28","address":"https://doi.org/10.1145/3371096","index":105},"https://doi.org/10.1145/3371097":{"title":"Zeina Migeed, Jens Palsberg: What is decidable about gradual types? 29:1-29:29","address":"https://doi.org/10.1145/3371097","index":106},"https://doi.org/10.1145/3371098":{"title":"David Binder, Julian Jabs, Ingo Skupin, Klaus Ostermann: Decomposition diversity with symmetric data and codata. 30:1-30:28","address":"https://doi.org/10.1145/3371098","index":107},"https://doi.org/10.1145/3371099":{"title":"Benedikt Ahrens, André Hirschowitz, Ambroise Lafont, Marco Maggesi: Reduction monads and their signatures. 31:1-31:29","address":"https://doi.org/10.1145/3371099","index":108},"https://doi.org/10.1145/3371100":{"title":"Michael Sammler, Deepak Garg, Derek Dreyer, Tadeusz Litak: The high-level benefits of low-level sandboxing. 32:1-32:32","address":"https://doi.org/10.1145/3371100","index":109},"https://doi.org/10.1145/3371101":{"title":"Paulo Emílio de Vilhena, François Pottier, Jacques-Henri Jourdan: Spy game: verifying a local generic solver in Iris. 33:1-33:28","address":"https://doi.org/10.1145/3371101","index":110},"https://doi.org/10.1145/3371102":{"title":"Hoang-Hai Dang, Jacques-Henri Jourdan, Jan-Oliver Kaiser, Derek Dreyer: RustBelt meets relaxed memory. 34:1-34:29","address":"https://doi.org/10.1145/3371102","index":111},"https://doi.org/10.1145/3371103":{"title":"Umang Mathur, Adithya Murali, Paul Krogmeier, P. Madhusudan, Mahesh Viswanathan: Deciding memory safety for single-pass heap-manipulating programs. 35:1-35:29","address":"https://doi.org/10.1145/3371103","index":112},"https://doi.org/10.1145/3371104":{"title":"Feras A. Saad, Cameron E. Freer, Martin C. Rinard, Vikash K. Mansinghka: Optimal approximate sampling from discrete probability distributions. 36:1-36:31","address":"https://doi.org/10.1145/3371104","index":113},"https://doi.org/10.1145/3371105":{"title":"Marcel Hark, Benjamin Lucien Kaminski, Jürgen Giesl, Joost-Pieter Katoen: Aiming low is harder: induction for lower bounds in probabilistic program verification. 37:1-37:28","address":"https://doi.org/10.1145/3371105","index":114},"https://doi.org/10.1145/3371106":{"title":"Martín Abadi, Gordon D. Plotkin: A simple differentiable programming language. 38:1-38:28","address":"https://doi.org/10.1145/3371106","index":115},"https://doi.org/10.1145/3371107":{"title":"Alexander Vandenbroucke, Tom Schrijvers: PλωNK: functional probabilistic NetKAT. 39:1-39:27","address":"https://doi.org/10.1145/3371107","index":116},"https://doi.org/10.1145/3371108":{"title":"Mark P. Jones, J. Garrett Morris, Richard A. Eisenberg: Partial type constructors: or, making ad hoc datatypes less ad hoc. 40:1-40:28","address":"https://doi.org/10.1145/3371108","index":117},"https://doi.org/10.1145/3371109":{"title":"Ralf Jung, Hoang-Hai Dang, Jeehoon Kang, Derek Dreyer: Stacked borrows: an aliasing model for Rust. 41:1-41:32","address":"https://doi.org/10.1145/3371109","index":118},"https://doi.org/10.1145/3371110":{"title":"Ryan Beckett, Aarti Gupta, Ratul Mahajan, David Walker: Abstract interpretation of distributed network control planes. 42:1-42:27","address":"https://doi.org/10.1145/3371110","index":119},"https://doi.org/10.1145/3371111":{"title":"Michael Greenberg, Austin J. Blatt: Executable formal semantics for the POSIX shell. 43:1-43:30","address":"https://doi.org/10.1145/3371111","index":120},"https://doi.org/10.1145/3371112":{"title":"Timothy Bourke, Lélio Brun, Marc Pouzet: Mechanized semantics and verified compilation for a dataflow synchronous language with reset. 44:1-44:29","address":"https://doi.org/10.1145/3371112","index":121},"https://doi.org/10.1145/3371113":{"title":"Ralf Jung, Rodolphe Lepigre, Gaurav Parthasarathy, Marianna Rapoport, Amin Timany, Derek Dreyer, Bart Jacobs: The future is ours: prophecy variables in separation logic. 45:1-45:32","address":"https://doi.org/10.1145/3371113","index":122},"https://doi.org/10.1145/3371114":{"title":"Max S. New, Dustin Jamner, Amal Ahmed: Graduality and parametricity: together again for the first time. 46:1-46:32","address":"https://doi.org/10.1145/3371114","index":123},"https://doi.org/10.1145/3371115":{"title":"Sam Westrick, Rohan Yadav, Matthew Fluet, Umut A. Acar: Disentanglement in nested-parallel programs. 47:1-47:32","address":"https://doi.org/10.1145/3371115","index":124},"https://doi.org/10.1145/3371116":{"title":"Dariusz Biernacki, Maciej Piróg, Piotr Polesiuk, Filip Sieczkowski: Binders by day, labels by night: effect instances via lexically scoped handlers. 48:1-48:29","address":"https://doi.org/10.1145/3371116","index":125},"https://doi.org/10.1145/3371117":{"title":"Chenglong Wang, Yu Feng, Rastislav Bodík, Alvin Cheung, Isil Dillig: Visualization by example. 49:1-49:28","address":"https://doi.org/10.1145/3371117","index":126},"https://doi.org/10.1145/3371118":{"title":"David Darais, Ian Sweet, Chang Liu, Michael Hicks: A language for probabilistically oblivious computation. 50:1-50:31","address":"https://doi.org/10.1145/3371118","index":127},"https://doi.org/10.1145/3371119":{"title":"Li-yao Xia, Yannick Zakowski, Paul He, Chung-Kil Hur, Gregory Malecha, Benjamin C. Pierce, Steve Zdancewic: Interaction trees: representing recursive and impure programs in Coq. 51:1-51:32","address":"https://doi.org/10.1145/3371119","index":128},"https://doi.org/10.1145/3371120":{"title":"Malavika Samak, Deokhwan Kim, Martin C. Rinard: Synthesizing replacement classes. 52:1-52:33","address":"https://doi.org/10.1145/3371120","index":129},"https://doi.org/10.1145/3371121":{"title":"Ningning Xie, Richard A. Eisenberg, Bruno C. d. S. Oliveira: Kind inference for datatypes. 53:1-53:28","address":"https://doi.org/10.1145/3371121","index":130},"https://doi.org/10.1145/3371122":{"title":"Suguman Bansal, Kedar S. Namjoshi, Yaniv Sa'ar: Synthesis of coordination programs from linear temporal specifications. 54:1-54:27","address":"https://doi.org/10.1145/3371122","index":131},"https://doi.org/10.1145/3371123":{"title":"Gilles Barthe, Justin Hsu, Kevin Liao: A probabilistic separation logic. 55:1-55:30","address":"https://doi.org/10.1145/3371123","index":132},"https://doi.org/10.1145/3371124":{"title":"Shengwei An, Rishabh Singh, Sasa Misailovic, Roopsha Samanta: Augmented example-based synthesis using relational perturbation properties. 56:1-56:24","address":"https://doi.org/10.1145/3371124","index":133},"https://doi.org/10.1145/3371125":{"title":"Fredrik Dahlqvist, Dexter Kozen: Semantics of higher-order probabilistic programs with conditioning. 57:1-57:29","address":"https://doi.org/10.1145/3371125","index":134},"https://doi.org/10.1145/3371126":{"title":"Pierre-Marie Pédrot, Nicolas Tabareau: The fire triangle: how to mix substitution, dependent elimination, and effects. 58:1-58:28","address":"https://doi.org/10.1145/3371126","index":135},"https://doi.org/10.1145/3371127":{"title":"Guilhem Jaber: SyTeCi: automating contextual equivalence for higher-order programs with references. 59:1-59:28","address":"https://doi.org/10.1145/3371127","index":136},"https://doi.org/10.1145/3371128":{"title":"Daming Zou, Muhan Zeng, Yingfei Xiong, Zhoulai Fu, Lu Zhang, Zhendong Su: Detecting floating-point errors via atomic conditions. 60:1-60:27","address":"https://doi.org/10.1145/3371128","index":137},"https://doi.org/10.1145/3371129":{"title":"Steffen Smolka, Nate Foster, Justin Hsu, Tobias Kappé, Dexter Kozen, Alexandra Silva: Guarded Kleene algebra with tests: verification of uninterpreted programs in nearly linear time. 61:1-61:28","address":"https://doi.org/10.1145/3371129","index":138},"https://doi.org/10.1145/3371130":{"title":"Mukund Raghothaman, Jonathan Mendelson, David Zhao, Mayur Naik, Bernhard Scholz: Provenance-guided synthesis of Datalog programs. 62:1-62:27","address":"https://doi.org/10.1145/3371130","index":139},"https://doi.org/10.1145/3371131":{"title":"Pierre Clairambault, Marc de Visme: Full abstraction for the quantum lambda-calculus. 63:1-63:28","address":"https://doi.org/10.1145/3371131","index":140},"https://doi.org/10.1145/3371132":{"title":"Aloïs Brunel, Damiano Mazza, Michele Pagani: Backpropagation in the simply typed lambda-calculus with linear negation. 64:1-64:27","address":"https://doi.org/10.1145/3371132","index":141},"https://doi.org/10.1145/3371133":{"title":"Lukas Lazarek, Alexis King, Samanvitha Sundar, Robert Bruce Findler, Christos Dimoulas: Does blame shifting work? 65:1-65:29","address":"https://doi.org/10.1145/3371133","index":142},"https://doi.org/10.1145/3371134":{"title":"Julian Mackay, Alex Potanin, Jonathan Aldrich, Lindsay Groves: Decidable subtyping for path dependent types. 66:1-66:27","address":"https://doi.org/10.1145/3371134","index":143},"https://doi.org/10.1145/3371135":{"title":"Peter Thiemann, Vasco T. Vasconcelos: Label-dependent session types. 67:1-67:29","address":"https://doi.org/10.1145/3371135","index":144},"https://doi.org/10.1145/3371136":{"title":"Roland Meyer, Sebastian Wolff: Pointer life cycle types for lock-free data structures with memory reclamation. 68:1-68:36","address":"https://doi.org/10.1145/3371136","index":145},"https://doi.org/10.1145/3386319":{"title":"Roger K. W. Hui, Morten Kromberg: APL since 1978. 69:1-69:108","address":"https://doi.org/10.1145/3386319","index":146},"https://doi.org/10.1145/3386320":{"title":"Bjarne Stroustrup: Thriving in a crowded and changing world: C++ 2006-2020. 70:1-70:168","address":"https://doi.org/10.1145/3386320","index":147},"https://doi.org/10.1145/3386321":{"title":"Rich Hickey: A history of Clojure. 71:1-71:46","address":"https://doi.org/10.1145/3386321","index":148},"https://doi.org/10.1145/3386322":{"title":"John Reid, Bill Long, Jon Steidel: History of coarrays and SPMD parallelism in Fortran. 72:1-72:30","address":"https://doi.org/10.1145/3386322","index":149},"https://doi.org/10.1145/3386323":{"title":"Walter Bright, Andrei Alexandrescu, Michael Parker: Origins of the D programming language. 73:1-73:38","address":"https://doi.org/10.1145/3386323","index":150},"https://doi.org/10.1145/3386324":{"title":"Stefan Monnier, Michael Sperber: Evolution of Emacs Lisp. 74:1-74:55","address":"https://doi.org/10.1145/3386324","index":151},"https://doi.org/10.1145/3386325":{"title":"Don Syme: The early history of F#. 75:1-75:58","address":"https://doi.org/10.1145/3386325","index":152},"https://doi.org/10.1145/3386326":{"title":"Paul King: A history of the Groovy programming language. 76:1-76:53","address":"https://doi.org/10.1145/3386326","index":153},"https://doi.org/10.1145/3386327":{"title":"Allen Wirfs-Brock, Brendan Eich: JavaScript: the first 20 years. 77:1-77:189","address":"https://doi.org/10.1145/3386327","index":154},"https://doi.org/10.1145/3386328":{"title":"Jeffrey Kodosky: LabVIEW. 78:1-78:54","address":"https://doi.org/10.1145/3386328","index":155},"https://doi.org/10.1145/3386329":{"title":"Cynthia Solomon, Brian Harvey, Ken Kahn, Henry Lieberman, Mark L. Miller, Margaret Minsky, Artemis Papert, Brian Silverman: History of Logo. 79:1-79:66","address":"https://doi.org/10.1145/3386329","index":156},"https://doi.org/10.1145/3386330":{"title":"William D. Clinger, Mitchell Wand: Hygienic macro technology. 80:1-80:110","address":"https://doi.org/10.1145/3386330","index":157},"https://doi.org/10.1145/3386331":{"title":"Cleve Moler, Jack Little: A history of MATLAB. 81:1-81:67","address":"https://doi.org/10.1145/3386331","index":158},"https://doi.org/10.1145/3386332":{"title":"Brad J. Cox, Steve Naroff, Hansen Hsu: The origins of Objective-C at PPI/Stepstone and its evolution at NeXT. 82:1-82:74","address":"https://doi.org/10.1145/3386332","index":159},"https://doi.org/10.1145/3386333":{"title":"Peter Van Roy, Seif Haridi, Christian Schulte, Gert Smolka: A history of the Oz multiparadigm language. 83:1-83:56","address":"https://doi.org/10.1145/3386333","index":160},"https://doi.org/10.1145/3386334":{"title":"John M. Chambers: S, R, and data science. 84:1-84:17","address":"https://doi.org/10.1145/3386334","index":161},"https://doi.org/10.1145/3386335":{"title":"Daniel Ingalls: The evolution of Smalltalk: from Smalltalk-72 through Squeak. 85:1-85:101","address":"https://doi.org/10.1145/3386335","index":162},"https://doi.org/10.1145/3386336":{"title":"David MacQueen, Robert Harper, John H. Reppy: The history of Standard ML. 86:1-86:100","address":"https://doi.org/10.1145/3386336","index":163},"https://doi.org/10.1145/3386337":{"title":"Peter Flake, Phil Moorby, Steve Golson, Arturo Salz, Simon J. Davidmann: Verilog HDL and its ancestors and descendants. 87:1-87:90","address":"https://doi.org/10.1145/3386337","index":164},"https://doi.org/10.1145/3408970":{"title":"Xiaohong Chen, Grigore Rosu: A general approach to define binders using matching logic. 88:1-88:32","address":"https://doi.org/10.1145/3408970","index":165},"https://doi.org/10.1145/3408971":{"title":"Alejandro Serrano, Jurriaan Hage, Simon Peyton Jones, Dimitrios Vytiniotis: A quick look at impredicativity. 89:1-89:29","address":"https://doi.org/10.1145/3408971","index":166},"https://doi.org/10.1145/3408972":{"title":"Andreas Abel, Jean-Philippe Bernardy: A unified view of modalities in type systems. 90:1-90:28","address":"https://doi.org/10.1145/3408972","index":167},"https://doi.org/10.1145/3408973":{"title":"Matus Tejiscak: A dependently typed calculus with pattern matching and erasure inference. 91:1-91:29","address":"https://doi.org/10.1145/3408973","index":168},"https://doi.org/10.1145/3408974":{"title":"Bastian Hagedorn, Johannes Lenfers, Thomas Koehler, Xueying Qin, Sergei Gorlatch, Michel Steuwer: Achieving high-performance the functional way: a functional pearl on expressing high-performance optimizations as rewrite strategies. 92:1-92:29","address":"https://doi.org/10.1145/3408974","index":169},"https://doi.org/10.1145/3408975":{"title":"Philipp Schuster, Jonathan Immanuel Brachthäuser, Klaus Ostermann: Compiling effect handlers in capability-passing style. 93:1-93:28","address":"https://doi.org/10.1145/3408975","index":170},"https://doi.org/10.1145/3408976":{"title":"Matthew Weidner, Heather Miller, Christopher Meiklejohn: Composing and decomposing op-based CRDTs with semidirect products. 94:1-94:27","address":"https://doi.org/10.1145/3408976","index":171},"https://doi.org/10.1145/3408977":{"title":"Nick Rioux, Steve Zdancewic: Computation focusing. 95:1-95:27","address":"https://doi.org/10.1145/3408977","index":172},"https://doi.org/10.1145/3408978":{"title":"Glen Mével, Jacques-Henri Jourdan, François Pottier: Cosmo: a concurrent separation logic for multicore OCaml. 96:1-96:29","address":"https://doi.org/10.1145/3408978","index":173},"https://doi.org/10.1145/3408979":{"title":"Joseph W. Cutler, Daniel R. Licata, Norman Danner: Denotational recurrence extraction for amortized analysis. 97:1-97:29","address":"https://doi.org/10.1145/3408979","index":174},"https://doi.org/10.1145/3408980":{"title":"Nándor Licker, Timothy M. Jones: Duplo: a framework for OCaml post-link optimisation. 98:1-98:29","address":"https://doi.org/10.1145/3408980","index":175},"https://doi.org/10.1145/3408981":{"title":"Ningning Xie, Jonathan Immanuel Brachthäuser, Daniel Hillerström, Philipp Schuster, Daan Leijen: Effect handlers, evidently. 99:1-99:29","address":"https://doi.org/10.1145/3408981","index":176},"https://doi.org/10.1145/3408982":{"title":"Daniel Hillerström, Sam Lindley, John Longley: Effects for efficiency: asymptotic speedup with first-class control. 100:1-100:29","address":"https://doi.org/10.1145/3408982","index":177},"https://doi.org/10.1145/3408983":{"title":"András Kovács: Elaboration with first-class implicit function types. 101:1-101:29","address":"https://doi.org/10.1145/3408983","index":178},"https://doi.org/10.1145/3408984":{"title":"Zachary Palmer, Theodore Park, Scott F. Smith, Shiwei Weng: Higher-order demand-driven symbolic evaluation. 102:1-102:28","address":"https://doi.org/10.1145/3408984","index":179},"https://doi.org/10.1145/3408985":{"title":"Gabriel Radanne, Hannes Saffrich, Peter Thiemann: Kindly bent to free us. 103:1-103:29","address":"https://doi.org/10.1145/3408985","index":180},"https://doi.org/10.1145/3408986":{"title":"Paul Downen, Zena M. Ariola, Simon Peyton Jones, Richard A. Eisenberg: Kinds are calling conventions. 104:1-104:29","address":"https://doi.org/10.1145/3408986","index":181},"https://doi.org/10.1145/3408987":{"title":"Nadia Polikarpova, Deian Stefan, Jean Yang, Shachar Itzhaky, Travis Hance, Armando Solar-Lezama: Liquid information flow control. 105:1-105:30","address":"https://doi.org/10.1145/3408987","index":182},"https://doi.org/10.1145/3408988":{"title":"Tristan Knoth, Di Wang, Adam Reynolds, Jan Hoffmann, Nadia Polikarpova: Liquid resource types. 106:1-106:29","address":"https://doi.org/10.1145/3408988","index":183},"https://doi.org/10.1145/3408989":{"title":"Sebastian Graf, Simon Peyton Jones, Ryan G. Scott: Lower your guards: a compositional pattern-match coverage checker. 107:1-107:30","address":"https://doi.org/10.1145/3408989","index":184},"https://doi.org/10.1145/3408990":{"title":"Pierce Darragh, Michael D. Adams: Parsing with zippers (functional pearl). 108:1-108:28","address":"https://doi.org/10.1145/3408990","index":185},"https://doi.org/10.1145/3408991":{"title":"Justin Lubin, Nick Collins, Cyrus Omar, Ravi Chugh: Program sketching with live bidirectional evaluation. 109:1-109:29","address":"https://doi.org/10.1145/3408991","index":186},"https://doi.org/10.1145/3408992":{"title":"Di Wang, David M. Kahn, Jan Hoffmann: Raising expectations: automating expected cost analysis with types. 110:1-110:31","address":"https://doi.org/10.1145/3408992","index":187},"https://doi.org/10.1145/3408993":{"title":"Vikraman Choudhury, Neel Krishnaswami: Recovering purity with comonads and capabilities. 111:1-111:28","address":"https://doi.org/10.1145/3408993","index":188},"https://doi.org/10.1145/3408994":{"title":"Timothée Haudebourg, Thomas Genet, Thomas P. Jensen: Regular language type inference with term rewriting. 112:1-112:29","address":"https://doi.org/10.1145/3408994","index":189},"https://doi.org/10.1145/3408995":{"title":"K. C. Sivaramakrishnan, Stephen Dolan, Leo White, Sadiq Jaffer, Tom Kelly, Anmol Sahoo, Sudha Parimala, Atul Dhiman, Anil Madhavapeddy: Retrofitting parallelism onto OCaml. 113:1-113:30","address":"https://doi.org/10.1145/3408995","index":190},"https://doi.org/10.1145/3408996":{"title":"Paolo G. Giarrusso, Léo Stefanesco, Amin Timany, Lars Birkedal, Robbert Krebbers: Scala step-by-step: soundness for DOT with step-indexed logical relations in Iris. 114:1-114:29","address":"https://doi.org/10.1145/3408996","index":191},"https://doi.org/10.1145/3408997":{"title":"Daniel Selsam, Simon Hudon, Leonardo de Moura: Sealing pointer-based optimizations behind pure functions. 115:1-115:20","address":"https://doi.org/10.1145/3408997","index":192},"https://doi.org/10.1145/3408998":{"title":"Arthur Charguéraud: Separation logic for sequential programs (functional pearl). 116:1-116:34","address":"https://doi.org/10.1145/3408998","index":193},"https://doi.org/10.1145/3408999":{"title":"Taro Sekiyama, Takeshi Tsukada, Atsushi Igarashi: Signature restriction for polymorphic algebraic effects. 117:1-117:30","address":"https://doi.org/10.1145/3408999","index":194},"https://doi.org/10.1145/3409000":{"title":"Kazutaka Matsuda, Meng Wang: Sparcl: a language for partially-invertible computation. 118:1-118:31","address":"https://doi.org/10.1145/3409000","index":195},"https://doi.org/10.1145/3409001":{"title":"Benoît Montagu, Thomas P. Jensen: Stable relations and abstract interpretation of higher-order programs. 119:1-119:30","address":"https://doi.org/10.1145/3409001","index":196},"https://doi.org/10.1145/3409002":{"title":"Jamie Willis, Nicolas Wu, Matthew Pickering: Staged selective parser combinators. 120:1-120:30","address":"https://doi.org/10.1145/3409002","index":197},"https://doi.org/10.1145/3409003":{"title":"Nikhil Swamy, Aseem Rastogi, Aymeric Fromherz, Denis Merigoux, Danel Ahman, Guido Martínez: SteelCore: an extensible concurrent separation logic for effectful dependently typed programs. 121:1-121:30","address":"https://doi.org/10.1145/3409003","index":198},"https://doi.org/10.1145/3409004":{"title":"Aaron Stump, Christopher Jenkins, Stephan Spahn, Colin McDonald: Strong functional pearl: Harper's regular-expression matcher in Cedille. 122:1-122:25","address":"https://doi.org/10.1145/3409004","index":199},"https://doi.org/10.1145/3409005":{"title":"Jeremiah Griffin, Mohsen Lesani, Narges Shadab, Xizhe Yin: TLC: temporal logic of distributed components. 123:1-123:30","address":"https://doi.org/10.1145/3409005","index":200},"https://doi.org/10.1145/3409006":{"title":"Lionel Parreaux: The simple essence of algebraic subtyping: principal type inference with subtyping made easy (functional pearl). 124:1-124:28","address":"https://doi.org/10.1145/3409006","index":201},"https://doi.org/10.1145/3428193":{"title":"Magnus Madsen, Ondrej Lhoták: Fixpoints for the masses: programming with first-class Datalog constraints. 125:1-125:28","address":"https://doi.org/10.1145/3428193","index":202},"https://doi.org/10.1145/3428194":{"title":"Jonathan Immanuel Brachthäuser, Philipp Schuster, Klaus Ostermann: Effects as capabilities: effect handlers and lightweight effect polymorphism. 126:1-126:30","address":"https://doi.org/10.1145/3428194","index":203},"https://doi.org/10.1145/3428195":{"title":"André Pacak, Sebastian Erdweg, Tamás Szabó: A systematic approach to deriving incremental type checkers. 127:1-127:28","address":"https://doi.org/10.1145/3428195","index":204},"https://doi.org/10.1145/3428196":{"title":"Yotam M. Y. Feldman, Artem Khyzha, Constantin Enea, Adam Morrison, Aleksandar Nanevski, Noam Rinetzky, Sharon Shoham: Proving highly-concurrent traversals correct. 128:1-128:29","address":"https://doi.org/10.1145/3428196","index":205},"https://doi.org/10.1145/3428197":{"title":"Cyril Six, Sylvain Boulmé, David Monniaux: Certified and efficient instruction scheduling: application to interlocked VLIW processors. 129:1-129:29","address":"https://doi.org/10.1145/3428197","index":206},"https://doi.org/10.1145/3428198":{"title":"Giulia Meuli, Mathias Soeken, Martin Roetteler, Thomas Häner: Enabling accuracy-aware Quantum compilers using symbolic resource estimation. 130:1-130:26","address":"https://doi.org/10.1145/3428198","index":207},"https://doi.org/10.1145/3428199":{"title":"Guilherme V. Leobas, Fernando Magno Quintão Pereira: Semiring optimizations: dynamic elision of expressions with identity and absorbing elements. 131:1-131:28","address":"https://doi.org/10.1145/3428199","index":208},"https://doi.org/10.1145/3428200":{"title":"Michael J. Coblenz, Jonathan Aldrich, Brad A. Myers, Joshua Sunshine: Can advanced type systems be usable? An empirical study of ownership, assets, and typestate in Obsidian. 132:1-132:28","address":"https://doi.org/10.1145/3428200","index":209},"https://doi.org/10.1145/3428201":{"title":"Thomas Häner, Torsten Hoefler, Matthias Troyer: Assertion-based optimization of Quantum programs. 133:1-133:20","address":"https://doi.org/10.1145/3428201","index":210},"https://doi.org/10.1145/3428202":{"title":"Rupak Majumdar, Nobuko Yoshida, Damien Zufferey: Multiparty motion coordination: from choreographies to robotics programs. 134:1-134:30","address":"https://doi.org/10.1145/3428202","index":211},"https://doi.org/10.1145/3428203":{"title":"Shankara Pailoor, Xinyu Wang, Hovav Shacham, Isil Dillig: Automated policy synthesis for system call sandboxing. 135:1-135:26","address":"https://doi.org/10.1145/3428203","index":212},"https://doi.org/10.1145/3428204":{"title":"Vytautas Astrauskas, Christoph Matheja, Federico Poli, Peter Müller, Alexander J. Summers: How do programmers use unsafe rust? 136:1-136:27","address":"https://doi.org/10.1145/3428204","index":213},"https://doi.org/10.1145/3428205":{"title":"Yu Wang, Ke Wang, Fengjuan Gao, Linzhang Wang: Learning semantic program embeddings with graph interval neural network. 137:1-137:27","address":"https://doi.org/10.1145/3428205","index":214},"https://doi.org/10.1145/3428206":{"title":"Breanna Devore-McDonald, Emery D. Berger: Mossad: defeating software plagiarism detection. 138:1-138:28","address":"https://doi.org/10.1145/3428206","index":215},"https://doi.org/10.1145/3428207":{"title":"Yizhou Zhang, Guido Salvaneschi, Andrew C. Myers: Handling bidirectional control flow. 139:1-139:30","address":"https://doi.org/10.1145/3428207","index":216},"https://doi.org/10.1145/3428208":{"title":"Steven Holtzen, Guy Van den Broeck, Todd D. Millstein: Scaling exact inference for discrete probabilistic programs. 140:1-140:31","address":"https://doi.org/10.1145/3428208","index":217},"https://doi.org/10.1145/3428209":{"title":"Aaron Bembenek, Michael Greenberg, Stephen Chong: Formulog: Datalog for SMT-based static analysis. 141:1-141:31","address":"https://doi.org/10.1145/3428209","index":218},"https://doi.org/10.1145/3428210":{"title":"Tongtong Xiang, Jeff Y. Luo, Werner Dietl: Precise inference of expressive units of measurement types. 142:1-142:28","address":"https://doi.org/10.1145/3428210","index":219},"https://doi.org/10.1145/3428211":{"title":"Hongyu Liu, Sam Silvestro, Xiangyu Zhang, Jian Huang, Tongping Liu: WATCHER: in-situ failure diagnosis. 143:1-143:27","address":"https://doi.org/10.1145/3428211","index":220},"https://doi.org/10.1145/3428212":{"title":"Thodoris Sotiropoulos, Stefanos Chaliasos, Dimitris Mitropoulos, Diomidis Spinellis: A model for detecting faults in build specifications. 144:1-144:30","address":"https://doi.org/10.1145/3428212","index":221},"https://doi.org/10.1145/3428213":{"title":"Sean Bartell, Will Dietz, Vikram S. Adve: Guided linking: dynamic linking without the costs. 145:1-145:29","address":"https://doi.org/10.1145/3428213","index":222},"https://doi.org/10.1145/3428214":{"title":"Hamed Gorjiara, Guoqing Harry Xu, Brian Demsky: Satune: synthesizing efficient SAT encoders. 146:1-146:32","address":"https://doi.org/10.1145/3428214","index":223},"https://doi.org/10.1145/3428215":{"title":"Shengjian Guo, Yueqi Chen, Jiyong Yu, Meng Wu, Zhiqiang Zuo, Peng Li, Yueqiang Cheng, Huibo Wang: Exposing cache timing side-channel leaks through out-of-order symbolic execution. 147:1-147:32","address":"https://doi.org/10.1145/3428215","index":224},"https://doi.org/10.1145/3428216":{"title":"Fangyi Zhou, Francisco Ferreira, Raymond Hu, Rumyana Neykova, Nobuko Yoshida: Statically verified refinements for multiparty protocols. 148:1-148:30","address":"https://doi.org/10.1145/3428216","index":225},"https://doi.org/10.1145/3428217":{"title":"Robert Griesemer, Raymond Hu, Wen Kokke, Julien Lange, Ian Lance Taylor, Bernardo Toninho, Philip Wadler, Nobuko Yoshida: Featherweight go. 149:1-149:29","address":"https://doi.org/10.1145/3428217","index":226},"https://doi.org/10.1145/3428218":{"title":"Gushu Li, Li Zhou, Nengkun Yu, Yufei Ding, Mingsheng Ying, Yuan Xie: Projection-based runtime assertions for testing and debugging Quantum programs. 150:1-150:29","address":"https://doi.org/10.1145/3428218","index":227},"https://doi.org/10.1145/3428219":{"title":"Azalea Raad, Ori Lahav, Viktor Vafeiadis: Persistent Owicki-Gries reasoning: a program logic for reasoning about persistent programs on Intel-x86. 151:1-151:28","address":"https://doi.org/10.1145/3428219","index":228},"https://doi.org/10.1145/3428220":{"title":"Christoph Sprenger, Tobias Klenze, Marco Eilers, Felix A. Wolf, Peter Müller, Martin Clochard, David A. Basin: Igloo: soundly linking compositional refinement and separation logic for distributed system verification. 152:1-152:31","address":"https://doi.org/10.1145/3428220","index":229},"https://doi.org/10.1145/3428221":{"title":"Konstantinos Kallas, Filip Niksic, Caleb Stanford, Rajeev Alur: DiffStream: differential output testing for stream processing programs. 153:1-153:29","address":"https://doi.org/10.1145/3428221","index":230},"https://doi.org/10.1145/3428222":{"title":"Magnus Madsen, Jaco van de Pol: Polymorphic types and effects with Boolean unification. 154:1-154:29","address":"https://doi.org/10.1145/3428222","index":231},"https://doi.org/10.1145/3428223":{"title":"David Castro-Perez, Nobuko Yoshida: CAMP: cost-aware multiparty session protocols. 155:1-155:30","address":"https://doi.org/10.1145/3428223","index":232},"https://doi.org/10.1145/3428224":{"title":"Cormac Flanagan, Stephen N. Freund: The anchor verifier for blocking and non-blocking concurrent software. 156:1-156:29","address":"https://doi.org/10.1145/3428224","index":233},"https://doi.org/10.1145/3428225":{"title":"Ramy Shahin, Marsha Chechik: Automatic and efficient variability-aware lifting of functional programs. 157:1-157:27","address":"https://doi.org/10.1145/3428225","index":234},"https://doi.org/10.1145/3428226":{"title":"Ryan Senanayake, Changwan Hong, Ziheng Wang, Amalee Wilson, Stephen Chou, Shoaib Kamil, Saman P. Amarasinghe, Fredrik Kjolstad: A sparse iteration space transformation framework for sparse tensor algebra. 158:1-158:30","address":"https://doi.org/10.1145/3428226","index":235},"https://doi.org/10.1145/3428227":{"title":"Hila Peleg, Roi Gabay, Shachar Itzhaky, Eran Yahav: Programming with a read-eval-synth loop. 159:1-159:30","address":"https://doi.org/10.1145/3428227","index":236},"https://doi.org/10.1145/3428228":{"title":"Umar Farooq, Zhijia Zhao, Manu Sridharan, Iulian Neamtiu: LiveDroid: identifying and preserving mobile app state in volatile runtime environments. 160:1-160:30","address":"https://doi.org/10.1145/3428228","index":237},"https://doi.org/10.1145/3428229":{"title":"Xiaohong Chen, Minh-Thai Trinh, Nishant Rodrigues, Lucas Peña, Grigore Rosu: Towards a unified proof framework for automated fixpoint reasoning using matching logic. 161:1-161:29","address":"https://doi.org/10.1145/3428229","index":238},"https://doi.org/10.1145/3428230":{"title":"Noam Yefet, Uri Alon, Eran Yahav: Adversarial examples for models of code. 162:1-162:30","address":"https://doi.org/10.1145/3428230","index":239},"https://doi.org/10.1145/3428231":{"title":"Milijana Surbatovich, Brandon Lucia, Limin Jia: Towards a formal foundation of intermittent computing. 163:1-163:31","address":"https://doi.org/10.1145/3428231","index":240},"https://doi.org/10.1145/3428232":{"title":"Guannan Wei, Oliver Bracevac, Shangyin Tan, Tiark Rompf: Compiling symbolic execution with staging and algebraic effects. 164:1-164:33","address":"https://doi.org/10.1145/3428232","index":241},"https://doi.org/10.1145/3428233":{"title":"Hengchu Zhang, Edo Roth, Andreas Haeberlen, Benjamin C. Pierce, Aaron Roth: Testing differential privacy with dual interpreters. 165:1-165:26","address":"https://doi.org/10.1145/3428233","index":242},"https://doi.org/10.1145/3428234":{"title":"Julie L. Newcomb, Andrew Adams, Steven Johnson, Rastislav Bodík, Shoaib Kamil: Verifying and improving Halide's term rewriting system with program synthesis. 166:1-166:28","address":"https://doi.org/10.1145/3428234","index":243},"https://doi.org/10.1145/3428235":{"title":"Gabriel Poesia, Fernando Magno Quintão Pereira: Dynamic dispatch of context-sensitive optimizations. 167:1-167:28","address":"https://doi.org/10.1145/3428235","index":244},"https://doi.org/10.1145/3428236":{"title":"Anders Møller, Oskar Haarklou Veileborg: Eliminating abstraction overhead of Java stream pipelines using ahead-of-time program optimization. 168:1-168:29","address":"https://doi.org/10.1145/3428236","index":245},"https://doi.org/10.1145/3428237":{"title":"Sarah Spall, Neil Mitchell, Sam Tobin-Hochstadt: Build scripts with perfect dependencies. 169:1-169:28","address":"https://doi.org/10.1145/3428237","index":246},"https://doi.org/10.1145/3428238":{"title":"John K. Feser, Sam Madden, Nan Tang, Armando Solar-Lezama: Deductive optimization of relational data storage. 170:1-170:30","address":"https://doi.org/10.1145/3428238","index":247},"https://doi.org/10.1145/3428239":{"title":"Joshua Clune, Vijay Ramamurthy, Ruben Martins, Umut A. Acar: Program equivalence for assisted grading of functional programs. 171:1-171:29","address":"https://doi.org/10.1145/3428239","index":248},"https://doi.org/10.1145/3428240":{"title":"Martin Avanzini, Georg Moser, Michael Schaper: A modular cost analysis for probabilistic programs. 172:1-172:30","address":"https://doi.org/10.1145/3428240","index":249},"https://doi.org/10.1145/3428241":{"title":"Dietrich Geisler, Irene Yoon, Aditi Kabra, Horace He, Yinnon Sanders, Adrian Sampson: Geometry types for graphics programming. 173:1-173:25","address":"https://doi.org/10.1145/3428241","index":250},"https://doi.org/10.1145/3428242":{"title":"Zhefeng Wu, Zhe Sun, Kai Gong, Lingyun Chen, Bin Liao, Yihua Jin: Hidden inheritance: an inline caching design for TypeScript performance. 174:1-174:29","address":"https://doi.org/10.1145/3428242","index":251},"https://doi.org/10.1145/3428243":{"title":"Fengyun Liu, Ondrej Lhoták, Aggelos Biboudis, Paolo G. Giarrusso, Martin Odersky: A type-and-effect system for object initialization. 175:1-175:28","address":"https://doi.org/10.1145/3428243","index":252},"https://doi.org/10.1145/3428244":{"title":"Subarno Banerjee, David Devecsery, Peter M. Chen, Satish Narayanasamy: Sound garbage collection for C using pointer provenance. 176:1-176:28","address":"https://doi.org/10.1145/3428244","index":253},"https://doi.org/10.1145/3428245":{"title":"Manasij Mukherjee, Pranav Kant, Zhengyang Liu, John Regehr: Dataflow-based pruning for speeding up superoptimization. 177:1-177:24","address":"https://doi.org/10.1145/3428245","index":254},"https://doi.org/10.1145/3428246":{"title":"Ana Milanova: FlowCFL: generalized type-based reachability analysis: graph reduction and equivalence of CFL-based and type-based reachability. 178:1-178:29","address":"https://doi.org/10.1145/3428246","index":255},"https://doi.org/10.1145/3428247":{"title":"Minseok Jeon, Myungho Lee, Hakjoo Oh: Learning graph-based heuristics for pointer analysis without handcrafting application-specific features. 179:1-179:30","address":"https://doi.org/10.1145/3428247","index":256},"https://doi.org/10.1145/3428248":{"title":"Arjen Rouvoet, Hendrik van Antwerpen, Casper Bach Poulsen, Robbert Krebbers, Eelco Visser: Knowing when to ask: sound scheduling of name resolution in type checkers derived from declarative specifications. 180:1-180:28","address":"https://doi.org/10.1145/3428248","index":257},"https://doi.org/10.1145/3428249":{"title":"Alexi Turcotte, Aviral Goel, Filip Krikava, Jan Vitek: Designing types for R, empirically. 181:1-181:25","address":"https://doi.org/10.1145/3428249","index":258},"https://doi.org/10.1145/3428250":{"title":"Aayan Kumar, Vivek Seshadri, Rahul Sharma: Shiftry: RNN inference in 2KB of RAM. 182:1-182:30","address":"https://doi.org/10.1145/3428250","index":259},"https://doi.org/10.1145/3428251":{"title":"Lingkun Kong, Konstantinos Mamouras: StreamQL: a query language for processing streaming time series. 183:1-183:32","address":"https://doi.org/10.1145/3428251","index":260},"https://doi.org/10.1145/3428252":{"title":"Qianshan Yu, Fei He, Bow-Yaw Wang: Incremental predicate analysis for regression verification. 184:1-184:25","address":"https://doi.org/10.1145/3428252","index":261},"https://doi.org/10.1145/3428253":{"title":"Caterina Urban, Maria Christakis, Valentin Wüstholz, Fuyuan Zhang: Perfectly parallel fairness certification of neural networks. 185:1-185:30","address":"https://doi.org/10.1145/3428253","index":262},"https://doi.org/10.1145/3428254":{"title":"Quentin Stiévenart, Magnus Madsen: Fuzzing channel-based concurrency runtimes using types and effects. 186:1-186:27","address":"https://doi.org/10.1145/3428254","index":263},"https://doi.org/10.1145/3428255":{"title":"Anders Møller, Benjamin Barslev Nielsen, Martin Toldam Torp: Detecting locations in JavaScript programs affected by breaking library changes. 187:1-187:25","address":"https://doi.org/10.1145/3428255","index":264},"https://doi.org/10.1145/3428256":{"title":"Mirko Köhler, Nafise Eskandani, Pascal Weisenburger, Alessandro Margara, Guido Salvaneschi: Rethinking safe consistency in distributed object-oriented programming. 188:1-188:30","address":"https://doi.org/10.1145/3428256","index":265},"https://doi.org/10.1145/3428257":{"title":"Ton Chanh Le, Timos Antonopoulos, Parisa Fathololumi, Eric Koskinen, ThanhVu Nguyen: DynamiTe: dynamic termination and non-termination proofs. 189:1-189:30","address":"https://doi.org/10.1145/3428257","index":266},"https://doi.org/10.1145/3428258":{"title":"Sifis Lagouvardos, Neville Grech, Ilias Tsatiris, Yannis Smaragdakis: Precise static modeling of Ethereum \"memory\". 190:1-190:26","address":"https://doi.org/10.1145/3428258","index":267},"https://doi.org/10.1145/3428259":{"title":"John Peter Campora III, Sheng Chen: Taming type annotations in gradual typing. 191:1-191:30","address":"https://doi.org/10.1145/3428259","index":268},"https://doi.org/10.1145/3428260":{"title":"Minh-Thai Trinh, Duc-Hiep Chu, Joxan Jaffar: Inter-theory dependency analysis for SMT string solvers. 192:1-192:27","address":"https://doi.org/10.1145/3428260","index":269},"https://doi.org/10.1145/3428261":{"title":"Dominik Winterer, Chengyu Zhang, Zhendong Su: On the unusual effectiveness of type-aware operator mutations for testing SMT solvers. 193:1-193:25","address":"https://doi.org/10.1145/3428261","index":270},"https://doi.org/10.1145/3428262":{"title":"Radha Jagadeesan, Alan Jeffrey, James Riely: Pomsets with preconditions: a simple model of relaxed memory. 194:1-194:30","address":"https://doi.org/10.1145/3428262","index":271},"https://doi.org/10.1145/3428263":{"title":"Tobias Grosser, Theodoros Theodoridis, Maximilian Falkenstein, Arjun Pitchanathan, Michael Kruse, Manuel Rigger, Zhendong Su, Torsten Hoefler: Fast linear programming through transprecision computing on small and sparse data. 195:1-195:28","address":"https://doi.org/10.1145/3428263","index":272},"https://doi.org/10.1145/3428264":{"title":"Vsevolod Livinskii, Dmitry Babokin, John Regehr: Random testing for C and C++ compilers with YARPGen. 196:1-196:25","address":"https://doi.org/10.1145/3428264","index":273},"https://doi.org/10.1145/3428265":{"title":"Yuting Wang, Xiangzhe Xu, Pierre Wilke, Zhong Shao: CompCertELF: verified separate compilation of C programs into ELF object files. 197:1-197:28","address":"https://doi.org/10.1145/3428265","index":274},"https://doi.org/10.1145/3428266":{"title":"Bo Sang, Patrick Eugster, Gustavo Petri, Srivatsan Ravi, Pierre-Louis Roman: Scalable and serializable networked multi-actor programming. 198:1-198:30","address":"https://doi.org/10.1145/3428266","index":275},"https://doi.org/10.1145/3428267":{"title":"Fei He, Jitao Han: Termination analysis for evolving programs: an incremental approach by reusing certified modules. 199:1-199:27","address":"https://doi.org/10.1145/3428267","index":276},"https://doi.org/10.1145/3428268":{"title":"Eric Atkinson, Michael Carbin: Programming and reasoning with partial observability. 200:1-200:28","address":"https://doi.org/10.1145/3428268","index":277},"https://doi.org/10.1145/3428269":{"title":"Ivan Gavran, Eva Darulova, Rupak Majumdar: Interactive synthesis of temporal specifications from examples and natural language. 201:1-201:26","address":"https://doi.org/10.1145/3428269","index":278},"https://doi.org/10.1145/3428270":{"title":"Wing Lam, Stefan Winter, Anjiang Wei, Tao Xie, Darko Marinov, Jonathan Bell: A large-scale longitudinal study of flaky tests. 202:1-202:29","address":"https://doi.org/10.1145/3428270","index":279},"https://doi.org/10.1145/3428271":{"title":"Hailong Zhang, Yu Hao, Sufian Latif, Raef Bassily, Atanas Rountev: Differentially-private software frequency profiling under linear constraints. 203:1-203:24","address":"https://doi.org/10.1145/3428271","index":280},"https://doi.org/10.1145/3428272":{"title":"Alejandro Gómez-Londoño, Johannes Åman Pohjola, Hira Taqdees Syeda, Magnus O. Myreen, Yong Kiam Tan: Do you have space for dessert? a verified space cost semantics for CakeML programs. 204:1-204:29","address":"https://doi.org/10.1145/3428272","index":281},"https://doi.org/10.1145/3428273":{"title":"Michael B. James, Zheng Guo, Ziteng Wang, Shivani Doshi, Hila Peleg, Ranjit Jhala, Nadia Polikarpova: Digging for fold: synthesis-aided API discovery for Haskell. 205:1-205:27","address":"https://doi.org/10.1145/3428273","index":282},"https://doi.org/10.1145/3428274":{"title":"Koar Marntirosian, Tom Schrijvers, Bruno C. d. S. Oliveira, Georgios Karachalias: Resolution as intersection subtyping via Modus Ponens. 206:1-206:30","address":"https://doi.org/10.1145/3428274","index":283},"https://doi.org/10.1145/3428275":{"title":"Julia Belyakova, Benjamin Chung, Jack Gelinas, Jameson Nash, Ross Tate, Jan Vitek: World age in Julia: optimizing method dispatch in the presence of eval. 207:1-207:26","address":"https://doi.org/10.1145/3428275","index":284},"https://doi.org/10.1145/3428276":{"title":"Ifaz Kabir, Yufeng Li, Ondrej Lhoták: ιDOT: a DOT calculus with object initialization. 208:1-208:28","address":"https://doi.org/10.1145/3428276","index":285},"https://doi.org/10.1145/3428277":{"title":"Elvira Albert, Shelly Grossman, Noam Rinetzky, Clara Rodríguez-Núñez, Albert Rubio, Mooly Sagiv: Taming callbacks for smart contract modularity. 209:1-209:30","address":"https://doi.org/10.1145/3428277","index":286},"https://doi.org/10.1145/3428278":{"title":"Cezara Dragoi, Constantin Enea, Burcu Kulahcioglu Ozkan, Rupak Majumdar, Filip Niksic: Testing consensus implementations using communication closure. 210:1-210:29","address":"https://doi.org/10.1145/3428278","index":287},"https://doi.org/10.1145/3428279":{"title":"Manuel Rigger, Zhendong Su: Finding bugs in database systems via query partitioning. 211:1-211:30","address":"https://doi.org/10.1145/3428279","index":288},"https://doi.org/10.1145/3428280":{"title":"Sumit Gulwani, Vu Le, Arjun Radhakrishna, Ivan Radicek, Mohammad Raza: Structure interpretation of text formats. 212:1-212:29","address":"https://doi.org/10.1145/3428280","index":289},"https://doi.org/10.1145/3428281":{"title":"Cezara Dragoi, Josef Widder, Damien Zufferey: Programming at the edge of synchrony. 213:1-213:30","address":"https://doi.org/10.1145/3428281","index":290},"https://doi.org/10.1145/3428282":{"title":"Mehdi Bagherzadeh, Nicholas Fireman, Anas Shawesh, Raffi Khatchadourian: Actor concurrency bugs: a comprehensive study on symptoms, root causes, API usages, and differences. 214:1-214:32","address":"https://doi.org/10.1145/3428282","index":291},"https://doi.org/10.1145/3428283":{"title":"Shaked Brody, Uri Alon, Eran Yahav: A structural model for contextual code changes. 215:1-215:28","address":"https://doi.org/10.1145/3428283","index":292},"https://doi.org/10.1145/3428284":{"title":"Yiyun Liu, James Parker, Patrick Redmond, Lindsey Kuper, Michael Hicks, Niki Vazou: Verifying replicated data types with typeclass refinements in Liquid Haskell. 216:1-216:30","address":"https://doi.org/10.1145/3428284","index":293},"https://doi.org/10.1145/3428285":{"title":"Pengyu Nie, Marinela Parovic, Zhiqiang Zang, Sarfraz Khurshid, Aleksandar Milicevic, Milos Gligoric: Unifying execution of imperative generators and declarative specifications. 217:1-217:26","address":"https://doi.org/10.1145/3428285","index":294},"https://doi.org/10.1145/3428286":{"title":"Lenka Turonová, Lukás Holík, Ondrej Lengál, Olli Saarikivi, Margus Veanes, Tomás Vojnar: Regex matching with counting-set automata. 218:1-218:30","address":"https://doi.org/10.1145/3428286","index":295},"https://doi.org/10.1145/3428287":{"title":"Xiang Gao, Shraddha Barke, Arjun Radhakrishna, Gustavo Soares, Sumit Gulwani, Alan Leung, Nachiappan Nagappan, Ashish Tiwari: Feedback-driven semi-supervised synthesis of program transformations. 219:1-219:30","address":"https://doi.org/10.1145/3428287","index":296},"https://doi.org/10.1145/3428288":{"title":"Olivier Flückiger, Guido Chari, Ming-Ho Yee, Jan Jecmen, Jakob Hain, Jan Vitek: Contextual dispatch for function specialization. 220:1-220:24","address":"https://doi.org/10.1145/3428288","index":297},"https://doi.org/10.1145/3428289":{"title":"Shubhani Gupta, Abhishek Rose, Sorav Bansal: Counterexample-guided correlation algorithm for translation validation. 221:1-221:29","address":"https://doi.org/10.1145/3428289","index":298},"https://doi.org/10.1145/3428290":{"title":"Leif Andersen, Michael Ballantyne, Matthias Felleisen: Adding interactive visual syntax to textual code. 222:1-222:28","address":"https://doi.org/10.1145/3428290","index":299},"https://doi.org/10.1145/3428291":{"title":"Yaoda Zhou, Bruno C. d. S. Oliveira, Jinxu Zhao: Revisiting iso-recursive subtyping. 223:1-223:28","address":"https://doi.org/10.1145/3428291","index":300},"https://doi.org/10.1145/3428292":{"title":"Ruyi Ji, Yican Sun, Yingfei Xiong, Zhenjiang Hu: Guiding dynamic programing via structural probability for accelerating programming by example. 224:1-224:29","address":"https://doi.org/10.1145/3428292","index":301},"https://doi.org/10.1145/3428293":{"title":"Yaniv David, Uri Alon, Eran Yahav: Neural reverse engineering of stripped binaries using augmented control flow graphs. 225:1-225:28","address":"https://doi.org/10.1145/3428293","index":302},"https://doi.org/10.1145/3428294":{"title":"Jake Kirkham, Tyler Sorensen, Esin Tureci, Margaret Martonosi: Foundations of empirical memory consistency testing. 226:1-226:29","address":"https://doi.org/10.1145/3428294","index":303},"https://doi.org/10.1145/3428295":{"title":"Shraddha Barke, Hila Peleg, Nadia Polikarpova: Just-in-time learning for bottom-up enumerative synthesis. 227:1-227:29","address":"https://doi.org/10.1145/3428295","index":304},"https://doi.org/10.1145/3428296":{"title":"Jenna Wise, Johannes Bader, Cameron Wong, Jonathan Aldrich, Éric Tanter, Joshua Sunshine: Gradual verification of recursive heap data structures. 228:1-228:28","address":"https://doi.org/10.1145/3428296","index":305},"https://doi.org/10.1145/3428297":{"title":"Michael Ballantyne, Alexis King, Matthias Felleisen: Macros for domain-specific languages. 229:1-229:29","address":"https://doi.org/10.1145/3428297","index":306},"https://doi.org/10.1145/3428298":{"title":"Suvam Mukherjee, Pantazis Deligiannis, Arpita Biswas, Akash Lal: Learning-based controlled concurrency testing. 230:1-230:31","address":"https://doi.org/10.1145/3428298","index":307},"https://doi.org/10.1145/3428299":{"title":"Emily First, Yuriy Brun, Arjun Guha: TacTok: semantics-aware proof synthesis. 231:1-231:31","address":"https://doi.org/10.1145/3428299","index":308},"https://doi.org/10.1145/3428300":{"title":"Ritwika Ghosh, Chiao Hsieh, Sasa Misailovic, Sayan Mitra: Koord: a language for programming and verifying distributed robotics application. 232:1-232:30","address":"https://doi.org/10.1145/3428300","index":309},"https://doi.org/10.1145/3428301":{"title":"Yulei Sui, Xiao Cheng, Guanqin Zhang, Haoyu Wang: Flow2Vec: value-flow-based precise code embedding. 233:1-233:27","address":"https://doi.org/10.1145/3428301","index":310},"index":6}