default search action
ACM Transactions on Programming Languages and Systems, Volume 41
Volume 41, Number 1, March 2019
- Tiago Cogumbreiro, Raymond Hu, Francisco Martins, Nobuko Yoshida:
Dynamic Deadlock Verification for General Barrier Synchronisation. 1:1-1:38 - Alexey Solovyev, Marek S. Baranowski, Ian Briggs, Charles Jacobsen, Zvonimir Rakamaric, Ganesh Gopalakrishnan:
Rigorous Estimation of Floating-Point Round-Off Errors with Symbolic Taylor Expansions. 2:1-2:39 - Nicholas Jacek, Meng-Chieh Chiu, Benjamin M. Marlin, J. Eliot B. Moss:
Optimal Choice of When to Garbage Collect. 3:1-3:35 - Leif Andersen, Vincent St-Amour, Jan Vitek, Matthias Felleisen:
Feature-Specific Profiling. 4:1-4:34 - Rodolphe Lepigre, Christophe Raffalli:
Practical Subtyping for Curry-Style Languages. 5:1-5:58 - Bozhen Liu, Jeff Huang, Lawrence Rauchwerger:
Rethinking Incremental and Parallel Pointer Analysis. 6:1-6:31
Volume 41, Number 2, June 2019
- Andrew C. Myers:
Editorial. 7:1 - Étienne Miquey:
A Classical Sequent Calculus with Dependent Types. 8:1-8:47 - Luca Padovani:
Context-Free Session Type Inference. 9:1-9:37 - Ugo Dal Lago, Charles Grellois:
Probabilistic Termination by Monadic Affine Sized Typing. 10:1-10:65 - Conrad Cotton-Barratt, Andrzej S. Murawski, C.-H. Luke Ong:
ML, Visibly Pushdown Class Memory Automata, and Extended Branching Vector Addition Systems with States. 11:1-11:38
- Matthew Hague, Anthony W. Lin, Chih-Duo Hong:
CSS Minification via Constraint Solving. 12:1-12:76 - Minseok Jeon, Sehun Jeong, Sung Deok Cha, Hakjoo Oh:
A Machine-Learning Algorithm with Disjunctive Model for Data-Driven Program Analysis. 13:1-13:41
Volume 41, Number 3, July 2019
- Leandro Facchinetti, Zachary Palmer, Scott F. Smith:
Higher-order Demand-driven Program Analysis. 14:1-14:53 - David Grove, Sara S. Hamouda, Benjamin Herta, Arun Iyengar, Kiyokuni Kawachiya, Josh Milthorpe, Vijay A. Saraswat, Avraham Shinnar, Mikio Takeuchi, Olivier Tardieu:
Failure Recovery in Resilient X10. 15:1-15:30 - Manas Thakur, V. Krishna Nandivada:
PYE: A Framework for Precise-Yet-Efficient Just-In-Time Analyses for Java Programs. 16:1-16:37 - Roberto Castañeda Lozano, Mats Carlsson, Gabriel Hjort Blindell, Christian Schulte:
Combinatorial Register Allocation and Instruction Scheduling. 17:1-17:53 - Fausto Spoto, Elisa Burato, Michael D. Ernst, Pietro Ferrara, Alberto Lovato, Damiano Macedonio, Ciprian Spiridon:
Static Identification of Injection Attacks in Java. 18:1-18:58 - Andrea Rosà, Eduardo Rosales, Walter Binder:
Analysis and Optimization of Task Granularity on the Java Virtual Machine. 19:1-19:47
Volume 41, Number 4, December 2019
- Krishnendu Chatterjee, Hongfei Fu, Amir Kafshdar Goharshady:
Non-polynomial Worst-Case Analysis of Recursive Programs. 20:1-20:52 - Emery D. Berger, Celeste Hollenbeck, Petr Maj, Olga Vitek, Jan Vitek:
On the Impact of Programming Languages on Code Quality: A Reproduction Study. 21:1-21:24 - Davide Sangiorgi, Valeria Vignudelli:
Environmental Bisimulations for Probabilistic Higher-order Languages. 22:1-22:64 - Krishnendu Chatterjee, Amir Kafshdar Goharshady, Prateesh Goyal, Rasmus Ibsen-Jensen, Andreas Pavlogiannis:
Faster Algorithms for Dynamic Algebraic Queries in Basic RSMs with Constant Treewidth. 23:1-23:46
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.