default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDACM Transactions on Programming Languages and Systems, Volume 42
Volume 42, Number 1, January 2020
- Amal Ahmed:
Introduction to the Special Issue on ESOP 2018. 1:1 - Ningning Xie, Xuan Bi, Bruno C. d. S. Oliveira, Tom Schrijvers
:
Consistent Subtyping for All. 2:1-2:79 - Marco Eilers, Peter Müller, Samuel Hitz:
Modular Product Programs. 3:1-3:37 - Alex Simpson, Niels F. W. Voorneveld:
Behavioural Equivalence via Modalities for Algebraic Effects. 4:1-4:45 - Lau Skorstengaard, Dominique Devriese, Lars Birkedal:
Reasoning about a Machine with Local Capabilities: Provably Safe Stack and Return Pointer Management. 5:1-5:53
Volume 42, Number 2, May 2020
- Torben Amtoft, Anindya Banerjee:
A Theory of Slicing for Imperative Probabilistic Programs. 6:1-6:71 - David Zhao, Pavle Subotic, Bernhard Scholz:
Debugging Large-scale Datalog: A Scalable Provenance Evaluation Strategy. 7:1-7:35 - Pritam M. Gharat, Uday P. Khedker, Alan Mycroft:
Generalized Points-to Graphs: A Precise and Scalable Abstraction for Points-to Analysis. 8:1-8:78 - Praveen Narayanan, Chung-chieh Shan:
Symbolic Disintegration with a Variety of Base Measures. 9:1-9:60 - Yue Li, Tian Tan, Anders Møller, Yannis Smaragdakis:
A Principled Approach to Selective Context Sensitivity for Pointer Analysis. 10:1-10:40 - Matías Toro, Ronald Garcia, Éric Tanter:
Corrigendum to "Type-driven Gradual Security with References, " by Toro et al., ACM Transactions on Programming Languages and Systems (TOPLAS) Volume 40, Issue 4, Article No. 16. 11:1-11:2
Volume 42, Number 3, December 2020
- Abhinav Jangda, Uday Bondhugula:
An Effective Fusion and Tile Size Model for PolyMage. 12:1-12:27 - Florian Frohn, Matthias Naaf, Marc Brockschmidt, Jürgen Giesl:
Inferring Lower Runtime Bounds for Integer Programs. 13:1-13:50 - Michael J. Coblenz, Reed Oei, Tyler Etzel, Paulette Koronkevich, Miles Baker, Yannick Bloem, Brad A. Myers, Joshua Sunshine, Jonathan Aldrich:
Obsidian: Typestate and Assets for Safer Blockchain Programming. 14:1-14:82 - Leandro T. C. Melo, Rodrigo Geraldo Ribeiro, Breno Campos Ferreira Guimarães, Fernando Magno Quintão Pereira:
Type Inference for C: Applications to the Static Analysis of Incomplete Programs. 15:1-15:71
Volume 42, Number 4, February 2021
- Peizun Liu, Thomas Wahl, Thomas W. Reps:
Interprocedural Context-Unbounded Program Analysis Using Observation Sequences. 16:1-16:34 - Janwillem Swalens, Joeri De Koster, Wolfgang De Meuter:
Chocola: Composable Concurrency Language. 17:1-17:56 - Jiasi Shen, Martin C. Rinard:
Active Learning for Inference and Regeneration of Applications that Access Databases. 18:1-18:119 - Abu Naser Masud, Björn Lisper:
Semantic Correctness of Dependence-based Slicing for Interprocedural, Possibly Nonterminating Programs. 19:1-19:56
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 2025-12-01 23:12 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:
