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 20 matches
- 2011
- Václav Brozek:
Optimal Strategies in Infinite-state Stochastic Reachability Games. GandALF 2011: 60-73 - Yoad Lustig, Moshe Y. Vardi:
Synthesis from Recursive-Components Libraries. GandALF 2011: 1-16 - Christian Appold:
Improving BDD Based Symbolic Model Checking with Isomorphism Exploiting Transition Relations. GandALF 2011: 17-30 - Stefan Haar, Christian Kern, Stefan Schwoon:
Computing the Reveals Relation in Occurrence Nets. GandALF 2011: 31-44 - Federico Buti, Massimo Callisto De Donato, Flavio Corradini, Maria Rita Di Berardini, Walter Vogler:
Automated Analysis of MUTEX Algorithms with FASE. GandALF 2011: 45-59 - Krishnendu Chatterjee, Nathanaël Fijalkow:
A reduction from parity games to simple stochastic games. GandALF 2011: 74-86 - Bastien Maubert, Sophie Pinchinat, Laura Bozzelli:
Opacity Issues in Games with Imperfect Information. GandALF 2011: 87-101 - Makoto Tatsuta, Ferruccio Damiani:
Type Inference for Bimorphic Recursion. GandALF 2011: 102-115 - Zhilin Wu:
A Decidable Extension of Data Automata. GandALF 2011: 116-130 - Sten Grüner, Frank G. Radmacher, Wolfgang Thomas:
Connectivity Games over Dynamic Networks. GandALF 2011: 131-145 - Martin Zimmermann:
Optimal Bounds in Parametric LTL Games. GandALF 2011: 146-161 - Laura Bozzelli:
New results on pushdown module checking with imperfect information. GandALF 2011: 162-177 - Rüdiger Ehlers, Bernd Finkbeiner:
Reactive Safety. GandALF 2011: 178-191 - Davide Bresolin, Angelo Montanari, Pietro Sala, Guido Sciavicco:
An Optimal Decision Procedure for MPNL over the Integers. GandALF 2011: 192-206 - Markus Latte:
Separation of Test-Free Propositional Dynamic Logics over Context-Free Languages. GandALF 2011: 207-221 - Giacomo Lenzi:
On P-transitive graphs and applications. GandALF 2011: 222-236 - Davide Bresolin, Marta Capiluppi:
A Game-Theoretic approach to Fault Diagnosis of Hybrid Systems. GandALF 2011: 237-249 - Olga Tveretina, Daniel Funke:
Deciding Reachability for 3-Dimensional Multi-Linear Systems. GandALF 2011: 250-262 - Massimo Benerecetti, Marco Faella, Stefano Minopoli:
Towards Efficient Exact Synthesis for Linear Hybrid Systems. GandALF 2011: 263-277 - Giovanna D'Agostino, Salvatore La Torre:
Proceedings of Second International Symposium on Games, Automata, Logics and Formal Verification, GandALF 2011, Minori, Italy, 15-17th June 2011. EPTCS 54, 2011 [contents]
loading more results
failed to load more results, please try again later
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-10-15 00:58 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