![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.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 27 matches
- 2019
- Nils Jansen
, Laura R. Humphrey, Jana Tumova, Ufuk Topcu
:
Structured Synthesis for Probabilistic Systems. NFM 2019: 237-254 - Bernhard K. Aichernig
, Christian Burghard, Robert Korosec:
Learning-Based Testing of an Industrial Measurement Device. NFM 2019: 1-18 - Rylo Ashmore, Arie Gurfinkel
, Richard J. Trefler:
Local Reasoning for Parameterized First Order Protocols. NFM 2019: 36-53 - Benoît Barbot, Nicolas Basset, Thao Dang:
Generation of Signals Under Temporal Constraints for CPS Testing. NFM 2019: 54-70 - Suda Bharadwaj, Steven Carr, Natasha A. Neogi, Hasan Poonawala, Alejandro Barberia Chueca, Ufuk Topcu
:
Traffic Management for Urban Air Mobility. NFM 2019: 71-87 - Allan Blanchard
, Frédéric Loulergue
, Nikolai Kosmatov
:
Towards Full Proof Automation in Frama-C Using Auto-active Verification. NFM 2019: 88-105 - Matteo Busi
, Pierpaolo Degano
, Letterio Galletta
:
Using Standard Typing Algorithms Incrementally. NFM 2019: 106-122 - Chris Casinghino, J. T. Paasch, Cody Roux, John Altidor, Michael Dixon
, Dustin Jamner
:
Using Binary Analysis Frameworks: The Case for BAP and angr. NFM 2019: 123-129 - Jannik Dunkelau
, Sebastian Krings
, Joshua Schmidt
:
Automated Backend Selection for ProB Using Deep Learning. NFM 2019: 130-147 - Mathias Fleury
:
Optimizing a Verified SAT Solver. NFM 2019: 148-165 - Aman Goel
, Karem A. Sakallah:
Model Checking of Verilog RTL Using IC3 with Syntax-Guided Abstraction. NFM 2019: 166-185 - Rong Gu, Raluca Marinescu, Cristina Seceleanu
, Kristina Lundqvist:
Towards a Two-Layer Framework for Verifying Autonomous Vehicles. NFM 2019: 186-203 - Marijn J. H. Heule
, Benjamin Kiesl, Armin Biere
:
Clausal Proofs of Mutilated Chessboards. NFM 2019: 204-210 - Amjad Ibrahim, Severin Kacianka, Alexander Pretschner, Charles Hartsell, Gabor Karsai
:
Practical Causal Models for Cyber-Physical Systems. NFM 2019: 211-227 - Eleftherios Ioannidis, M. Frans Kaashoek, Nickolai Zeldovich:
Extracting and Optimizing Formally Verified Code for Systems Programming. NFM 2019: 228-236 - Mathias Claus Jensen, Anders Mariegaard, Kim Guldstrand Larsen
:
Symbolic Model Checking of Weighted PCTL Using Dependency Graphs. NFM 2019: 298-315 - Sudeep Kanav, Levi Lúcio, Christian Hilden, Thomas Schuetz:
Design and Runtime Verification Side-by-Side in eTrice. NFM 2019: 255-262 - Jürgen König, Heike Wehrheim:
Data Independence for Software Transactional Memory. NFM 2019: 263-279 - Mohsen Lesani:
Transaction Protocol Verification with Labeled Synchronization Logic. NFM 2019: 280-297 - Hakan Metin, Souheib Baarir, Fabrice Kordon:
Composing Symmetry Propagation and Effective Symmetry Breaking for SAT Solving. NFM 2019: 316-332 - Anitha Murugesan
, Mohammad Moghadamfalahi, Arunabh Chattopadhyay:
Formal Methods Assisted Training of Safe Reinforcement Learning Agents. NFM 2019: 333-340 - David E. Narváez
:
Formalizing CNF SAT Symmetry Breaking in PVS. NFM 2019: 341-354 - James Jerson Ortiz, Moussa Amrani, Pierre-Yves Schobbens
:
MLν: A Distributed Real-Time Modal Logic. NFM 2019: 19-35 - Yash Vardhan Pant, Rhudii A. Quaye, Houssam Abbas, Akarsh Varre, Rahul Mangharam:
Fly-by-Logic: A Tool for Unmanned Aircraft System Fleet Planning Using Temporal Logic. NFM 2019: 355-362 - Rocco Salvia, Laura Titolo
, Marco A. Feliú, Mariano M. Moscato, César A. Muñoz, Zvonimir Rakamaric:
A Mixed Real and Floating-Point Solver. NFM 2019: 363-370 - Masaki Waga
, Étienne André
:
Online Parametric Timed Pattern Matching with Automata-Based Skipping. NFM 2019: 371-389 - Julia M. Badger, Kristin Yvonne Rozier:
NASA Formal Methods - 11th International Symposium, NFM 2019, Houston, TX, USA, May 7-9, 2019, Proceedings. Lecture Notes in Computer Science 11460, Springer 2019, ISBN 978-3-030-20651-2 [contents]
loading more results
failed to load more results, please try again later
![](https://dblp.dagstuhl.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-20 10:17 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