![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 37 matches
- 2017
- Francisco Ferreira, Brigitte Pientka:
Programs Using Syntax with First-Class Binders. ESOP 2017: 504-529 - João Alpuim, Bruno C. d. S. Oliveira, Zhiyuan Shi:
Disjoint Polymorphism. ESOP 2017: 1-28 - Davide Ancona, Francesco Dagnino, Elena Zucca:
Generalizing Inference Systems by Coaxioms. ESOP 2017: 29-55 - Robert Atkey:
Observed Communication Semantics for Classical Processes. ESOP 2017: 56-82 - Jasmin Christian Blanchette
, Aymeric Bouzy, Andreas Lochbihler
, Andrei Popescu, Dmitriy Traytel
:
Friends with Benefits - Implementing Corecursion in Foundational Proof Assistants. ESOP 2017: 111-140 - Filippo Bonchi
, Fabio Gadducci
, Aleks Kissinger
, Pawel Sobocinski
, Fabio Zanasi
:
Confluence of Graph Rewriting with Interfaces. ESOP 2017: 141-169 - Ahmed Bouajjani, Michael Emmi, Constantin Enea, Burcu Kulahcioglu Ozkan
, Serdar Tasiran:
Verifying Robustness of Event-Driven Asynchronous Programs Against Concurrency. ESOP 2017: 170-200 - Pierre Boutillier, Thomas Ehrhard, Jean Krivine:
Incremental Update for Graph Rewriting. ESOP 2017: 201-228 - Luís Caires, Jorge A. Pérez
:
Linearity, Control Effects, and Behavioral Types. ESOP 2017: 229-259 - Arthur Charguéraud, François Pottier:
Temporary Read-Only Permissions for Separation Logic. ESOP 2017: 260-286 - Krishnendu Chatterjee, Bernhard Kragl
, Samarth Mishra, Andreas Pavlogiannis
:
Faster Algorithms for Weighted Recursive State Machines. ESOP 2017: 287-313 - Conrad Cotton-Barratt, Andrzej S. Murawski, C.-H. Luke Ong:
ML and Extended Branching VASS. ESOP 2017: 314-340 - Raphaëlle Crubillé, Ugo Dal Lago
:
Metric Reasoning About \lambda -Terms: The General Case. ESOP 2017: 341-367 - Ryan Culpepper, Andrew Cobb:
Contextual Equivalence for Probabilistic Programs with Continuous Random Variables and Scoring. ESOP 2017: 368-392 - Pedro R. D'Argenio
, Gilles Barthe, Sebastian Biewer, Bernd Finkbeiner, Holger Hermanns:
Is Your Software on Dope? - Formal Analysis of Surreptitiously "enhanced" Programs. ESOP 2017: 83-110 - Thomas Dinsdale-Young, Pedro da Rocha Pinto
, Kristoffer Just Andersen, Lars Birkedal:
Caper - Automatic Verification for Fine-Grained Concurrency. ESOP 2017: 420-447 - Marko Doko
, Viktor Vafeiadis
:
Tackling Real-Life Relaxed Concurrency with FSL++. ESOP 2017: 448-475 - Jana Dunfield:
Extensible Datasort Refinements. ESOP 2017: 476-503 - Aïna Linn Georges, Agata Murawska, Shawn Otis, Brigitte Pientka:
LINCX: A Linear Logical Framework with First-Class Contexts. ESOP 2017: 530-555 - Jeremy Gibbons:
APLicative Programming with Naperian Functors. ESOP 2017: 556-583 - Armaël Guéneau, Magnus O. Myreen, Ramana Kumar, Michael Norrish:
Verified Characteristic Formulae for CakeML. ESOP 2017: 584-610 - Christina Jansen, Jens Katelaan
, Christoph Matheja
, Thomas Noll
, Florian Zuleger:
Unified Reasoning About Robustness Properties of Symbolic-Heap Separation Logic. ESOP 2017: 611-638 - Artem Khyzha
, Mike Dodds, Alexey Gotsman, Matthew J. Parkinson:
Proving Linearizability Using Partial Orders. ESOP 2017: 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. ESOP 2017: 668-695 - Robbert Krebbers, Ralf Jung
, Ales Bizjak, Jacques-Henri Jourdan
, Derek Dreyer, Lars Birkedal:
The Essence of Higher-Order Concurrent Separation Logic. ESOP 2017: 696-723 - Ondrej Kuncar, Andrei Popescu:
Comprehending Isabelle/HOL's Consistency. ESOP 2017: 724-749 - Ugo Dal Lago
, Charles Grellois:
Probabilistic Termination by Monadic Affine Sized Typing. ESOP 2017: 393-419 - Martin Leinberger
, Ralf Lämmel, Steffen Staab
:
The Essence of Functional Programming on Semantic Data. ESOP 2017: 750-776 - Étienne Miquey
:
A Classical Sequent Calculus with Dependent Types. ESOP 2017: 777-803 - Luca Padovani
:
Context-Free Session Type Inference. ESOP 2017: 804-830
skipping 7 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-07-12 03:16 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint