![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
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 19 matches
- 2021
- S. Akshay
, Supratik Chakraborty
, Shubham Goel, Sumith Kulal, Shetal Shah:
Boolean functional synthesis: hardness and practical algorithms. Formal Methods Syst. Des. 57(1): 53-86 (2021) - Peter Backeman, Philipp Rümmer, Aleksandar Zeljic:
Interpolating bit-vector formulas using uninterpreted predicates and Presburger arithmetic. Formal Methods Syst. Des. 57(2): 121-156 (2021) - Nikolaj S. Bjørner, Arie Gurfinkel:
Preface of the special issue on the conference on formal methods in computer aided design 2018. Formal Methods Syst. Des. 57(2): 119-120 (2021) - Roderick Bloem
, Nicolas Braud-Santoni, Vedad Hadzic, Uwe Egly, Florian Lonsing, Martina Seidl:
Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations. Formal Methods Syst. Des. 57(2): 157-177 (2021) - Roderick Bloem, Hana Chockler
, Masoud Ebrahimi, Ofer Strichman
:
Vacuity in synthesis. Formal Methods Syst. Des. 57(3): 473-495 (2021) - Michael Blondin
, Javier Esparza
, Stefan Jaax
, Philipp J. Meyer
:
Towards efficient verification of population protocols. Formal Methods Syst. Des. 57(3): 305-342 (2021) - Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis
:
Faster algorithms for quantitative verification in bounded treewidth graphs. Formal Methods Syst. Des. 57(3): 401-428 (2021) - Hana Chockler
, Georg Weissenbacher:
Preface of the special issue on the conference on computer-aided verification 2018. Formal Methods Syst. Des. 57(1): 1-2 (2021) - Byron Cook, Kareem Khazem, Daniel Kroening, Serdar Tasiran, Michael Tautschnig, Mark R. Tuttle:
Model checking boot code from AWS data centers. Formal Methods Syst. Des. 57(1): 34-52 (2021) - Camille Coti, Laure Petrucci
, César Rodríguez, Marcelo Sousa:
Quasi-optimal partial order reduction. Formal Methods Syst. Des. 57(1): 3-33 (2021) - Alberto Griggio
, Marco Roveri
, Stefano Tonetta
:
Certifying proofs for SAT-based model checking. Formal Methods Syst. Des. 57(2): 178-210 (2021) - Hugo Illous, Matthieu Lemerre
, Xavier Rival:
A relational shape abstract domain. Formal Methods Syst. Des. 57(3): 343-400 (2021) - Kim G. Larsen, Natarajan Shankar, Pierre Wolper, Somesh Jha:
2018 CAV award. Formal Methods Syst. Des. 57(1): 116-117 (2021) - Bjørnar Luteberget, Koen Claessen, Christian Johansen
, Martin Steffen:
SAT modulo discrete event simulation applied to railway design capacity analysis. Formal Methods Syst. Des. 57(2): 211-245 (2021) - Aina Niemetz
, Mathias Preiner
, Andrew Reynolds
, Clark W. Barrett
, Cesare Tinelli
:
On solving quantified bit-vector constraints using invertibility conditions. Formal Methods Syst. Des. 57(1): 87-115 (2021) - Oded Padon, Jochen Hoenicke, Kenneth L. McMillan, Andreas Podelski, Mooly Sagiv, Sharon Shoham:
Temporal prophecy for proving temporal properties of infinite-state systems. Formal Methods Syst. Des. 57(2): 246-269 (2021) - Thomas Pani
, Georg Weissenbacher
, Florian Zuleger
:
Rely-guarantee bound analysis of parameterized concurrent shared-memory programs. Formal Methods Syst. Des. 57(2): 270-302 (2021) - Daryl Stewart, Georg Weissenbacher
:
Preface of the special issue on the Conference on Formal Methods in Computer-Aided Design 2017. Formal Methods Syst. Des. 57(3): 303-304 (2021) - Min-Hsien Weng
, Robi Malik, Mark Utting:
Automatic proofs of memory deallocation for a Whiley-to-C Compiler. Formal Methods Syst. Des. 57(3): 429-472 (2021)
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-07-21 01:10 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