Остановите войну!
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 33 matches
- 2009
- Samy Abbes, Albert Benveniste:
Concurrency, sigma-Algebras, and Probabilistic Fairness. FoSSaCS 2009: 380-394 - Parosh Aziz Abdulla, Richard Mayr:
Minimal Cost Reachability/Coverability in Priced Timed Petri Nets. FoSSaCS 2009: 348-363 - Jirí Adámek, Stefan Milius, Jirí Velebil:
A Description of Iterative Reflections of Monads (Extended Abstract). FoSSaCS 2009: 152-166 - Rajeev Alur:
Temporal Reasoning about Program Executions. FoSSaCS 2009: 15 - Rajeev Alur, Aldric Degorre, Oded Maler, Gera Weiss:
On Omega-Languages Defined by Mean-Payoff Conditions. FoSSaCS 2009: 333-347 - Timos Antonopoulos, Anuj Dawar:
Separating Graph Logic from MSO. FoSSaCS 2009: 63-77 - Jesús Aranda, Frank D. Valencia, Cristian Versari:
On the Expressive Power of Restriction and Priorities in CCS with Replication. FoSSaCS 2009: 242-256 - Kshitij Bansal, Rémi Brochenin, Étienne Lozes:
Beyond Shapes: Lists with Ordered Data. FoSSaCS 2009: 425-439 - Béatrice Bérard, Serge Haddad:
Interrupt Timed Automata. FoSSaCS 2009: 197-211 - Lars Birkedal, Kristian Støvring, Jacob Thamsborg:
Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types. FoSSaCS 2009: 456-470 - Benedikt Bollig, Manuela-Lidia Grindei, Peter Habermehl:
Realizability of Concurrent Recursive Programs. FoSSaCS 2009: 410-424 - Filippo Bonchi, Fabio Gadducci, Giacoma Valentina Monreale:
Reactive Systems, Barbed Semantics, and the Mobile Ambients. FoSSaCS 2009: 272-287 - Marcello M. Bonsangue, Jan J. M. M. Rutten, Alexandra Silva:
A Kleene Theorem for Polynomial Coalgebras. FoSSaCS 2009: 122-136 - Christopher H. Broadbent, C.-H. Luke Ong:
On Global Model Checking Trees Generated by Higher-Order Recursion Schemes. FoSSaCS 2009: 107-121 - Konstantinos Chatzikokolakis, Gethin Norman, David Parker:
Bisimulation for Demonic Schedulers. FoSSaCS 2009: 318-332 - Pierre Clairambault:
Least and Greatest Fixpoints in Game Semantics. FoSSaCS 2009: 16-31 - Luca Fossati, Daniele Varacca:
The Calculus of Handshake Configurations. FoSSaCS 2009: 227-241 - Julian Gutierrez:
Logics and Bisimulation Games for Concurrency, Causality and Conflict. FoSSaCS 2009: 48-62 - Joshua D. Guttman:
Cryptographic Protocol Composition via the Authentication Tests. FoSSaCS 2009: 303-317 - Morten Kühnrich, Stefan Schwoon, Jirí Srba, Stefan Kiefer:
Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains. FoSSaCS 2009: 440-455 - Orna Kupferman, Nir Piterman:
Lower Bounds on Witnesses for Nonemptiness of Universal Co-Büchi Automata. FoSSaCS 2009: 182-196 - Daniel Leivant:
On the Completeness of Dynamic Logic. FoSSaCS 2009: 78-91 - Sergueï Lenglet, Alan Schmitt, Jean-Bernard Stefani:
Normal Bisimulations in Calculi with Passivation. FoSSaCS 2009: 257-271 - Markus Lohrey, Sebastian Maneth, Manfred Schmidt-Schauß:
Parameter Reduction in Grammar-Compressed Trees. FoSSaCS 2009: 212-226 - Yoad Lustig, Moshe Y. Vardi:
Synthesis from Component Libraries. FoSSaCS 2009: 395-409 - Andrzej S. Murawski, Nikos Tzevelekos:
Full Abstraction for Reduced ML. FoSSaCS 2009: 32-47 - Robert S. R. Myers, Dirk Pattinson, Lutz Schröder:
Coalgebraic Hybrid Logic. FoSSaCS 2009: 137-151 - Martin R. Neuhäußer, Mariëlle Stoelinga, Joost-Pieter Katoen:
Delayed Nondeterminism in Continuous-Time Markov Decision Processes. FoSSaCS 2009: 364-379 - Sven Schewe:
Tighter Bounds for the Determinisation of Büchi Automata. FoSSaCS 2009: 167-181 - Geoffrey Smith:
On the Foundations of Quantitative Information Flow. FoSSaCS 2009: 288-302
skipping 3 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-06-03 23:18 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