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 250 matches
- 2023
- Sebastian Forster, Antonis Skarlatos, Tijn de Vos:
Fast Algorithms for Energy Games in Special Cases. GandALF 2023: 236-252 - Hans van Ditmarsch, Roman Kuznets, Rojo Randrianomentsoa:
On Two- and Three-valued Semantics for Impure Simplicial Complexes. GandALF 2023: 50-66 - Stephan Spengler, Sanchari Sil:
TSO Games - On the decidability of safety games under the total store order semantics. GandALF 2023: 82-98 - Emanuel Kieronski:
A Uniform One-Dimensional Fragment with Alternation of Quantifiers. GandALF 2023: 1-15 - Jasper Nalbach, Valentin Promies, Erika Ábrahám, Paul Kobialka:
FMplex: A Novel Method for Solving Linear Real Arithmetic Problems. GandALF 2023: 16-32 - Manolis Pitsikalis, Alexei Lisitsa, Patrick Totzke:
Handling of Past and Future with Phenesthe+. GandALF 2023: 33-49 - Marco Bernardo, Andrea Esposito:
Modal Logic Characterizations of Forward, Reverse, and Forward-Reverse Bisimilarities. GandALF 2023: 67-81 - Falke B. Ø. Carlsen, Lars Bo P. Frydenskov, Nicolaj Ø. Jensen, Jener Rasmussen, Mathias M. Sørensen, Asger G. Weirsøe, Mathias Claus Jensen, Kim G. Larsen:
CGAAL: Distributed On-The-Fly ATL Model Checker with Heuristics. GandALF 2023: 99-114 - Paul Hannibal:
(Un)Decidability Bounds of the Synthesis Problem for Petri Games. GandALF 2023: 115-131 - Julie Parreaux, Jakob Piribauer, Christel Baier:
Counterfactual Causality for Reachability and Safety based on Distance Functions. GandALF 2023: 132-149 - Tiago Ferreira, Léo Henry, Raquel Fernandes da Silva, Alexandra Silva:
Conflict-Aware Active Automata Learning. GandALF 2023: 150-167 - Thomas Webster:
The Recursive Arrival Problem. GandALF 2023: 168-184 - Joshua A. Grochow, Michael Levet:
On the Descriptive Complexity of Groups without Abelian Normal Subgroups (Extended Abstract). GandALF 2023: 185-202 - Daniele Dell'Erba, Arthur Dumas, Sven Schewe:
An Objective Improvement Approach to Solving Discounted Payoff Games. GandALF 2023: 203-219 - Martin Fränzle, Sarah Winter, Martin Zimmermann:
Strategies Resilient to Delay: Games under Delayed Control vs. Delay Games. GandALF 2023: 220-235 - Antonis Achilleos, Dario Della Monica:
Proceedings of the Fourteenth International Symposium on Games, Automata, Logics, and Formal Verification, GandALF 2023, Udine, Italy, 18-20th September 2023. EPTCS 390, 2023 [contents] - 2022
- Hadar Frenkel, Sarai Sheinvald:
Realizable and Context-Free Hyperlanguages. GandALF 2022: 114-130 - Benedikt Bollig, Arnaud Sangnier, Olivier Stietel:
On the Existential Fragments of Local First-Order Logics with Data. GandALF 2022: 1-16 - Florian Bruse, David Kronenberger, Martin Lange:
Capturing Bisimulation-Invariant Exponential-Time Complexity Classes. GandALF 2022: 17-33 - Joachim Niehren, Momar Sakho, Antonio Al Serhali:
Schema-Based Automata Determinization. GandALF 2022: 49-65 - Hans de Nivelle, Dina Muktubayeva:
Generating Tokenizers with Flat Automata. GandALF 2022: 66-80 - Igor Khmelnitsky, Serge Haddad, Lina Ye, Benoît Barbot, Benedikt Bollig, Martin Leucker, Daniel Neider, Rajarshi Roy:
Analyzing Robustness of Angluin's L* Algorithm in Presence of Noise. GandALF 2022: 81-96 - Laura Bozzelli, Adriano Peron:
Parametric Interval Temporal Logic over Infinite Words. GandALF 2022: 97-113 - Renato Acampora, Luca Geatti, Nicola Gigante, Angelo Montanari, Valentino Picotti:
Controller Synthesis for Timeline-based Games. GandALF 2022: 131-146 - Dalton Chichester, Wei Du, Raymond Kauffman, Hai Lin, Christopher Lynch, Andrew M. Marshall, Catherine A. Meadows, Paliath Narendran, Veena Ravishankar, Luis Rovira, Brandon Rozek:
CryptoSolve: Towards a Tool for the Symbolic Analysis of Cryptographic Algorithms. GandALF 2022: 147-161 - Thomas Brihaye, Sophie Pinchinat, Alexandre Terefenko:
Adversarial Formal Semantics of Attack Trees and Related Problems. GandALF 2022: 162-177 - Giann Karlo Aguirre-Samboní, Stefan Haar, Loïc Paulevé, Stefan Schwoon, Nick Würdemann:
Avoid One's Doom: Finding Cliff-Edge Configurations in Petri Nets. GandALF 2022: 178-193 - Michael J. Coulombe, Jayson Lynch:
Characterizing the Decidability of Finite State Automata Team Games with Communication. GandALF 2022: 213-228 - Felix Stutz, Damien Zufferey:
Comparing Channel Restrictions of Communicating State Machines, High-level Message Sequence Charts, and Multiparty Session Types. GandALF 2022: 194-212 - Luca Aceto, Antonis Achilleos, Elli Anastasiadi, Adrian Francalanza, Anna Ingólfsdóttir:
Complexity through Translations for Modal Logic with Recursion. GandALF 2022: 34-48
skipping 220 more matches
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-11-09 16:10 CET 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