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 29 matches
- 2019
- Wil M. P. van der Aalst:
Object-Centric Process Mining: Dealing with Divergence and Convergence in Event Data. SEFM 2019: 3-25 - Luca Aceto, Antonis Achilleos, Adrian Francalanza, Anna Ingólfsdóttir, Karoliina Lehtinen:
An Operational Guide to Monitorability. SEFM 2019: 433-453 - Hugo Leonardo da Silva Araujo, Gustavo Carvalho, Mohammad Reza Mousavi, Augusto Sampaio:
Multi-objective Search for Effective Testing of Cyber-Physical Systems. SEFM 2019: 183-202 - Florent Avellaneda, Alexandre Petrenko:
Learning Minimal DFA: Taking Inspiration from RPNI to Improve SAT Approach. SEFM 2019: 243-256 - Ezio Bartocci, Niveditha Manjunath, Leonardo Mariani, Cristinel Mateis, Dejan Nickovic:
Automatic Failure Explanation in CPS Models. SEFM 2019: 69-86 - Bernhard Beckert, Thorsten Bormer, Stephan Gocht, Mihai Herda, Daniel Lentzsch, Mattias Ulbrich:
Using Relational Verification for Program Slicing. SEFM 2019: 353-372 - Paul Maximilian Bittner, Thomas Thüm, Ina Schaefer:
SAT Encodings of the At-Most-k Constraint - A Case Study on Configuring University Courses. SEFM 2019: 127-144 - Mario Bravetti, Gianluigi Zavattaro:
Relating Session Types and Behavioural Contracts: The Asynchronous Case. SEFM 2019: 29-47 - Achim D. Brucker, Burkhart Wolff:
Isabelle/DOF: Design and Implementation. SEFM 2019: 275-292 - Luís Carvalho, João Costa Seco:
Software Evolution with a Typeful Version Control System. SEFM 2019: 145-161 - Clemens Dubslaff:
Compositional Feature-Oriented Systems. SEFM 2019: 162-180 - Yassmeen Elderhalli, Matthias Volk, Osman Hasan, Joost-Pieter Katoen, Sofiène Tahar:
Formal Verification of Rewriting Rules for Dynamic Fault Trees. SEFM 2019: 513-531 - Marie Farrell, Matthew Bradbury, Michael Fisher, Louise A. Dennis, Clare Dixon, Hu Yuan, Carsten Maple:
Using Threat Analysis Techniques to Guide Formal Verification: A Case Study of Cooperative Awareness Messages. SEFM 2019: 471-490 - Andreas Fellner, Mitra Tabaei Befrouei, Georg Weissenbacher:
Mutation Testing with Hyperproperties. SEFM 2019: 203-221 - Michael Foster, Achim D. Brucker, Ramsay G. Taylor, Siobhán North, John Derrick:
Incorporating Data into EFSM Inference. SEFM 2019: 257-272 - Mario Gleirscher, Simon Foster, Yakoub Nemouchi:
Evolution of Formal Model-Based Assurance Cases for Autonomous Robots. SEFM 2019: 87-104 - Eduard Kamburjan, Crystal Chang Din, Reiner Hähnle, Einar Broch Johnsen:
Asynchronous Cooperative Contracts for Cooperative Scheduling. SEFM 2019: 48-66 - Yusuke Kawamoto:
Towards Logical Specification of Statistical Machine Learning. SEFM 2019: 293-311 - Raluca Lefticaru, Robert M. Hierons, Manuel Núñez:
An Implementation Relation for Cyclic Systems with Refusals and Discrete Time. SEFM 2019: 393-409 - Daniel Bristot de Oliveira, Tommaso Cucinotta, Rômulo Silva de Oliveira:
Efficient Formal Verification for the Linux Kernel. SEFM 2019: 315-332 - Dorottya Papp, Thorsten Tarrach, Levente Buttyán:
Towards Detecting Trigger-Based Behavior in Binaries: Uncovering the Correct Environment. SEFM 2019: 491-509 - I. S. W. B. Prasetya, Rick Klomp:
Test Model Coverage Analysis Under Uncertainty. SEFM 2019: 222-239 - Martin Ring, Christoph Lüth:
Let's Prove It Later - Verification at Different Points in Time. SEFM 2019: 454-468 - Petr Rockai, Zuzana Baranová, Jan Mrázek, Katarína Kejstová, Jiri Barnat:
Reproducible Execution of POSIX Programs with DiOS. SEFM 2019: 333-349 - Luka Le Roux, Ciprian Teodorov:
Partially Bounded Context-Aware Verification. SEFM 2019: 532-548 - Vladimír Still, Jiri Barnat:
Local Nontermination Detection for Parallel C++ Programs. SEFM 2019: 373-390 - Anton Wijs, Maciej Wilkowski:
Modular Indirect Push-Button Formal Verification of Multi-threaded Code Generators. SEFM 2019: 410-429 - Xingyu Zhao, Matthew Osborne, Jenny Lantair, Valentin Robu, David Flynn, Xiaowei Huang, Michael Fisher, Fabio Papacchini, Angelo Ferrando:
Towards Integrating Formal Verification of Autonomous Robots with Battery Prognostics and Health Management. SEFM 2019: 105-124 - Peter Csaba Ölveczky, Gwen Salaün:
Software Engineering and Formal Methods - 17th International Conference, SEFM 2019, Oslo, Norway, September 18-20, 2019, Proceedings. Lecture Notes in Computer Science 11724, Springer 2019, ISBN 978-3-030-30445-4 [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-11-16 14:09 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