Остановите войну!
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 565 matches
- 2024
- Paula Herber, Anton Wijs:
iFM 2023 - 18th International Conference, iFM 2023, Leiden, The Netherlands, November 13-15, 2023, Proceedings. Lecture Notes in Computer Science 14300, Springer 2024, ISBN 978-3-031-47704-1 [contents] - 2023
- Erika Ábrahám, József Kovács, Anne Remke:
SMT: Something You Must Try. iFM 2023: 3-18 - Lukas Armborst, Sophie Lathouwers, Marieke Huisman:
Joining Forces! Reusing Contracts for Deductive Verifiers Through Automatic Translation. iFM 2023: 153-171 - Lara Bargmann, Heike Wehrheim:
Lifting the Reasoning Level in Generic Weak Memory Verification. iFM 2023: 175-192 - Alberto Bombardelli, Alessandro Cimatti, Stefano Tonetta, Marco Zamboni:
Symbolic Model Checking of Relative Safety LTL Properties. iFM 2023: 302-320 - Horatiu Cirstea, Stephan Merz:
Extending PlusCal for Modeling Distributed Algorithms. iFM 2023: 321-340 - Jannik Dunkelau, Michael Leuschel:
Performance Fuzzing with Reinforcement-Learning and Well-Defined Constraints for the B Method. iFM 2023: 237-256 - Luc Edixhoven:
Shuffling Posets on Trajectories. iFM 2023: 384-390 - Jenna Elwing, Laura Gamboa-Guzman, Jeremy Sorkin, Chiara Travesset, Zili Wang, Kristin Yvonne Rozier:
Mission-Time LTL (MLTL) Formula Validation via Regular Expressions. iFM 2023: 279-301 - Gidon Ernst, Alexander Weigl:
Verify This: Memcached - A Practical Long-Term Challenge for the Integration of Formal Methods. iFM 2023: 82-89 - Artur Graczyk, Marialena Hadjikosti, Andrei Popescu:
A Framework for Verifying the Collision Freeness of Collaborative Robots (Work in Progress). iFM 2023: 391-397 - Marie-Christine Jakobs, Tim Pollandt:
diffDP: Using Data Dependencies and Properties in Difference Verification with Conditions. iFM 2023: 40-61 - Florian Lanzinger, Joshua Bachmeier, Mattias Ulbrich, Werner Dietl:
Scalable and Precise Refinement Types for Imperative Languages. iFM 2023: 377-383 - Marcel Moosbrugger, Julian Müllner, Laura Kovács:
Automated Sensitivity Analysis for Probabilistic Loops. iFM 2023: 21-39 - Edi Muskardin, Martin Tappler, Bernhard K. Aichernig, Ingo Pill:
Reinforcement Learning Under Partial Observability Guided by Learned Environment Models. iFM 2023: 257-276 - Rodrigo Otoni, Martin Blicha, Patrick Eugster, Natasha Sharygina:
CHC Model Validation with Proof Guarantees. iFM 2023: 62-81 - Marco Paganoni, Carlo A. Furia:
Reasoning About Exceptional Behavior at the Level of Java Bytecode. iFM 2023: 113-133 - Juliane Päßler, Maurice H. ter Beek, Ferruccio Damiani, Silvia Lizeth Tapia Tarifa, Einar Broch Johnsen:
Formal Modelling and Analysis of a Self-Adaptive Robotic System. iFM 2023: 343-363 - Gerhard Schellhorn, Stefan Bodenmüller, Wolfgang Reif:
Refinement and Separation: Modular Verification of Wandering Trees. iFM 2023: 214-234 - Andy S. Tatman, Hans-Dieter A. Hiep, Stijn de Gouw:
Analysis and Formal Specification of OpenJDK's BitSet. iFM 2023: 134-152 - Miroslav N. Velev:
Automatic Formal Verification of RISC-V Pipelined Microprocessors with Fault Tolerance by Spatial Redundancy at a High Level of Abstraction. iFM 2023: 193-213 - Mengwei Xu, Thibault Rivoalen, Blair Archibald, Michele Sevegnani:
CAN-verify: A Verification Tool For BDI Agents. iFM 2023: 364-373 - Yani Ziani, Nikolai Kosmatov, Frédéric Loulergue, Daniel Gracia Pérez, Téo Bernier:
Towards Formal Verification of a TPM Software Stack. iFM 2023: 93-112 - Astrid Rakow, Mehrnoush Hajnorouzi, Akhila Bairy:
What to tell when? - Information Provision as a Game. FMAS@iFM 2023: 1-9 - Asieh Salehi Fathabadi, Vahid Yazdanpanah:
Trust Modelling and Verification Using Event-B. FMAS@iFM 2023: 10-16 - Jan Roßbach, Michael Leuschel:
Certified Control for Train Sign Classification. FMAS@iFM 2023: 69-76 - Christopher Chandler, Bernd Porr, Alice Miller, Giulia Lafratta:
Model Checking for Closed-Loop Robot Reactive Planning. FMAS@iFM 2023: 77-94 - Sergiy Bogomolov, Taylor T. Johnson, Diego Manzanas Lopez, Patrick Musau, Paulius Stankaitis:
Online Reachability Analysis and Space Convexification for Autonomous Racing. FMAS@iFM 2023: 95-112 - Srajan Goyal, Alberto Griggio, Jacob Kimblad, Stefano Tonetta:
Automatic Generation of Scenarios for System-level Simulation-based Verification of Autonomous Driving Systems. FMAS@iFM 2023: 113-129 - Christopher Bischopink:
Enforcing Timing Properties in Motorway Traffic. FMAS@iFM 2023: 130-143
skipping 535 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-05-26 18:48 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