Остановите войну!
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 30 matches
- 2023
- Kevin Leahy, Makai Mann, Cristian-Ioan Vasile:
Rewrite-Based Decomposition of Signal Temporal Logic Specifications. NFM 2023: 224-240 - Zsófia Ádám, Ignacio D. Lopez-Miguel, Anastasia Mavridou, Thomas Pressburger, Marcin Bes, Enrique Blanco Viñuela, Andreas Katis, Jean-Charles Tournier, Khanh V. Trinh, Borja Fernández Adiego:
From Natural Language Requirements to the Verification of Programmable Logic Controllers: Integrating FRET into PLCverif. NFM 2023: 353-360 - Andrei Aleksandrov, Kim Völlinger:
Formalizing Piecewise Affine Activation Functions of Neural Networks in Coq. NFM 2023: 62-78 - Blair Archibald, Muffy Calder, Michele Sevegnani, Mengwei Xu:
Quantitative Verification and Strategy Synthesis for BDI Agents. NFM 2023: 241-259 - Apurva Badithela, Josefine B. Graebener, Inigo Incer, Richard M. Murray:
Reasoning over Test Specifications Using Assume-Guarantee Contracts. NFM 2023: 278-294 - Christel Baier, Clemens Dubslaff, Patrick Wienhöft, Stefan J. Kiebel:
Strategy Synthesis in Markov Decision Processes Under Limited Sampling Access. NFM 2023: 86-103 - Alberto Bombardelli, Stefano Tonetta:
Reasoning with Metric Temporal Logic and Resettable Skewed Clocks. NFM 2023: 174-190 - Md. Solimul Chowdhury, Cayden R. Codel, Marijn J. H. Heule:
A Linear Weight Transfer Rule for Local Search. NFM 2023: 447-463 - Matthew Cleaveland, Oleg Sokolsky, Insup Lee, Ivan Ruchkin:
Conservative Safety Monitors of Stochastic Dynamical Systems. NFM 2023: 140-156 - Simon Dierl, Falk Maria Howar, Sean Kauffman, Martin Kristjansen, Kim Guldstrand Larsen, Florian Lorber, Malte Mauritz:
Learning Symbolic Timed Models from Concrete Timed Data. NFM 2023: 104-121 - Aleksandr Fedchin, Tyler Dean, Jeffrey S. Foster, Eric Mercer, Zvonimir Rakamaric, Giles Reger, Neha Rungta, Robin Salkeld, Lucas Wagner, Cassidy Waldrip:
A Toolkit for Automated Testing of Dafny. NFM 2023: 397-413 - Bernd Finkbeiner, Hadar Frenkel, Jana Hofmann, Janine Lohse:
Automata-Based Software Model Checking of Hyperproperties. NFM 2023: 361-379 - Alexandra Forsey-Smerek, Ho Chit Siu, Kevin Leahy:
Centralized Multi-agent Synthesis with Spatial Constraints via Mixed-Integer Quadratic Programming. NFM 2023: 191-206 - Anna Fritz, Perry Alexander:
A Framework for Policy Based Negotiation. NFM 2023: 207-223 - William L. Harrison, Ian Blumenfeld, Eric Bond, Chris Hathhorn, Paul Li, May Torrence, Jared Ziegler:
Formalized High Level Synthesis with Applications to Cryptographic Hardware. NFM 2023: 332-352 - Elias Khalife, Pierre-Loïc Garoche, Mazen Farhood:
Code-Level Formal Verification of Ellipsoidal Invariant Sets for Linear Parameter-Varying Systems. NFM 2023: 157-173 - Niklas Kochdumper, Christian Schilling, Matthias Althoff, Stanley Bak:
Open- and Closed-Loop Neural Network Verification Using Polynomial Zonotopes. NFM 2023: 16-36 - Sam Lasser, Chris Casinghino, Derek Egolf, Kathleen Fisher, Cody Roux:
Verified ALL(*) Parsing with Semantic Actions and Dynamic Input Validation. NFM 2023: 414-429 - Enrico Lipparini, Stefan Ratschan:
Satisfiability of Non-linear Transcendental Arithmetic as a Certificate Search Problem. NFM 2023: 472-488 - Cong Liu, Darren D. Cofer, Denis Osipychev:
Verifying an Aircraft Collision Avoidance Neural Network with Marabou. NFM 2023: 79-85 - Felipe Lisboa Malaquias, Mihail Asavoae, Florian Brandner:
From the Standards to Silicon: Formally Proved Memory Controllers. NFM 2023: 295-311 - Farzaneh Moradkhani, Connor Fibich, Martin Fränzle:
Verification of LSTM Neural Networks with Non-linear Activation Functions. NFM 2023: 1-15 - Satoshi Munakata, Caterina Urban, Haruki Yokoyama, Koji Yamamoto, Kazuki Munakata:
Verifying Attention Robustness of Deep Neural Networks Against Semantic Perturbations. NFM 2023: 37-61 - Jasper Nalbach, Erika Ábrahám:
Subtropical Satisfiability for SMT Solving. NFM 2023: 430-446 - Marian Qian, Stefan Mitsch:
Reward Shaping from Hybrid Systems Models in Reinforcement Learning. NFM 2023: 122-139 - Peter Riviere, Neeraj Kumar Singh, Yamine Aït Ameur, Guillaume Dupont:
Formalising Liveness Properties in Event-B with the Reflexive EB4EB Framework. NFM 2023: 312-331 - Thomas Robinson, Guoxin Su:
Multi-objective Task Assignment and Multiagent Planning with Hybrid GPU-CPU Acceleration. NFM 2023: 260-277 - Bat-Chen Rothenberg, Orna Grumberg, Yakir Vizel, Eytan Singher:
Condition Synthesis Realizability via Constrained Horn Clauses. NFM 2023: 380-396 - Steffan Christ Sølvsten, Jaco van de Pol:
Adiar 1.1 - Zero-Suppressed Decision Diagrams in External Memory. NFM 2023: 464-471 - Kristin Yvonne Rozier, Swarat Chaudhuri:
NASA Formal Methods - 15th International Symposium, NFM 2023, Houston, TX, USA, May 16-18, 2023, Proceedings. Lecture Notes in Computer Science 13903, Springer 2023, ISBN 978-3-031-33169-5 [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-05-25 17:47 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