Остановите войну!
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 23 matches
- 2017
- Wolfgang Ahrendt, Jesús Mauricio Chimento, Gordon J. Pace, Gerardo Schneider:
Verifying data- and control-oriented properties combining static and runtime verification: theory and tools. Formal Methods Syst. Des. 51(1): 200-265 (2017) - Francesco Alberti, Silvio Ghilardi, Elena Pagani:
Cardinality constraints for arrays (decidability results and applications). Formal Methods Syst. Des. 51(3): 545-574 (2017) - Ezio Bartocci, Rupak Majumdar:
Introduction to the special issue on runtime verification. Formal Methods Syst. Des. 51(1): 1-4 (2017) - Martin Bromberger, Christoph Weidenbach:
New techniques for linear arithmetic: cubes and equalities. Formal Methods Syst. Des. 51(3): 433-461 (2017) - Niklas Büscher, Martin Franz, Andreas Holzer, Helmut Veith, Stefan Katzenbeisser:
On compiling Boolean circuits optimized for secure multi-party computation. Formal Methods Syst. Des. 51(2): 308-331 (2017) - Jyotirmoy V. Deshmukh, Alexandre Donzé, Shromona Ghosh, Xiaoqing Jin, Garvit Juniwal, Sanjit A. Seshia:
Robust online monitoring of signal temporal logic. Formal Methods Syst. Des. 51(1): 5-30 (2017) - Frederic Doucet, Robert P. Kurshan:
A methodology to take credit for high-level verification during RTL verification. Formal Methods Syst. Des. 51(2): 395-418 (2017) - Constantin Enea, Ondrej Lengál, Mihaela Sighireanu, Tomás Vojnar:
Compositional entailment checking for a fragment of separation logic. Formal Methods Syst. Des. 51(3): 575-607 (2017) - Andreas Fellner, Pascal Fontaine, Bruno Woltzenlogel Paleo:
NP-completeness of small conflict set generation for congruence closure. Formal Methods Syst. Des. 51(3): 533-544 (2017) - Adrian Francalanza, Luca Aceto, Anna Ingólfsdóttir:
Monitorability for the Hennessy-Milner logic with recursion. Formal Methods Syst. Des. 51(1): 87-116 (2017) - Georg Gottlob, Thomas A. Henzinger, Georg Weissenbacher:
Preface of the Special Issue in Memoriam Helmut Veith. Formal Methods Syst. Des. 51(2): 267-269 (2017) - Alberto Griggio, Philipp Rümmer:
Preface to special issue on satisfiability modulo theories. Formal Methods Syst. Des. 51(3): 431-432 (2017) - William R. Harris, Somesh Jha, Thomas W. Reps, Sanjit A. Seshia:
Program synthesis for interactive-security systems. Formal Methods Syst. Des. 51(2): 362-394 (2017) - Ali Kassem, Yliès Falcone, Pascal Lafourcade:
Formal analysis and offline monitoring of electronic exams. Formal Methods Syst. Des. 51(1): 117-153 (2017) - Bettina Könighofer, Mohammed Alshiekh, Roderick Bloem, Laura R. Humphrey, Robert Könighofer, Ufuk Topcu, Chao Wang:
Shield synthesis. Formal Methods Syst. Des. 51(2): 332-361 (2017) - Igor Konnov, Marijana Lazic, Helmut Veith, Josef Widder:
Para2: parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms. Formal Methods Syst. Des. 51(2): 270-307 (2017) - Johann A. Makowsky, Anna Zamansky:
Keeping logic in the trivium of computer science: a teaching perspective. Formal Methods Syst. Des. 51(2): 419-430 (2017) - Patrick Moosbrugger, Kristin Y. Rozier, Johann Schumann:
R2U2: monitoring and diagnosis of security threats for unmanned aerial systems. Formal Methods Syst. Des. 51(1): 31-61 (2017) - Aina Niemetz, Mathias Preiner, Armin Biere:
Propagation based local search for bit-precise reasoning. Formal Methods Syst. Des. 51(3): 608-636 (2017) - Dung T. Phan, Junxing Yang, Radu Grosu, Scott A. Smolka, Scott D. Stoller:
Collision avoidance for mobile robots with limited sensing and limited information about moving obstacles. Formal Methods Syst. Des. 51(1): 62-86 (2017) - Srinivas Pinisetty, Viorel Preoteasa, Stavros Tripakis, Thierry Jéron, Yliès Falcone, Hervé Marchand:
Predictive runtime enforcement. Formal Methods Syst. Des. 51(1): 154-199 (2017) - Andrew Reynolds, Tim King, Viktor Kuncak:
Solving quantified linear arithmetic by counterexample-guided instantiation. Formal Methods Syst. Des. 51(3): 500-532 (2017) - Vu Xuan Tung, To Van Khanh, Mizuhito Ogawa:
raSAT: an SMT solver for polynomial constraints. Formal Methods Syst. Des. 51(3): 462-499 (2017)
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-05-28 15:30 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