Остановите войну!
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 21 matches
- 2011
- Parosh Aziz Abdulla, Jonathan Cederberg, Tomás Vojnar:
Monotonic Abstraction for Programs with Multiply-Linked Structures. RP 2011: 125-138 - Étienne André, Romain Soulat:
Synthesis of Timing Parameters Satisfying Safety Properties. RP 2011: 31-44 - Roland Axelsson, Martin Lange:
Formal Language Constrained Reachability and Model Checking Propositional Dynamic Logics. RP 2011: 45-57 - Marcello M. Bersani, Achille Frigeri, Matteo Rossi, Pierluigi San Pietro:
Completeness of the Bounded Satisfiability Problem for Constraint LTL. RP 2011: 58-71 - Yohan Boichut, Thi-Bich-Hanh Dao, Valérie Murat:
Characterizing Conclusive Approximations by Logical Formulae. RP 2011: 72-84 - Rémi Bonnet:
Decidability of LTL for Vector Addition Systems with One Zero-Test. RP 2011: 85-95 - Laura Bozzelli, Pierre Ganty:
Complexity Analysis of the Backward Coverability Algorithm for VASS. RP 2011: 96-109 - Alessandro Carioni, Silvio Ghilardi, Silvio Ranise:
Automated Termination in Model Checking Modulo Theories. RP 2011: 110-124 - Krishnendu Chatterjee:
Graph Games with Reachability Objectives - (Invited Talk). RP 2011: 1 - Xin Chen, Erika Ábrahám, Goran Frehse:
Efficient Bounded Reachability Computation for Rectangular Automata. RP 2011: 139-152 - Taolue Chen, Tingting Han, Joost-Pieter Katoen, Alexandru Mereacre:
Observing Continuous-Time MDPs by 1-Clock Timed Automata. RP 2011: 2-25 - Bruno Courcelle:
Automata for Monadic Second-Order Model-Checking. RP 2011: 26-27 - Christian Eggermont, Gerhard J. Woeginger:
Reachability and Deadlocking Problems in Multi-stage Scheduling. RP 2011: 153-164 - Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti, Valerio Senni:
Improving Reachability Analysis of Infinite State Systems by Specialization. RP 2011: 165-179 - Laurent Fribourg, Ulrich Kühne:
Parametric Verification and Test Coverage for Hybrid Automata Using the Inverse Method. RP 2011: 191-204 - Vladimir V. Gusev:
Lower Bounds for the Length of Reset Words in Eulerian Automata. RP 2011: 180-190 - Maurice Margenstern:
A New Weakly Universal Cellular Automaton in the 3D Hyperbolic Space with Two States. RP 2011: 205-217 - Malcolm Mumme, Gianfranco Ciardo:
A Fully Symbolic Bisimulation Algorithm. RP 2011: 218-230 - Jean-François Raskin:
Reachability Problems for Hybrid Automata. RP 2011: 28-30 - Nataliya Skrypnyuk, Flemming Nielson:
Reachability for Finite-State Process Algebras Using Static Analysis. RP 2011: 231-244 - Giorgio Delzanno, Igor Potapov:
Reachability Problems - 5th International Workshop, RP 2011, Genoa, Italy, September 28-30, 2011. Proceedings. Lecture Notes in Computer Science 6945, Springer 2011, ISBN 978-3-642-24287-8 [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-09-09 08:13 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