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 47 matches
- 2021
- Julius Adelt, Timm Liebrenz, Paula Herber:
Formal Verification of Intelligent Hybrid Systems that are Modeled with Simulink and the Reinforcement Learning Toolbox. FM 2021: 349-366 - Gal Amram, Shahar Maoz, Or Pistiner, Jan Oliver Ringert
:
Efficient Algorithms for Omega-Regular Energy Games. FM 2021: 163-181 - Maurice H. ter Beek
Featured Team Automata. FM 2021: 483-502 - Jinting Bian
Integrating ADTs in KeY and Their Application to History-Based Reasoning. FM 2021: 255-272 - Frantisek Blahoudek, Murat Cubuktepe, Petr Novotný, Melkior Ornik, Pranay Thangeda, Ufuk Topcu:
Fuel in Markov Decision Processes (FiMDP): A Practical Approach to Consumption. FM 2021: 640-656 - Alexandra Bugariu, Arshavir Ter-Gabrielyan, Peter Müller:
Identifying Overly Restrictive Matching Patterns in SMT-Based Program Verifiers. FM 2021: 273-291 - Franck Cassez
Verification of the Incremental Merkle Tree Algorithm with Dafny. FM 2021: 445-462 - Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Petr Novotný, Jiri Zárevúcky, Dorde Zikelic:
On Lexicographic Proof Rules for Probabilistic Termination. FM 2021: 619-639 - Nicholas Coughlin, Kirsten Winter, Graeme Smith
Rely/Guarantee Reasoning for Multicopy Atomic Weak Memory Models. FM 2021: 292-310 - Adel Djoudi
Formal Verification of a JavaCard Virtual Machine with Frama-C. FM 2021: 427-444 - Oyendrila Dobe, Erika Ábrahám
HyperProb: A Model Checker for Probabilistic Hyperproperties. FM 2021: 657-666 - Simon Foster
Hybrid Systems Verification with Isabelle/HOL: Simpler Syntax, Better Models, Faster Proofs. FM 2021: 367-386 - Song Gao
Formal Verification of Consensus in the Taurus Distributed Database. FM 2021: 741-751 - Felipe Gorostiaga
HStriver: A Very Functional Extensible Tool for the Runtime Verification of Real-Time Event Streams. FM 2021: 563-580 - Matt Griffin
Verifying Secure Speculation in Isabelle/HOL. FM 2021: 43-60 - Rong Gu, Cristina Seceleanu
Model Checking Collision Avoidance of Nonlinear Autonomous Vehicles. FM 2021: 676-694 - Ernst Moritz Hahn
Model-Free Reinforcement Learning for Lexicographic Omega-Regular Objectives. FM 2021: 142-159 - Paula Herber, Timm Liebrenz, Julius Adelt:
Combining Forces: How to Formally Verify Informally Defined Embedded Systems. FM 2021: 3-22 - Weijiang Hong, Zhenbang Chen, Yide Du, Ji Wang:
Trace Abstraction-Based Verification for Uninterpreted Programs. FM 2021: 545-562 - Alexei Kopylov, Stefan Mitsch, Aleksey Nogin
Formally Verified Safety Net for Waypoint Navigation Neural Network Controllers. FM 2021: 122-141 - Panagiotis Kouvaros, Trent Kyono, Francesco Leofante, Alessio Lomuscio
Formal Analysis of Neural Network-Based Systems in the Aircraft Domain. FM 2021: 730-740 - Shankara Narayanan Krishna, Khushraj Madnani
Generalizing Non-punctuality for Timed Temporal Logic with Freeze Quantifiers. FM 2021: 182-199 - Yong Li
Congruence Relations for Büchi Automata. FM 2021: 465-482 - Anastasia Mavridou, Andreas Katis, Dimitra Giannakopoulou, David Kooi, Thomas Pressburger, Michael W. Whalen:
From Partial to Global Assume-Guarantee Contracts: Compositional Realizability Analysis in FRET. FM 2021: 503-523 - Marcel Moosbrugger
The Probabilistic Termination Tool Amber. FM 2021: 667-675 - Federico Mora, Murphy Berzish, Mitja Kulczynski
Z3str4: A Multi-armed String Solver. FM 2021: 389-406 - Grant Olney Passmore:
Some Lessons Learned in the Industrialization of Formal Methods for Financial Algorithms. FM 2021: 717-721 - Andrea Pferscher
Fingerprinting Bluetooth Low Energy Devices via Active Automata Learning. FM 2021: 524-542 - Yousaf Rahman, Md Tawhid Bin Waez, Yuming Niu:
Formally Guaranteed Tight Dynamic Future Occupancy of Autonomous Vehicles. FM 2021: 763-775 - Rim Saddem-Yagoubi, Pascal Poizat, Sara Houhou:
Business Processes Meet Spatial Concerns: The sBPMN Verification Framework. FM 2021: 218-234
skipping 17 more matches
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-12-22 17:22 CET 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
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: