default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID26. ESOP 2017: Uppsala, Sweden (Part of ETAPS 2017)
- Hongseok Yang:
Programming Languages and Systems - 26th European Symposium on Programming, ESOP 2017, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Uppsala, Sweden, April 22-29, 2017, Proceedings. Lecture Notes in Computer Science 10201, Springer 2017, ISBN 978-3-662-54433-4 - João Alpuim, Bruno C. d. S. Oliveira, Zhiyuan Shi:
Disjoint Polymorphism. 1-28 - Davide Ancona, Francesco Dagnino, Elena Zucca:
Generalizing Inference Systems by Coaxioms. 29-55 - Robert Atkey:
Observed Communication Semantics for Classical Processes. 56-82 - Pedro R. D'Argenio
, Gilles Barthe, Sebastian Biewer, Bernd Finkbeiner, Holger Hermanns:
Is Your Software on Dope? - Formal Analysis of Surreptitiously "enhanced" Programs. 83-110 - Jasmin Christian Blanchette, Aymeric Bouzy, Andreas Lochbihler, Andrei Popescu, Dmitriy Traytel:
Friends with Benefits - Implementing Corecursion in Foundational Proof Assistants. 111-140 - Filippo Bonchi, Fabio Gadducci, Aleks Kissinger, Pawel Sobocinski, Fabio Zanasi:
Confluence of Graph Rewriting with Interfaces. 141-169 - Ahmed Bouajjani, Michael Emmi, Constantin Enea, Burcu Kulahcioglu Ozkan, Serdar Tasiran:
Verifying Robustness of Event-Driven Asynchronous Programs Against Concurrency. 170-200 - Pierre Boutillier, Thomas Ehrhard, Jean Krivine:
Incremental Update for Graph Rewriting. 201-228 - Luís Caires, Jorge A. Pérez:
Linearity, Control Effects, and Behavioral Types. 229-259 - Arthur Charguéraud, François Pottier:
Temporary Read-Only Permissions for Separation Logic. 260-286 - Krishnendu Chatterjee, Bernhard Kragl, Samarth Mishra, Andreas Pavlogiannis:
Faster Algorithms for Weighted Recursive State Machines. 287-313 - Conrad Cotton-Barratt, Andrzej S. Murawski, C.-H. Luke Ong:
ML and Extended Branching VASS. 314-340 - Raphaëlle Crubillé, Ugo Dal Lago:
Metric Reasoning About \lambda -Terms: The General Case. 341-367 - Ryan Culpepper, Andrew Cobb:
Contextual Equivalence for Probabilistic Programs with Continuous Random Variables and Scoring. 368-392 - Ugo Dal Lago, Charles Grellois:
Probabilistic Termination by Monadic Affine Sized Typing. 393-419 - Thomas Dinsdale-Young, Pedro da Rocha Pinto, Kristoffer Just Andersen, Lars Birkedal:
Caper - Automatic Verification for Fine-Grained Concurrency. 420-447 - Marko Doko, Viktor Vafeiadis:
Tackling Real-Life Relaxed Concurrency with FSL++. 448-475 - Jana Dunfield:
Extensible Datasort Refinements. 476-503 - Francisco Ferreira, Brigitte Pientka:
Programs Using Syntax with First-Class Binders. 504-529 - Aïna Linn Georges, Agata Murawska, Shawn Otis, Brigitte Pientka:
LINCX: A Linear Logical Framework with First-Class Contexts. 530-555 - Jeremy Gibbons:
APLicative Programming with Naperian Functors. 556-583 - Armaël Guéneau, Magnus O. Myreen, Ramana Kumar, Michael Norrish:
Verified Characteristic Formulae for CakeML. 584-610 - Christina Jansen, Jens Katelaan, Christoph Matheja, Thomas Noll, Florian Zuleger:
Unified Reasoning About Robustness Properties of Symbolic-Heap Separation Logic. 611-638 - Artem Khyzha, Mike Dodds, Alexey Gotsman, Matthew J. Parkinson:
Proving Linearizability Using Partial Orders. 639-667 - Cynthia Kop, Jakob Grue Simonsen:
The Power of Non-determinism in Higher-Order Implicit Complexity - Characterising Complexity Classes Using Non-deterministic Cons-Free Programming. 668-695 - Robbert Krebbers, Ralf Jung, Ales Bizjak, Jacques-Henri Jourdan, Derek Dreyer, Lars Birkedal:
The Essence of Higher-Order Concurrent Separation Logic. 696-723 - Ondrej Kuncar, Andrei Popescu:
Comprehending Isabelle/HOL's Consistency. 724-749 - Martin Leinberger, Ralf Lämmel, Steffen Staab:
The Essence of Functional Programming on Semantic Data. 750-776 - Étienne Miquey:
A Classical Sequent Calculus with Dependent Types. 777-803 - Luca Padovani:
Context-Free Session Type Inference. 804-830 - Ryosuke Sato, Naoki Kobayashi:
Modular Verification of Higher-Order Functional Programs. 831-854 - Sam Staton:
Commutative Semantics for Probabilistic Programming. 855-879 - Hao Tang, Di Wang, Yingfei Xiong, Lingming Zhang, Xiaoyin Wang, Lu Zhang:
Conditional Dyck-CFL Reachability Analysis for Complete and Efficient Library Summarization. 880-908 - Joseph Tassarotti, Ralf Jung, Robert Harper:
A Higher-Order Logic for Concurrent Termination-Preserving Refinement. 909-936 - Tim Wood, Sophia Drossopoulou, Shuvendu K. Lahiri, Susan Eisenbach:
Modular Verification of Procedure Equivalence in the Presence of Memory Allocation. 937-963 - Shale Xiong, Pedro da Rocha Pinto, Gian Ntzik, Philippa Gardner:
Abstract Specifications for Concurrent Maps. 964-990
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-12 21:05 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:
