Остановите войну!
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 14 matches
- 2012
- Martin Lange, Étienne Lozes:
Model-Checking the Higher-Dimensional Modal mu-Calculus. FICS 2012: 39-46 - 2011
- Naoki Kobayashi, C.-H. Luke Ong:
Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus. Log. Methods Comput. Sci. 7(4) (2011) - 2009
- Naoki Kobayashi, C.-H. Luke Ong:
Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus. ICALP (2) 2009: 223-234 - Naoki Kobayashi, C.-H. Luke Ong:
A Type System Equivalent to the Modal Mu-Calculus Model Checking of Higher-Order Recursion Schemes. LICS 2009: 179-188 - 2002
- Radu Mateescu:
Local Model-Checking of Modal Mu-Calculus on Acyclic Labeled Transition Systems. TACAS 2002: 281-295 - 1999
- Olaf Burkart, Bernhard Steffen:
Model Checking the Full Modal mu-Calculus for Infinite Sequential Processes. Theor. Comput. Sci. 221(1-2): 251-270 (1999) - 1997
- Olaf Burkart, Bernhard Steffen:
Model Checking the Full Modal Mu-Calculus for Infinite Sequential Processes. ICALP 1997: 419-429 - 1994
- Oleg Sokolsky, Scott A. Smolka:
Incremental Model Checking in the Modal Mu-Calculus. CAV 1994: 351-363 - Shipei Zhang, Oleg Sokolsky, Scott A. Smolka:
On the Parallel Complexity of Model Checking in the Modal Mu-Calculus. LICS 1994: 154-163 - 1993
- Rance Cleaveland, Bernhard Steffen:
A Linear-Time Model-Checking Algorithm for the Alternation-Free Modal Mu-Calculus. Formal Methods Syst. Des. 2(2): 121-147 (1993) - 1992
- Rance Cleaveland, Marion Klein, Bernhard Steffen:
Faster Model Checking for the Modal Mu-Calculus. CAV 1992: 410-422 - 1991
- Colin Stirling, David Walker:
Local Model Checking in the Modal mu-Calculus. Theor. Comput. Sci. 89(1): 161-177 (1991) - Rance Cleaveland, Bernhard Steffen:
A Linear-Time Model-Checking Algorithm for the Alternation-Free Modal Mu-Calculus. CAV 1991: 48-58 - 1989
- Colin Stirling, David Walker:
Local Model Checking in the Modal Mu-Calculus. TAPSOFT, Vol.1 1989: 369-383
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-04-25 10:00 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