


default search action
ACM Transactions on Programming Languages and Systems, Volume 35
Volume 35, Number 1, April 2013
- Jens Palsberg:
Editorial. 1:1 - Andreas Rossberg, Derek Dreyer:
Mixin' Up the ML Module System. 2:1-2:84 - V. Krishna Nandivada
, Jun Shirako, Jisheng Zhao, Vivek Sarkar:
A Transformation Framework for Optimizing Task-Parallel Programs. 3:1-3:48 - Junghee Lim, Thomas W. Reps:
TSL: A System for Generating Abstract Interpreters and its Application to Machine-Code Analysis. 4:1-4:59 - Stefan Staiger-Stöhr:
Practical Integrated Analysis of Pointers, Dataflow and Control Flow. 5:1-5:48
Volume 35, Number 2, July 2013
- Aleksandar Nanevski, Anindya Banerjee, Deepak Garg:
Dependent Type Theory for Verification of Information Flow and Access Control Policies. 6:1-6:41 - David W. Binkley, Nicolas Gold, Mark Harman
, Syed S. Islam, Jens Krinke
, Zheng Li
:
Efficient Identification of Linchpin Vertices in Dependence Clusters. 7:1-7:35 - Matko Botincan, Mike Dodds
, Suresh Jagannathan:
Proof-Directed Parallelization Synthesis by Separation Logic. 8:1-8:60
Volume 35, Number 3, November 2013
- Gilles Barthe
, Boris Köpf, Federico Olmedo
, Santiago Zanella-Béguelin
:
Probabilistic Relational Reasoning for Differential Privacy. 9:1-9:49 - Ahmed Bouajjani, Michael Emmi:
Analysis of Recursively Parallel Programs. 10:1-10:49 - T. Stephen Strickland, Christos Dimoulas
, Asumu Takikawa, Matthias Felleisen:
Contracts for First-Class Classes. 11:1-11:58
Volume 35, Number 4, December 2013
- Andreas Lochbihler
:
Making the java memory model safe. 12:1-12:65 - Diogo Sampaio, Rafael Martins de Souza, Caroline Collange, Fernando Magno Quintão Pereira:
Divergence analysis. 13:1-13:36 - Durica Nikolic, Fausto Spoto
:
Reachability analysis of program variables. 14:1-14:68

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.