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 13 matches
- 2013
- S. Akshay, Benedikt Bollig, Paul Gastin:
Event clock message passing automata: a logical characterization and an emptiness checking algorithm. Formal Methods Syst. Des. 42(3): 262-300 (2013) - Étienne André, Laurent Fribourg, Jeremy Sproston:
An extension of the inverse method to probabilistic timed automata. Formal Methods Syst. Des. 42(2): 119-145 (2013) - Sebastian S. Bauer, Uli Fahrenberg, Line Juhl, Kim G. Larsen, Axel Legay, Claus R. Thrane:
Weighted modal transition systems. Formal Methods Syst. Des. 42(2): 193-220 (2013) - Krishnendu Chatterjee, Luca de Alfaro, Marco Faella, Rupak Majumdar, Vishwanath Raman:
Code aware resource management. Formal Methods Syst. Des. 42(2): 146-174 (2013) - Krishnendu Chatterjee, Monika Henzinger, Manas Joglekar, Nisarg Shah:
Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives. Formal Methods Syst. Des. 42(3): 301-327 (2013) - Alessandro Cimatti, Sergio Mover, Stefano Tonetta:
SMT-based scenario verification for hybrid systems. Formal Methods Syst. Des. 42(1): 46-66 (2013) - Kunihiko Hiraishi, Koichi Kobayashi:
An approximation algorithm for box abstraction of transition systems on real state spaces. Formal Methods Syst. Des. 42(2): 175-192 (2013) - Dejan Jovanovic, Clark W. Barrett:
Being careful about theory combination. Formal Methods Syst. Des. 42(1): 67-90 (2013) - Daniel Kroening, Natasha Sharygina, Stefano Tonetta, Aliaksei Tsitovich, Christoph M. Wintersteiger:
Loop summarization using state and transition invariants. Formal Methods Syst. Des. 42(3): 221-261 (2013) - Silvio Ranise:
Symbolic backward reachability with effectively propositional logic - Applications to security policy analysis. Formal Methods Syst. Des. 42(1): 24-45 (2013) - Ofer Strichman, Daniel Kroening:
Preface to the special issue "SI: Satisfiability Modulo Theories". Formal Methods Syst. Des. 42(1): 1-2 (2013) - Aaron Stump, Duckki Oe, Andrew Reynolds, Liana Hadarean, Cesare Tinelli:
SMT proof checking using a logical framework. Formal Methods Syst. Des. 42(1): 91-118 (2013) - Christoph M. Wintersteiger, Youssef Hamadi, Leonardo Mendonça de Moura:
Efficiently solving quantified bit-vector formulas. Formal Methods Syst. Des. 42(1): 3-23 (2013)
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-10-01 11:25 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