default search action
Proceedings of the ACM on Programming Languages, Volume 3
Volume 3, Number POPL, January 2019
- Evan Cavallo
, Robert Harper:
Higher inductive types in cubical computational type theory. 1:1-1:27 - Ambrus Kaposi
Constructing quotient inductive-inductive types. 2:1-2:24 - Gaëtan Gilbert, Jesper Cockx, Matthieu Sozeau, Nicolas Tabareau:
Definitional proof-irrelevance without K. 3:1-3:28 - Rasmus Ejlers Møgelberg
Bisimulation as path type for guarded recursive types. 4:1-4:29 - Yizhou Zhang
Abstraction-safe effect handlers via tunneling. 5:1-5:29 - Dariusz Biernacki
Abstracting algebraic effects. 6:1-6:28 - Ugo Dal Lago, Marc de Visme, Damiano Mazza, Akira Yoshimizu:
Intersection types and runtime errors in the pi-calculus. 7:1-7:29 - Andrej Dudenhefner
Principality and approximation under dimensional bound. 8:1-8:29 - Jana Dunfield, Neelakantan R. Krishnaswami:
Sound and complete bidirectional typechecking for higher-rank polymorphism with existentials and indexed types. 9:1-9:28 - Karl Crary:
Fully abstract module compilation. 10:1-10:29 - Gyunghee Park, Jaemin Hong
Polymorphic symmetric multiple dispatch with variance. 11:1-11:28 - J. Garrett Morris
Abstracting extensible data types: or, rows by any other name. 12:1-12:28 - Di Wang
Type-guided worst-case input generation. 13:1-13:30 - Cyrus Omar, Ian Voysey
Live functional programming with typed holes. 14:1-14:32 - Max S. New, Daniel R. Licata, Amal Ahmed
Gradual type theory. 15:1-15:31 - Giuseppe Castagna
Gradual typing: a new perspective. 16:1-16:32 - Matías Toro
Gradual parametricity, revisited. 17:1-17:30 - Yusuke Miyazaki
Dynamic type inference for gradual Hindley-Milner typing. 18:1-18:29 - Lau Skorstengaard, Dominique Devriese
StkTokens: enforcing well-bracketed control flow and stack encapsulation using linear capabilities. 19:1-19:28 - G. A. Kavvos
Modalities, cohesion, and information flow. 20:1-20:29 - Tom Hirschowitz
Familial monads and structural operational semantics. 21:1-21:28 - Jasmin Christian Blanchette
Bindings as bounded natural functors. 22:1-22:34 - Paul-André Melliès
Categorical combinatorics of scheduling and synchronization in game semantics. 23:1-23:30 - Wen Kokke, Fabrizio Montesi
Better late than never: a fully-abstract semantics for classical processes. 24:1-24:29 - Filippo Bonchi, Joshua Holland, Robin Piedeleu, Pawel Sobocinski, Fabio Zanasi
Diagrammatic algebra: from linear to concurrent systems. 25:1-25:28 - Paolo Baldan, Barbara König, Christina Mika-Michalski, Tommaso Padoan:
Fixpoint games on continuous lattices. 26:1-26:29 - Simon Castellan, Nobuko Yoshida
Two sides of the same coin: session types and game semantics: a synchronous side and an asynchronous side. 27:1-27:29 - Simon Fowler
Exceptional asynchronous session types: session types without tiers. 28:1-28:29 - David Castro-Perez, Raymond Hu
Distributed programming using role-parametric session types in go: statically-typed endpoint APIs for dynamically-instantiated communication structures. 29:1-29:30 - Alceste Scalas
Less is more: multiparty session types revisited. 30:1-30:29 - Shih-Han Hung, Kesha Hietala
Quantitative robustness analysis of quantum programs. 31:1-31:29 - Pierre Clairambault, Marc de Visme, Glynn Winskel:
Game semantics for quantum programming. 32:1-32:29 - Dominique Unruh:
Quantum relational Hoare logic. 33:1-33:31 - Kevin Batz, Benjamin Lucien Kaminski
Quantitative separation logic: a logic for reasoning about probabilistic pointer programs. 34:1-34:29 - Maria I. Gorinova, Andrew D. Gordon, Charles Sutton:
Probabilistic programming with densities in SlicStan: efficient, flexible, and deterministic. 35:1-35:30 - Matthijs Vákár
A domain theory for statistical probabilistic programming. 36:1-36:29 - Feras A. Saad
Bayesian synthesis of probabilistic programs for automatic data modeling. 37:1-37:32 - Tetsuya Sato, Alejandro Aguirre
Formal verification of higher-order probabilistic programs: reasoning about approximation, convergence, Bayesian inference, and optimization. 38:1-38:30 - Calvin Smith, Justin Hsu
Trace abstraction modulo probability. 39:1-39:31 - Uri Alon, Meital Zilberstein, Omer Levy, Eran Yahav:
code2vec: learning distributed representations of code. 40:1-40:29 - Gagandeep Singh
An abstract domain for certifying neural networks. 41:1-41:30 - Patrick Cousot, Roberto Giacobazzi, Francesco Ranzato:
A²I: abstract² interpretation. 42:1-42:31 - John Toman
Concerto: a framework for combined concrete and abstract interpretation. 43:1-43:29 - Martin Bodin
Skeletal semantics and their interpretations. 44:1-44:31 - John Cyphert
Refinement of path expressions for static analysis. 45:1-45:29 - Umang Mathur
Decidable verification of uninterpreted programs. 46:1-46:29 - Oana Fabiana Andreescu, Thomas P. Jensen, Stéphane Lescuyer, Benoît Montagu
Inferring frame conditions with static correlation analysis. 47:1-47:29 - Johannes Späth, Karim Ali, Eric Bodden:
Context-, flow-, and field-sensitive data-flow analysis using synchronized Pushdown systems. 48:1-48:29 - Taolue Chen
Decision procedures for path feasibility of string-manipulating programs with complex operations. 49:1-49:30 - Rajeev Alur, Konstantinos Mamouras
Modular quantitative monitoring. 50:1-50:31 - Kyungmin Bae
Bounded model checking of signal temporal logic properties using syntactic separation. 51:1-51:30 - Luca Aceto, Antonis Achilleos, Adrian Francalanza, Anna Ingólfsdóttir, Karoliina Lehtinen
Adventures in monitorability: from branching to linear time and back again. 52:1-52:29 - Krishnendu Chatterjee, Amir Kafshdar Goharshady
Efficient parameterized algorithms for data packing. 53:1-53:28 - Valentin Touzeau, Claire Maïza, David Monniaux
Fast and exact analysis for LRU caches. 54:1-54:29 - Zachary Kincaid
Closed forms for numerical loops. 55:1-55:29 - Xin Yi
Efficient automated repair of high floating-point errors in numerical libraries. 56:1-56:29 - Nikos Gorogiannis, Peter W. O'Hearn, Ilya Sergey
A true positives theorem for a static race detector. 57:1-57:29 - Roland Meyer, Sebastian Wolff
Decoupling lock-free data structures from memory reclamation for static analysis. 58:1-58:31 - Klaus von Gleissenthall, Rami Gökhan Kici, Alexander Bakst
Pretend synchrony: synchronous verification of asynchronous distributed programs. 59:1-59:30 - Michael Emmi, Constantin Enea:
Weak-consistency specification via visibility relaxation. 60:1-60:28 - Spencer P. Florence, Shu-Hung You, Jesse A. Tov, Robert Bruce Findler:
A calculus for Esterel: if can, can. if no can, no can. 61:1-61:29 - Yuting Wang
An abstract stack based approach to verified compositional compilation to machine code. 62:1-62:30 - Aymeric Fromherz, Nick Giannarakis, Chris Hawblitzel, Bryan Parno, Aseem Rastogi, Nikhil Swamy:
A verified, efficient embedding of a verifiable assembly language. 63:1-63:30 - Joseph Tassarotti, Robert Harper:
A separation logic for concurrent randomized programs. 64:1-64:30 - Ales Bizjak, Daniel Gratzer
Iron: managing obligations in higher-order concurrent separation logic. 65:1-65:30 - José Fragoso Santos
JaVerT 2.0: compositional symbolic execution for JavaScript. 66:1-66:31 - Kayvan Memarian, Victor B. F. Gomes, Brooks Davis, Stephen Kell, Alexander Richardson
Exploring C semantics and pointer provenance. 67:1-67:32 - Azalea Raad, Marko Doko
On library correctness under weak memory consistency: specifying and verifying concurrent libraries under declarative consistency models. 68:1-68:31 - Anton Podkopaev, Ori Lahav
Bridging the gap between programming languages and hardware weak memory models. 69:1-69:31 - Soham Chakraborty, Viktor Vafeiadis
Grounding thin-air reads with event structures. 70:1-70:28 - Alasdair Armstrong, Thomas Bauereiss, Brian Campbell
ISA semantics for ARMv8-a, RISC-v, and CHERI-MIPS. 71:1-71:31 - Nadia Polikarpova, Ilya Sergey
Structuring the synthesis of heap-manipulating programs. 72:1-72:30 - Kensen Shi, Jacob Steinhardt, Percy Liang:
FrAngel: component-based synthesis with control structures. 73:1-73:29 - Farzin Houshmand, Mohsen Lesani:
Hamsaz: replication coordination analysis and synthesis. 74:1-74:32 - James Parker, Niki Vazou, Michael Hicks:
LWeb: information flow security for multi-tier web applications. 75:1-75:30 - Marco Vassena, Alejandro Russo
From fine- to coarse-grained dynamic information flow control and back. 76:1-76:31 - Conrad Watt, John Renner, Natalie Popescu, Sunjay Cauligi, Deian Stefan:
CT-wasm: type-driven secure cryptography for the web ecosystem. 77:1-77:29
Volume 3, Number ICFP, August 2019
- Matthew Flatt, Caner Derici, R. Kent Dybvig, Andrew W. Keep, Gustavo E. Massaccesi, Sarah Spall, Sam Tobin-Hochstadt
Rebuilding racket on chez scheme (experience report). 78:1-78:15 - Youyou Cong, Leo Osvald, Grégory M. Essertel, Tiark Rompf:
Compiling with continuations, or without? whatever. 79:1-79:28 - Akimasa Morihata:
Lambda calculus with algebraic simplification for reduction parallelization by equational reasoning. 80:1-80:25 - Stefan K. Muller, Sam Westrick
Fairness in responsive parallelism. 81:1-81:30
- Benjamin Delaware, Sorawit Suriyakarn, Clément Pit-Claudel
Narcissus: correct-by-construction derivation of decoders and encoders from binary formats. 82:1-82:29 - Zoe Paraskevopoulou, Andrew W. Appel
Closure conversion is safe for space. 83:1-83:29 - Thomas Van Strydonck, Frank Piessens, Dominique Devriese
Linear capabilities for fully abstract compilation of separation-logic-verified code. 84:1-84:29 - Daniel Patterson, Amal Ahmed
The next 700 compiler correctness theorems (functional pearl). 85:1-85:29
- Matthieu Sozeau, Cyprien Mangin:
Equations reloaded: high-level dependently-typed functional programming and proving in Coq. 86:1-86:29 - Andrea Vezzosi
Cubical agda: a dependently typed programming language with univalence and higher inductive types. 87:1-87:29 - Joseph Eremondi
Approximate normalization for gradual dependent types. 88:1-88:30
- Maximilian Algehed, Jean-Philippe Bernardy:
Simple noninterference from parametricity. 89:1-89:22 - Andrey Mokhov, Georgy Lukyanov, Simon Marlow, Jerémie Dimino:
Selective applicative functors. 90:1-90:29 - Gert-Jan Bottu, Ningning Xie, Koar Marntirosian, Tom Schrijvers
Coherence of type class resolution. 91:1-91:28
- Weihao Qu, Marco Gaboardi
Relational cost analysis for functional-imperative programs. 92:1-92:29 - Hengchu Zhang, Edo Roth, Andreas Haeberlen, Benjamin C. Pierce, Aaron Roth
Fuzzi: a three-level logic for differential privacy. 93:1-93:28 - Calvin Smith, Aws Albarghouthi:
Synthesizing differentially private programs. 94:1-94:29 - Anders Miltner
Synthesizing symmetric lenses. 95:1-95:28
- Fei Wang, Daniel Zheng, James M. Decker, Xilun Wu, Grégory M. Essertel, Tiark Rompf:
Demystifying differentiable programming: shift/reset the penultimate backpropagator. 96:1-96:31 - Amir Shaikhha, Andrew W. Fitzgibbon, Dimitrios Vytiniotis, Simon Peyton Jones:
Efficient differentiable programming in a functional array-processing language. 97:1-97:30 - Rajan Walia, Praveen Narayanan, Jacques Carette, Sam Tobin-Hochstadt
From high-level inference algorithms to efficient code. 98:1-98:30 - Benjamin Sherman, Jesse Michel, Michael Carbin:
Sound and robust solid modeling via exact real arithmetic and continuity. 99:1-99:29
- David Thrane Christiansen, Iavor S. Diatchki, Robert Dockins, Joe Hendrix, Tristan Ravitch:
Dependently typed Haskell in industry (experience report). 100:1-100:16 - Stephanie Weirich, Pritam Choudhury, Antoine Voizard, Richard A. Eisenberg
A role for dependent types in Haskell. 101:1-101:29 - Csongor Kiss, Tony Field, Susan Eisenbach, Simon Peyton Jones:
Higher-order type-level programming in Haskell. 102:1-102:26
- Wouter Swierstra, Tim Baanen:
A predicate transformer semantics for effects (functional pearl). 103:1-103:26 - Kenji Maillard
Dijkstra monads for all. 104:1-104:29 - Amin Timany
Mechanized relational verification of concurrent programs with continuations. 105:1-105:28 - Nicholas V. Lewchenko, Arjun Radhakrishna
Sequential programming for replicated data stores. 106:1-106:28
- Daniel Gratzer
Implementing a modal dependent type theory. 107:1-107:29 - Pierre-Marie Pédrot, Nicolas Tabareau
A reasonably exceptional type theory. 108:1-108:29 - Patrick Bahr
Simply RaTT: a fitch-style modal calculus for reactive programming without space leaks. 109:1-109:27 - Dominic Orchard, Vilem-Benjamin Liepelt, Harley Eades III:
Quantitative program reasoning with graded modal types. 110:1-110:30
- Bert Lindenhovius, Michael W. Mislove
Mixed linear and non-linear recursive types. 111:1-111:29 - Jinxu Zhao, Bruno C. d. S. Oliveira, Tom Schrijvers
A mechanical formalization of higher-ranked polymorphic type inference. 112:1-112:29 - Victor Cacciari Miraldo, Wouter Swierstra:
An efficient algorithm for type-safe structural diffing. 113:1-113:29
- Jennifer Hackett, Graham Hutton
Call-by-need is clairvoyant call-by-value. 114:1-114:23 - Aliya Hameer, Brigitte Pientka:
Teaching the art of functional programming using automated grading (experience report). 115:1-115:15 - Jeremy Yallop, Leo White:
Lambda: the ultimate sublanguage (experience report). 116:1-116:17
Volume 3, Number OOPSLA, October 2019
- Kia Rahmani, Kartik Nagar, Benjamin Delaware, Suresh Jagannathan:
CLOTHO: directed test generation for weakly consistent database systems. 117:1-117:28 - Osbert Bastani, Xin Zhang
Probabilistic verification of fairness properties via concentration. 118:1-118:27 - Vimuth Fernando, Keyur Joshi
Verifying safety and accuracy of approximate parallel programs via canonical sequentialization. 119:1-119:29 - Marcos Yukio Siraichi, Vinícius Fernandes dos Santos, Caroline Collange, Fernando Magno Quintão Pereira:
Qubit allocation as a combination of subgraph isomorphism and token swapping. 120:1-120:29 - Arshavir Ter-Gabrielyan, Alexander J. Summers, Peter Müller:
Modular verification of heap reachability properties in separation logic. 121:1-121:28 - Ben Greenman
Complete monitors for gradual types. 122:1-122:29 - Igor Konnov
TLA+ model checking made symbolic. 123:1-123:30 - Krishnendu Chatterjee, Andreas Pavlogiannis
Value-centric dynamic partial order reduction. 124:1-124:29 - Ariya Shajii, Ibrahim Numanagic, Riyadh Baghdadi, Bonnie Berger, Saman P. Amarasinghe
Seq: a high-performance language for bioinformatics. 125:1-125:29 - Guannan Wei
Staged abstract interpreters: fast and modular whole-program analysis via meta-programming. 126:1-126:32 - Ian Henriksen
Derivative grammars: a symbolic approach to parsing with derivatives. 127:1-127:28 - Yoav Zuriel, Michal Friedman
Efficient lock-free durable sets. 128:1-128:26 - Mingzhang Huang, Hongfei Fu
Modular verification for almost-sure termination of probabilistic programs. 129:1-129:29 - Yu-Ping Wang
IVT: an efficient method for sharing subtype polymorphic objects. 130:1-130:22 - Luís Caires, Bernardo Toninho
Refinement kinds: type-safe programming with practical type-level computation. 131:1-131:30 - Benjamin Mariano, Josh Reese, Siyuan Xu, ThanhVu Nguyen, Xiaokang Qiu
Program synthesis with algebraic library specifications. 132:1-132:25 - Conrad Watt, Andreas Rossberg, Jean Pichon-Pharabod:
Weakening WebAssembly. 133:1-133:28 - Tetsuro Yamazaki, Tomoki Nakamaru, Kazuhiro Ichikawa, Shigeru Chiba:
Generating a fluent API with syntax checking from an LR grammar. 134:1-134:24 - Azalea Raad, John Wickerson, Viktor Vafeiadis
Weak persistency semantics from the ground up: formalising the persistency semantics of ARMv8 and transactional models. 135:1-135:27 - Vilhelm Sjöberg, Yuyang Sang, Shu-Chun Weng, Zhong Shao
DeepSEA: a language for certified system software. 136:1-136:27 - Zhuo Zhang
BDA: practical dependence analysis for binary executables by unbiased whole-program path sampling and per-path abstract interpretation. 137:1-137:31 - Ivana Vukotic, Vincent Rahli
Asphalion: trustworthy shielding against Byzantine faults. 138:1-138:32 - Rong Pan, Qinheping Hu, Gaowei Xu, Loris D'Antoni:
Automatic repair of regular expressions. 139:1-139:29 - Benno Stein, Benjamin Barslev Nielsen, Bor-Yuh Evan Chang
Static analysis with demand-driven value refinement. 140:1-140:29 - Jia Chen, Jiayi Wei, Yu Feng, Osbert Bastani, Isil Dillig:
Relational verification using reinforcement learning. 141:1-141:30 - John Bender, Jens Palsberg:
A formalization of Java's concurrent access modes. 142:1-142:28 - Anders Miltner
On the fly synthesis of edit suggestions. 143:1-143:29 - Ragnar Mogk, Joscha Drechsler, Guido Salvaneschi
A fault-tolerant programming model for distributed interactive applications. 144:1-144:29 - Marianna Rapoport, Ondrej Lhoták:
A path to DOT: formalizing fully path-dependent types. 145:1-145:29 - Théophile Bastian, Stephen Kell, Francesco Zappa Nardelli:
Reliable and fast DWARF-based stack unwinding. 146:1-146:24 - Vytautas Astrauskas, Peter Müller, Federico Poli
Leveraging rust types for modular specification and verification. 147:1-147:30 - Jingbo Lu, Jingling Xue:
Precision-preserving yet fast object-sensitive pointer analysis with partial context sensitivity. 148:1-148:29 - Abhinav Jangda, Donald Pinckney
Formal foundations of serverless computing. 149:1-149:26 - Parosh Aziz Abdulla, Mohamed Faouzi Atig, Bengt Jonsson, Magnus Lång
Optimal stateless model checking for reads-from equivalence under sequential consistency. 150:1-150:29 - Pavel Panchekha, Michael D. Ernst, Zachary Tatlock
Modular verification of web page layout. 151:1-151:26 - Sifei Luan, Di Yang, Celeste Barnaby, Koushik Sen, Satish Chandra:
Aroma: code recommendation via structural code search. 152:1-152:28 - Aviral Goel
On the design, implementation, and use of laziness in R. 153:1-153:27 - Gowtham Kaki
Mergeable replicated data types. 154:1-154:29 - Michaël Marcozzi, Qiyi Tang
Compiler fuzzing: how much does it matter? 155:1-155:29 - Zachary Benavides, Keval Vora
DProf: distributed profiler with strong guarantees. 156:1-156:24 - Grégory M. Essertel, Guannan Wei
Precise reasoning with structured time, structured heaps, and collective operations. 157:1-157:30 - Luis Mastrangelo, Matthias Hauswirth, Nathaniel Nystrom:
Casting about in the dark: an empirical study of cast operations in Java programs. 158:1-158:31 - Johannes Bader
Getafix: learning to fix bugs automatically. 159:1-159:27 - Baijun Wu, John Peter Campora III, Yi He
Generating precise error specifications for C: a zero shot learning approach. 160:1-160:30 - Aleksandar Nanevski, Anindya Banerjee
Specifying concurrent programs in separation logic: morphisms and simulations. 161:1-161:30 - Yi Li, Shaohua Wang, Tien N. Nguyen, Son Van Nguyen:
Improving bug detection via context-based code representation learning and attention-based neural networks. 162:1-162:30 - Filip Krikava, Heather Miller, Jan Vitek:
Scala implicits are everywhere: a large-scale study of the use of Scala implicits in the wild. 163:1-163:28 - Rajkishore Barik, Manu Sridharan, Murali Krishna Ramanathan, Milind Chabbi:
Optimization of swift protocols. 164:1-164:27 - Ranadeep Biswas, Constantin Enea:
On the complexity of checking transactional consistency. 165:1-165:28 - Jad Hamza, Nicolas Voirol, Viktor Kuncak:
System FR: formalized foundations for the stainless verifier. 166:1-166:30 - Guido Salvaneschi
Language-integrated privacy-aware distributed queries. 167:1-167:30 - Rohan Bavishi, Caroline Lemieux, Roy Fox, Koushik Sen, Ion Stoica:
AutoPandas: neural-backed generators for program synthesis. 168:1-168:27 - Ulf Adams:
Ryū revisited: printf floating point conversion. 169:1-169:23 - Bo Shen, Wei Zhang, Haiyan Zhao, Guangtai Liang, Zhi Jin, Qianxiang Wang:
IntelliMerge: a refactoring-aware software merging technique. 170:1-170:28 - Shengyi Wang, Qinxiang Cao, Anshuman Mohan
Certifying graph-manipulating C programs via localizations within data structures. 171:1-171:30 - Joseph P. Near, David Darais, Chike Abuah
Duet: an expressive higher-order language and linear type system for statically enforcing differential privacy. 172:1-172:30 - Michalis Kokologiannakis
Effective lock handling in stateless model checking. 173:1-173:26 - Rohan Padhye
FuzzFactory: domain-specific fuzzing with waypoints. 174:1-174:29 - José Pablo Cambronero, Martin C. Rinard:
AL: autogenerating supervised learning programs. 175:1-175:28 - Sven Keidel
Sound and reusable components for abstract interpretation. 176:1-176:28 - Ahmet Çelik, Pengyu Nie, Christopher J. Rossbach, Milos Gligoric:
Design, implementation, and application of GPU-based Java bytecode interpreters. 177:1-177:28 - Timos Antonopoulos, Eric Koskinen, Ton Chanh Le:
Specification and inference of trace refinement relations. 178:1-178:30 - Kaan Genç, Jake Roemer, Yufan Xu, Michael D. Bond
Dependence-aware, unbounded sound predictive race detection. 179:1-179:30 - Burcu Kulahcioglu Ozkan
Trace aware random testing for distributed systems. 180:1-180:29 - Leonidas Lampropoulos
Coverage guided, property based testing. 181:1-181:29 - Emma Tosch, Eytan Bakshy, Emery D. Berger
PlanAlyzer: assessing threats to the validity of online experiments. 182:1-182:30 - Milijana Surbatovich
I/O dependent idempotence bugs in intermittent systems. 183:1-183:31 - Christian Wimmer, Codrut Stancu, Peter Hofer
Initialize once, start fast: application initialization at build time. 184:1-184:29 - Ilya Sergey, Vaivaswatha Nagaraj, Jacob Johannsen, Amrit Kumar, Anton Trunov, Ken Chan Guan Hao:
Safer smart contract programming with Scilla. 185:1-185:30 - Hashim Sharif, Prakalp Srivastava, Muhammad Huzaifa, Maria Kotsifakou, Keyur Joshi
ApproxHPVM: a portable compiler IR for accuracy-aware optimizations. 186:1-186:30 - August Shi, Milica Hadzi-Tanovic, Lingming Zhang, Darko Marinov, Owolabi Legunsen:
Reflection-aware static regression test selection. 187:1-187:29 - Dowon Song, Myungho Lee, Hakjoo Oh:
Automatic and scalable detection of logical errors in functional programming assignments. 188:1-188:30 - Shuai Wang, Chengyu Zhang
Detecting nondeterministic payment bugs in Ethereum smart contracts. 189:1-189:29
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-26 00:55 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: