default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID30th ESOP 2021: Luxembourg
- Nobuko Yoshida
:
Programming Languages and Systems - 30th European Symposium on Programming, ESOP 2021, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2021, Luxembourg City, Luxembourg, March 27 - April 1, 2021, Proceedings. Lecture Notes in Computer Science 12648, Springer 2021, ISBN 978-3-030-72018-6 - Parosh Aziz Abdulla, Mohamed Faouzi Atig, Adwait Godbole, S. Krishna, Viktor Vafeiadis:
The Decidability of Verification under PS 2.0. 1-29 - Snigdha Athaiya, Raghavan Komondoor, K. Narayan Kumar:
Data Flow Analysis of Asynchronous Systems using Infinite Abstract Domains. 30-58 - Patrick Baillot, Alexis Ghyselen:
Types for Complexity of Parallel Computation in Pi-Calculus. 59-86 - Sidi Mohamed Beillahi, Ahmed Bouajjani, Constantin Enea:
Checking Robustness Between Weak Transactional Consistency Models. 87-117 - Lennart Beringer:
Verified Software Units. 118-147 - Christophe Chareton, Sébastien Bardin, François Bobot, Valentin Perrelle, Benoît Valiron:
An Automated Deductive Verification Framework for Circuit-building Quantum Programs. 148-177 - Ankush Das, Henry DeYoung, Andreia Mordido, Frank Pfenning:
Nested Session Types. 178-206 - Gian Pietro Farina, Stephen Chong, Marco Gaboardi:
Coupled Relational Symbolic Execution for Differential Privacy. 207-233 - Marco Gaboardi, Shin-ya Katsumata, Dominic Orchard, Tetsuya Sato:
Graded Hoare Logic and its Categorical Semantics. 234-263 - Harrison Goldstein, John Hughes, Leonidas Lampropoulos, Benjamin C. Pierce:
Do Judge a Test by its Cover - Combining Combinatorial and Property-Based Testing. 264-291 - Maximilian P. L. Haslbeck, Peter Lammich:
For a Few Dollars More - Verified Fine-Grained Algorithm Analysis Down to LLVM. 292-319 - Oren Ish-Shalom, Shachar Itzhaky, Noam Rinetzky, Sharon Shoham:
Run-time Complexity Bounds Using Squeezers. 320-347 - Guilhem Jaber, Andrzej S. Murawski:
Complete trace models of state and control. 348-374 - Alex C. Keizer, Henning Basold, Jorge A. Pérez:
Session Coalgebras: A Coalgebraic View on Session Types and Communication Protocols. 375-403 - Daniel Lundén, Johannes Borgström, David Broman:
Correctness of Sequential Monte Carlo Inference for Probabilistic Programming Languages. 404-431 - Carol Mak, C.-H. Luke Ong, Hugo Paquet, Dominik Wagner:
Densities of Almost Surely Terminating Probabilistic Programs are Differentiable Almost Everywhere. 432-461 - Benjamin Moon, Harley Eades III, Dominic Orchard:
Graded Modal Dependent Type Theory. 462-490 - Marcel Moosbrugger, Ezio Bartocci, Joost-Pieter Katoen, Laura Kovács:
Automated Termination Analysis of Polynomial Probabilistic Programs. 491-518 - Hugo Paquet:
Bayesian strategies: probabilistic programs as generalised graphical models. 519-547 - Guilhem Jaber, Colin Riba:
Temporal Refinements for Guarded Recursive Types. 548-578 - Wilmer Ricciotti, James Cheney:
Query Lifting - Language-integrated query for heterogeneous nested collections. 579-606 - Matthijs Vákár:
Reverse AD at Higher Types: Pure, Principled and Denotationally Correct. 607-634 - Shu-Hung You, Robert Bruce Findler, Christos Dimoulas:
Sound and Complete Concolic Testing for Higher-order Functions. 635-663 - Jens Pagel, Florian Zuleger:
Strong-Separation Logic. 664-692
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 2026-05-25 00:11 CEST 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:
