![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.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 32 matches
- 2016
- Parosh Aziz Abdulla, Radu Ciobanu, Richard Mayr, Arnaud Sangnier
, Jeremy Sproston:
Qualitative Analysis of VASS-Induced MDPs. FoSSaCS 2016: 319-334 - Danel Ahman
, Neil Ghani, Gordon D. Plotkin:
Dependent Types and Fibred Computational Effects. FoSSaCS 2016: 36-54 - Torben Amtoft, Anindya Banerjee:
A Theory of Slicing for Probabilistic Control Flow Graphs. FoSSaCS 2016: 180-196 - Clément Aubert
, Marc Bagnol, Thomas Seiller
:
Unary Resolution: Characterizing Ptime. FoSSaCS 2016: 373-389 - Holger Bock Axelsen, Robin Kaarsgaard
:
Join Inverse Categories as Models of Reversible Recursion. FoSSaCS 2016: 73-90 - Ales Bizjak, Hans Bugge Grathwohl, Ranald Clouston, Rasmus Ejlers Møgelberg, Lars Birkedal:
Guarded Dependent Type Theory with Coinductive Types. FoSSaCS 2016: 20-35 - Romain Brenguier:
Robust Equilibria in Mean-Payoff Games. FoSSaCS 2016: 217-233 - Venanzio Capretta
, Tarmo Uustalu
:
A Coalgebraic View of Bar Recursion and Bar Induction. FoSSaCS 2016: 91-106 - Kaustuv Chaudhuri, Sonia Marin, Lutz Straßburger:
Focused and Synthetic Nested Sequents. FoSSaCS 2016: 390-407 - Liang-Ting Chen
, Jirí Adámek, Stefan Milius, Henning Urbat:
Profinite Monads, Profinite Equations, and Reiterman's Theorem. FoSSaCS 2016: 531-547 - Dmitry Chistikov
, Wojciech Czerwinski, Piotr Hofman
, Michal Pilipczuk
, Michael Wehar:
Shortest Paths in One-Counter Systems. FoSSaCS 2016: 462-478 - Dmitry Chistikov
, Pavel Martyugin, Mahsa Shirmohammadi:
Synchronizing Automata over Nested Words. FoSSaCS 2016: 252-268 - Normann Decker, Daniel Thoma:
On Freeze LTL with Ordered Attributes. FoSSaCS 2016: 269-284 - Klaus Dräger:
The Invariance Problem for Matrix Semigroups. FoSSaCS 2016: 479-492 - Antoine Durand-Gasselin, Peter Habermehl:
Regular Transformations of Data Words Through Origin Information. FoSSaCS 2016: 285-300 - Nathanaël Fijalkow
, Stefan Kiefer, Mahsa Shirmohammadi:
Trace Refinement in Labelled Markov Decision Processes. FoSSaCS 2016: 303-318 - Marie Fortin, Paul Gastin:
Verification of Parameterized Communicating Automata via Split-Width. FoSSaCS 2016: 197-213 - Adrian Francalanza
:
A Theory of Monitors - (Extended Abstract). FoSSaCS 2016: 145-161 - Soichiro Fujii, Shin-ya Katsumata
, Paul-André Melliès:
Towards a Formal Theory of Graded Monads. FoSSaCS 2016: 513-530 - Neil Ghani, Fredrik Nordvall Forsberg
, Alex Simpson:
Comprehensive Parametric Polymorphism: Categorical Models and Type Theory. FoSSaCS 2016: 3-19 - Silvio Ghilardi
, Maria João Gouveia
, Luigi Santocanale
:
Fixed-Point Elimination in the Intuitionistic Propositional Calculus. FoSSaCS 2016: 126-141 - Holger Hermanns, Jan Krcál, Steen Vester:
Distributed Synthesis in Continuous Time. FoSSaCS 2016: 353-369 - Piotr Hofman
, Slawomir Lasota
, Ranko Lazic, Jérôme Leroux, Sylvain Schmitz
, Patrick Totzke
:
Coverability Trees for Petri Nets with Unordered Data. FoSSaCS 2016: 445-461 - Delia Kesner:
Reasoning About Call-by-need by Means of Types. FoSSaCS 2016: 424-441 - Shankara Narayanan Krishna, Khushraj Madnani
, Paritosh K. Pandya:
Metric Temporal Logic with Counting. FoSSaCS 2016: 335-352 - James Laird:
Game Semantics for Bounded Polymorphism. FoSSaCS 2016: 55-70 - Ranko Lazic, Andrzej S. Murawski:
Contextual Approximation and Higher-Order Procedures. FoSSaCS 2016: 162-179 - José Meseguer:
Order-Sorted Rewriting and Congruence Closure. FoSSaCS 2016: 493-509 - Stefan Milius, Dirk Pattinson, Thorsten Wißmann
:
A New Foundation for Finitary Corecursion - The Locally Finite Fixpoint and Its Properties. FoSSaCS 2016: 107-125 - Michele Pagani, Christine Tasson
, Lionel Vaux:
Strong Normalizability as a Finiteness Structure via the Taylor Expansion of \lambda λ -terms. FoSSaCS 2016: 408-423
skipping 2 more matches
loading more results
failed to load more results, please try again later
![](https://dblp1.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-08-08 03:15 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