![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
18th IFM 2023: Leiden, The Netherlands
- 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
Invited Presentations
- Erika Ábrahám
, József Kovács, Anne Remke:
SMT: Something You Must Try. 3-18
Analysis and Verification
- Marcel Moosbrugger
, Julian Müllner
, Laura Kovács
:
Automated Sensitivity Analysis for Probabilistic Loops. 21-39 - Marie-Christine Jakobs
, Tim Pollandt
:
diffDP: Using Data Dependencies and Properties in Difference Verification with Conditions. 40-61 - Rodrigo Otoni, Martin Blicha, Patrick Eugster, Natasha Sharygina:
CHC Model Validation with Proof Guarantees. 62-81 - Gidon Ernst
, Alexander Weigl
:
Verify This: Memcached - A Practical Long-Term Challenge for the Integration of Formal Methods. 82-89
Deductive Verification
- Yani Ziani
, Nikolai Kosmatov
, Frédéric Loulergue
, Daniel Gracia Pérez
, Téo Bernier
:
Towards Formal Verification of a TPM Software Stack. 93-112 - Marco Paganoni, Carlo A. Furia
:
Reasoning About Exceptional Behavior at the Level of Java Bytecode. 113-133 - Andy S. Tatman
, Hans-Dieter A. Hiep
, Stijn de Gouw
:
Analysis and Formal Specification of OpenJDK's BitSet. 134-152 - Lukas Armborst
, Sophie Lathouwers
, Marieke Huisman
:
Joining Forces! Reusing Contracts for Deductive Verifiers Through Automatic Translation. 153-171
Hardware and Memory Verification
- Lara Bargmann
, Heike Wehrheim
:
Lifting the Reasoning Level in Generic Weak Memory Verification. 175-192 - Miroslav N. Velev
:
Automatic Formal Verification of RISC-V Pipelined Microprocessors with Fault Tolerance by Spatial Redundancy at a High Level of Abstraction. 193-213 - Gerhard Schellhorn
, Stefan Bodenmüller
, Wolfgang Reif
:
Refinement and Separation: Modular Verification of Wandering Trees. 214-234
Verification and Learning
- Jannik Dunkelau
, Michael Leuschel
:
Performance Fuzzing with Reinforcement-Learning and Well-Defined Constraints for the B Method. 237-256 - Edi Muskardin
, Martin Tappler
, Bernhard K. Aichernig
, Ingo Pill
:
Reinforcement Learning Under Partial Observability Guided by Learned Environment Models. 257-276
Temporal Logics
- Jenna Elwing, Laura Gamboa-Guzman
, Jeremy Sorkin, Chiara Travesset, Zili Wang
, Kristin Yvonne Rozier
:
Mission-Time LTL (MLTL) Formula Validation via Regular Expressions. 279-301 - Alberto Bombardelli
, Alessandro Cimatti
, Stefano Tonetta
, Marco Zamboni:
Symbolic Model Checking of Relative Safety LTL Properties. 302-320 - Horatiu Cirstea, Stephan Merz:
Extending PlusCal for Modeling Distributed Algorithms. 321-340
Autonomous Systems
- 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. 343-363 - Mengwei Xu, Thibault Rivoalen, Blair Archibald, Michele Sevegnani:
CAN-verify: A Verification Tool For BDI Agents. 364-373
PhD Symposium Presentations
- Florian Lanzinger
, Joshua Bachmeier, Mattias Ulbrich
, Werner Dietl:
Scalable and Precise Refinement Types for Imperative Languages. 377-383 - Luc Edixhoven
:
Shuffling Posets on Trajectories. 384-390 - Artur Graczyk, Marialena Hadjikosti, Andrei Popescu:
A Framework for Verifying the Collision Freeness of Collaborative Robots (Work in Progress). 391-397
![](https://dblp1.uni-trier.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.