Остановите войну!
for scientists:
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 27 matches
- 2023
- Danel Ahman:
When Programs Have to Watch Paint Dry. FoSSaCS 2023: 1-23 - Pedro H. Azevedo de Amorim:
A Higher-Order Language for Markov Kernels and Linear Operators. FoSSaCS 2023: 89-112 - Paul C. Attie, William Cocke:
Model and Program Repair via Group Actions. FoSSaCS 2023: 520-540 - Pascal Baumann, Flavio D'Alessandro, Moses Ganardi, Oscar H. Ibarra, Ian McQuillan, Lia Schütze, Georg Zetzsche:
Unboundedness Problems for Machines with Reversal-Bounded Counters. FoSSaCS 2023: 240-264 - Marco Bernardo, Sabina Rossi:
Reverse Bisimilarity vs. Forward Bisimilarity. FoSSaCS 2023: 265-284 - Udi Boker, Guy Hefetz:
On the Comparison of Discounted-Sum Automata with Multiple Discount Factors. FoSSaCS 2023: 371-391 - Benjamin Bordais, Patricia Bouyer, Stéphane Le Roux:
Subgame Optimal Strategies in Finite Concurrent Games with Prefix-Independent Objectives. FoSSaCS 2023: 541-560 - Zhibo Chen, Frank Pfenning:
A Logical Framework with Higher-Order Rational (Circular) Terms. FoSSaCS 2023: 68-88 - Gaëtan Douéneau-Tabot:
Pebble minimization: the last theorems. FoSSaCS 2023: 436-455 - Jérémy Dubut, Thorsten Wißmann:
Weighted and Branching Bisimilarities from Generalized Open Maps. FoSSaCS 2023: 308-327 - Rachid Echahed, Mnacho Echenim, Mehdi Mhalla, Nicolas Peltier:
A Strict Constrained Superposition Calculus for Graphs. FoSSaCS 2023: 135-155 - Rob van Glabbeek:
Just Testing. FoSSaCS 2023: 498-519 - Sergey Goncharov, Dirk Hofmann, Pedro Nora, Lutz Schröder, Paul Wild:
Kantorovich Functors and Characteristic Logics for Behavioural Distances. FoSSaCS 2023: 46-67 - Emmanuel Hainry, Romain Péchoux, Mário Silva:
A Programming Language Characterizing Quantum Polynomial Time. FoSSaCS 2023: 156-175 - Thomas A. Henzinger, Nicolas Mazzocchi, N. Ege Saraç:
Quantitative Safety and Liveness. FoSSaCS 2023: 349-370 - Daniel Hirschkoff, Guilhem Jaber, Enguerrand Prebet:
Deciding Contextual Equivalence of ν-Calculus with Effectful Contexts. FoSSaCS 2023: 24-45 - Lukás Holík, Juraj Síc, Lenka Turonová, Tomás Vojnar:
Fast Matching of Regular Patterns with Synchronizing Counting. FoSSaCS 2023: 392-412 - Faezeh Labbaf, Jan Friso Groote, Hossein Hojjat, Mohammad Reza Mousavi:
Compositional Learning for Interleaving Parallel Automata. FoSSaCS 2023: 413-435 - Quang Loc Le, Xuan-Bach Dinh Le:
An Efficient Cyclic Entailment Procedure in a Fragment of Separation Logic. FoSSaCS 2023: 477-497 - Aliaume Lopez:
Fixed Points and Noetherian Topologies. FoSSaCS 2023: 456-476 - Filip Mazowiecki, Henry Sinclair-Banks, Karol Wegrzycki:
Coverability in 2-VASS with One Unary Counter is in NP. FoSSaCS 2023: 196-217 - Max S. New, Daniel R. Licata:
A Formal Logic for Formal Category Theory. FoSSaCS 2023: 113-134 - Aditya Prakash, K. S. Thejaswini:
On History-Deterministic One-Counter Nets. FoSSaCS 2023: 218-239 - Amgad Rady, Franck van Breugel:
Explainability of Probabilistic Bisimilarity Distances for Labelled Markov Chains. FoSSaCS 2023: 285-307 - Mikhail R. Starchak:
On the Existential Arithmetics with Addition and Bitwise Minimum. FoSSaCS 2023: 176-195 - Ruben Turkenburg, Clemens Kupke, Jurriaan Rot, Ezra Schoen:
Preservation and Reflection of Bisimilarity via Invertible Steps. FoSSaCS 2023: 328-348 - Orna Kupferman, Pawel Sobocinski:
Foundations of Software Science and Computation Structures - 26th International Conference, FoSSaCS 2023, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2023, Paris, France, April 22-27, 2023, Proceedings. Lecture Notes in Computer Science 13992, Springer 2023, ISBN 978-3-031-30828-4 [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-06-01 05:45 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