Proceedings of the ACM on Programming Languages 2019: all accepted papers
- Weakening WebAssembly ↗Conrad Watt, Andreas Rossberg, Jean Pichon-Pharabod31 citations
- LWeb: information flow security for multi-tier web applications ↗James Parker, Niki Vazou, Michael Hicks29 citations
- Quantitative robustness analysis of quantum programs ↗Shih-Han Hung, Kesha Hietala, Shaopeng Zhu et al.29 citations
- Relational proofs for quantum programs ↗Gilles Barthe, Justin Hsu, Mingsheng Ying et al.29 citations
- System FR: formalized foundations for the stainless verifier ↗Jad Hamza, Nicolas Voirol, Viktor Kunčak29 citations
- Trace types and denotational semantics for sound programmable inference in probabilistic languages ↗Alexander K. Lew, Marco Cusumano-Towner, Benjamin Sherman et al.29 citations
- Bayesian synthesis of probabilistic programs for automatic data modeling ↗Feras A. Saad, Marco Cusumano-Towner, Ulrich Schaechtle et al.28 citations
- Game semantics for quantum programming ↗Pierre Clairambault, Marc de Visme, Glynn Winskel28 citations
- Narcissus: correct-by-construction derivation of decoders and encoders from binary formats ↗Benjamin Delaware, Sorawit Suriyakarn, Clément Pit-Claudel et al.28 citations
- BDA: practical dependence analysis for binary executables by unbiased whole-program path sampling and per-path abstract interpretation ↗Zhuo Zhang, Wei You, Guanhong Tao et al.27 citations
- Formal verification of higher-order probabilistic programs: reasoning about approximation, convergence, Bayesian inference, and optimization ↗Tetsuya Sato, Alejandro Aguirre, Gilles Barthe et al.27 citations
- A true positives theorem for a static race detector ↗Nikos Gorogiannis, Peter W. O’Hearn, Ilya Sergey26 citations
- Abstract extensionality: on the properties of incomplete abstract interpretations ↗Roberto Bruni, Roberto Giacobazzi, Roberta Gori B et al.26 citations
- Gradual type theory ↗Max S. New, Daniel R. Licata, Amal Ahmed26 citations
- Skeletal semantics and their interpretations ↗Martin Bodin, Philippa Gardner, Thomas Wiben Jensen et al.26 citations
- Sound and robust solid modeling via exact real arithmetic and continuity ↗Benjamin Sherman, Jesse Michel, Michael Carbin26 citations
- The high-level benefits of low-level sandboxing ↗Michael Sammler, Deepak Garg, Derek R. Dreyer et al.26 citations
- Full abstraction for the quantum lambda-calculus ↗Pierre Clairambault, Marc de Visme25 citations
- I/O dependent idempotence bugs in intermittent systems ↗Milijana Surbatovich, Limin Jia, Brandon Lucia25 citations
- JaVerT 2.0: compositional symbolic execution for JavaScript ↗José Fragoso Santos, Petar Maksimović, Gabriela Cunha Sampaio et al.25 citations
- A²I: abstract² interpretation ↗Patrick M. Cousot, Roberto Giacobazzi, Francesco Ranzato24 citations
- Backpropagation in the simply typed lambda-calculus with linear negation ↗Aloïs Brunel, Damiano Mazza, Michele Pagani24 citations
- ApproxHPVM: a portable compiler IR for accuracy-aware optimizations ↗Hashim Sharif, Prakalp Srivastava, Muhammad Huzaifa et al.23 citations
- Efficient parameterized algorithms for data packing ↗Krishnendu Chatterjee, Amir Kafshdar Goharshady, Nastaran Okati et al.23 citations
- Mechanized relational verification of concurrent programs with continuations ↗Amin Timany, Lars Birkedal23 citations
- Sound and complete bidirectional typechecking for higher-rank polymorphism with existentials and indexed types ↗Jana Dunfield, Neelakantan R. Krishnaswami23 citations
- Value-centric dynamic partial order reduction ↗Krishnendu Chatterjee, Andreas Pavlogiannis, Viktor Toman23 citations
- Mechanized semantics and verified compilation for a dataflow synchronous language with reset ↗Timothy Bourke, Lélio Brun, Marc Pouzet22 citations
- Trace aware random testing for distributed systems ↗Burcu Kulahcioglu Ozkan, Rupak Majumdar, Simin Oraee22 citations
- Certifying graph-manipulating C programs via localizations within data structures ↗Shengyi Wang, Qinxiang Cao, Anshuman Mohan et al.21 citations
- Dynamic type inference for gradual Hindley–Milner typing ↗Yusuke Miyazaki, Taro Sekiyama, Atsushi Igarashi21 citations
- Executable formal semantics for the POSIX shell ↗Michael Greenberg, Austin J. Blatt21 citations
- Reductions for safety proofs ↗Azadeh Farzan, Anthony Vandikas21 citations
- Towards verified stochastic variational inference for probabilistic programs ↗Wonyeol Lee, Hangyeol Yu, Xavier Rival et al.21 citations
- Closure conversion is safe for space ↗Zoe Paraskevopoulou, Andrew W. Appel20 citations
- Fuzzi: a three-level logic for differential privacy ↗Hengchu Zhang, Edo Roth, Andreas Haeberlen et al.20 citations
- Modular quantitative monitoring ↗Rajeev Alur, Konstantinos Mamouras, Caleb Stanford20 citations
- Recurrence extraction for functional programs through call-by-push-value ↗G. A. Kavvos, Edward Morehouse, Daniel R. Licata et al.20 citations
- Refinement of path expressions for static analysis ↗John Cyphert, Jason Breck, Zachary Kincaid et al.20 citations
- Staged abstract interpreters: fast and modular whole-program analysis via meta-programming ↗Guannan Wei, Yuxuan Chen, Tiark Rompf20 citations
- Weak-consistency specification via visibility relaxation ↗Michael Emmi, Constantin Enea20 citations
- A formalization of Java’s concurrent access modes ↗John Bender, Jens Palsberg19 citations
- Disentanglement in nested-parallel programs ↗Sam Westrick, Rohan Yadav, Matthew T. Fluet et al.19 citations
- Effective lock handling in stateless model checking ↗Michalis Kokologiannakis, Azalea Raad, Viktor Vafeiadis19 citations
- Relational verification using reinforcement learning ↗Jia Chen, Jiayi Wei, Yu Feng et al.19 citations
- Seq: a high-performance language for bioinformatics ↗Ariya Shajii, Ibrahim Numanagić, Riyadh Baghdadi et al.19 citations
- Simply RaTT: a fitch-style modal calculus for reactive programming without space leaks ↗Patrick Bahr, Christian Uldal Graulund, Rasmus Ejlers Møgelberg19 citations
- A predicate transformer semantics for effects (functional pearl) ↗Wouter Swierstra, Tim Baanen18 citations
- Approximate normalization for gradual dependent types ↗Joseph Eremondi, Éric Tanter, Ronald Garcia18 citations
- Compiling with continuations, or without? whatever. ↗Youyou Cong, Leo Osvald, Grégory M. Essertel et al.18 citations
- Iron: managing obligations in higher-order concurrent separation logic ↗Aleš Bizjak, Daniel Gratzer, Robbert Krebbers et al.18 citations
- Linear capabilities for fully abstract compilation of separation-logic-verified code ↗Thomas Van Strydonck, Frank Piessens, Dominique Devriese18 citations
- Bindings as bounded natural functors ↗Jasmin Christian Blanchette, Lorenzo Gheri, Andrei Popescu et al.17 citations
- Decidable verification of uninterpreted programs ↗Umang Mathur, P. Madhusudan, Mahesh Viswanathan17 citations
- Fixpoint games on continuous lattices ↗Paolo Baldan, Barbara König, Christina Mika-Michalski et al.17 citations
- Specifying concurrent programs in separation logic: morphisms and simulations ↗Aleksandar Nanevski, Anindya Banerjee, Germán Andrés Delbianco et al.17 citations
- SyTeCi: automating contextual equivalence for higher-order programs with references ↗Guilhem Jaber17 citations
- Synthesizing symmetric lenses ↗Anders Miltner, Solomon Maina, Kathleen Fisher et al.17 citations
- Two sides of the same coin: session types and game semantics: a synchronous side and an asynchronous side ↗Simon Castellan, Nobuko Yoshida17 citations
- Virtual timeline: a formal abstraction for verifying preemptive schedulers with temporal isolation ↗Mengqi Liu, Lionel Rieg, Zhong Shao et al.17 citations
- A reasonably exceptional type theory ↗Pierre-Marie Pédrot, Nicolas Tabareau, Hans Jacob Fehrmann et al.16 citations
- Automatic and scalable detection of logical errors in functional programming assignments ↗Dowon Song, Myungho Lee, Hakjoo Oh16 citations
- Bisimulation as path type for guarded recursive types ↗Rasmus Ejlers Møgelberg, Niccolò Veltrì16 citations
- From fine- to coarse-grained dynamic information flow control and back ↗Marco Vassena, Alejandro Russo, Deepak Garg et al.16 citations
- Modular verification of web page layout ↗Pavel Panchekha, Michael D. Ernst, Zachary Tatlock et al.16 citations
- The weak call-by-value λ-calculus is reasonable for both time and space ↗Yannick Forster, Fabian Kunze, Marc Roth16 citations
- Trace abstraction modulo probability ↗Calvin Smith, Justin Hsu, Aws Albarghouthi16 citations
- A fault-tolerant programming model for distributed interactive applications ↗Ragnar Mogk, Joscha Drechsler, Guido Salvaneschi et al.15 citations
- Dependence-aware, unbounded sound predictive race detection ↗Kaan Genç, Jake Roemer, XU Yu-fan et al.15 citations
- Parameterized verification under TSO is PSPACE-complete ↗Parosh Aziz Abdulla, Mohamed Faouzi Atig, Rojin Rezvan15 citations
- Seminaïve evaluation for a higher-order functional language ↗Michael Arntzenius, Neel Krishnaswami15 citations
- Spy game: verifying a local generic solver in Iris ↗Paulo Emílio de Vilhena, François Pottier, Jacques-Henri Jourdan15 citations
- Static analysis with demand-driven value refinement ↗B. Stein, Benjamin Barslev Nielsen, Bor-Yuh Evan Chang et al.15 citations
- Taylor subsumes Scott, Berry, Kahn and Plotkin ↗Davide Barbarossa, Giulio Manzonetto15 citations
- Teaching the art of functional programming using automated grading (experience report) ↗Aliya Hameer, Brigitte Pientka15 citations
- CLOTHO: directed test generation for weakly consistent database systems ↗Kia Rahmani, Kartik Nagar, Benjamin Delaware et al.14 citations
- Call-by-need is clairvoyant call-by-value ↗Jennifer Hackett, Graham Hutton14 citations
- Label-dependent session types ↗Peter J. Thiemann, VASCO THUDICHUM VASCONCELOS14 citations
- Mixed linear and non-linear recursive types ↗Bert Lindenhovius, Michael W. Mislove, Vladimir Zamdzhiev14 citations
- Probabilistic programming with densities in SlicStan: efficient, flexible, and deterministic ↗Maria I. Gorinova, Andrew D. Gordon, Charles Sutton14 citations
- Proving expected sensitivity of probabilistic programs with randomized variable-dependent termination time ↗Peixin Wang, Hongfei Fu, Krishnendu Chatterjee et al.14 citations
- Selective applicative functors ↗Andrey Mokhov, Georgy Lukyanov, Simon Marlow et al.14 citations
- Sound and reusable components for abstract interpretation ↗Sven Keidel, Sebastian Thore Erdweg14 citations
- Synthesizing replacement classes ↗Malavika Samak, Deokhwan Kim, Martin Rinard14 citations
- Concerto: a framework for combined concrete and abstract interpretation ↗John Toman, Dan Grossman13 citations
- Decidable subtyping for path dependent types ↗Julian Mackay, Alex Potanin, Jonathan Aldrich et al.13 citations
- Sequential programming for replicated data stores ↗Nicholas V. Lewchenko, Arjun Radhakrishna, Akash Gaonkar et al.13 citations
- Simple noninterference from parametricity ↗Maximilian Algehed, Jean-Philippe Bernardy13 citations
- Synthesizing differentially private programs ↗Calvin Smith, Aws Albarghouthi13 citations
- Type-guided worst-case input generation ↗Di Wang, Jan Hoffmann13 citations
- A language for probabilistically oblivious computation ↗David Darais, Ian Sweet, Chang Liu et al.12 citations
- A mechanical formalization of higher-ranked polymorphic type inference ↗Jinxu Zhao, Bruno C. d. S. Oliveira, Tom Schrijvers12 citations
- A path to DOT: formalizing fully path-dependent types ↗Marianna Rapoport, Ondřej Lhoták12 citations
- A role for dependent types in Haskell ↗Stephanie Weirich, Pritam Choudhury, Antoine Voizard et al.12 citations
- AL: autogenerating supervised learning programs ↗José Cambronero, Martin Rinard12 citations
- Casting about in the dark: an empirical study of cast operations in Java programs ↗Luis Mastrangelo, Matthias Hauswirth, Nathaniel Nystrom12 citations
- Categorical combinatorics of scheduling and synchronization in game semantics ↗Paul-André Melliès12 citations
- Complexity and information in invariant inference ↗Yotam M. Y. Feldman, Neil Immerman, Mooly Sagiv et al.12 citations
- Decoupling lock-free data structures from memory reclamation for static analysis ↗Roland Meyer, Sebastian Wolff12 citations
- Deductive verification with ghost monitors ↗Martin Clochard, Claude Marché, Andrei Paskevich12 citations
This page in Markdown → https://md.research.elamur.ai/free/en/venues/proceedings-of-the-acm-on-programming-languages/2019/papers/page/2/