Остановите войну!
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 1,041 matches
- 2024
- Wolfgang Ahrendt, Frédéric Loulergue, Heike Wehrheim:
Introduction to the Special Collection from the International Conference on Tests and Proofs (TAP) 2020 and 2021. Formal Aspects Comput. 36(1): 1:1-1:2 (2024) - Bernhard K. Aichernig, Martin Tappler, Felix Wallner:
Benchmarking Combinations of Learning and Testing Algorithms for Automata Learning. Formal Aspects Comput. 36(1): 3:1-3:37 (2024) - Lokanna Kadakolmath, Umesh D. Ramu:
iStar Goal Model to Z Formal Model Translation and Model Checking of CBTC Moving Block Interlocking System. Formal Aspects Comput. 36(1): 6:1-6:45 (2024) - Dara Ly, Nikolai Kosmatov, Frédéric Loulergue, Julien Signoles:
Sound Runtime Assertion Checking for Memory Properties via Program Transformation. Formal Aspects Comput. 36(1): 4:1-4:46 (2024) - Bertrand Meyer, Alisa Arkadova, Alexander Kogtenkov:
The Concept of Class Invariant in Object-oriented Programming. Formal Aspects Comput. 36(1): 5:1-5:38 (2024) - Amirfarhad Nilizadeh, Gary T. Leavens, Corina S. Pasareanu, Yannic Noller:
JMLKelinci+: Detecting Semantic Bugs and Covering Branches with Valid Inputs Using Coverage-guided Fuzzing and Runtime Assertion Checking. Formal Aspects Comput. 36(1): 2:1-2:24 (2024) - Matteo Pradella:
Review on Verified Functional Programming in Agda: By Aaron Stump ACM, ISBN: 978-1-97000-126-6, 246 pages, 2016. Formal Aspects Comput. 36(1): 7:1-7:2 (2024) - 2023
- Yamine Aït-Ameur, Sergiy Bogomolov, Guillaume Dupont, Alexei Iliasov, Alexander B. Romanovsky, Paulius Stankaitis:
A Refinement-based Formal Development of Cyber-physical Railway Signalling Systems. Formal Aspects Comput. 35(1): 3:1 (2023) - Alen Arslanagic, Pavle Subotic, Jorge A. Pérez:
Bit-Vector Typestate Analysis. Formal Aspects Comput. 35(3): 19:1-19:36 (2023) - James Baxter, Gustavo Carvalho, Ana Cavalcanti, Francisco Rodrigues Júnior:
RoboWorld: Verification of Robotic Systems with Environment in the Loop. Formal Aspects Comput. 35(4): 26:1-26:46 (2023) - Martin de Boer, Stijn de Gouw, Jonas Klamroth, Christian Jung, Mattias Ulbrich, Alexander Weigl:
Formal Specification and Verification of JDK's Identity Hash Map Implementation. Formal Aspects Comput. 35(3): 18:1-18:26 (2023) - Zakaryae Boudi, Abderrahim Ait Wakrime, Mohamed Toub, Mohamed Haloua:
A Deep Reinforcement Learning Framework with Formal Verification. Formal Aspects Comput. 35(1): 5:1-5:17 (2023) - Mark Bouwman, Djurre van der Wal, Bas Luttik, Mariëlle Stoelinga, Arend Rensink:
A Case in Point: Verification and Testing of a EULYNX Interface. Formal Aspects Comput. 35(1): 2:1-2:38 (2023) - Alexandra Bugariu, Arshavir Ter-Gabrielyan, Peter Müller:
Identifying Overly Restrictive Matching Patterns in SMT-based Program Verifiers (Extended Version). Formal Aspects Comput. 35(2): 7:1-7:27 (2023) - Arthur Charguéraud:
Review on Functional Algorithms, Verified!: By Tobias Nipkow, Jasmin Blanchette, Manuel Eberl, Alejandro Gómez-Londoño, Peter Lammich, Christian Sternagel, Simon Wimmer, and Bohua Zhan Freely downloadable: https://functional-algorithms-verified.org. Formal Aspects Comput. 35(2): 13:1-13:2 (2023) - Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Petr Novotný, Jiri Zárevúcky, Dorde Zikelic:
On Lexicographic Proof Rules for Probabilistic Termination. Formal Aspects Comput. 35(2): 11:1-11:25 (2023) - Nicholas Coughlin, Kirsten Winter, Graeme Smith:
Compositional Reasoning for Non-multicopy Atomic Architectures. Formal Aspects Comput. 35(2): 8:1-8:30 (2023) - Simon Collart Dutilleul, Anne E. Haxthausen, Thierry Lecomte, Jim Woodcock:
Introduction to the Special Section on Reliability, Safety, and Security of Railway Systems. Formal Aspects Comput. 35(1): 1:1-1:2 (2023) - Yuan Fei, Huibiao Zhu, Jiaqi Yin:
FVF-AKA: A Formal Verification Framework of AKA Protocols for Multi-server IoT. Formal Aspects Comput. 35(4): 21:1-21:36 (2023) - Ernst Moritz Hahn, Mateo Perez, Sven Schewe, Fabio Somenzi, Ashutosh Trivedi, Dominik Wojtczak:
Multi-objective ω-Regular Reinforcement Learning. Formal Aspects Comput. 35(2): 12:1-12:24 (2023) - Anne Elisabeth Haxthausen, Alessandro Fantechi:
Compositional Verification of Railway Interlocking Systems. Formal Aspects Comput. 35(1): 4:1-4:46 (2023) - Marieke Huisman, Corina S. Pasareanu, Naijun Zhan:
Introduction to the Special Section on FM 2021. Formal Aspects Comput. 35(2): 6:1-6:2 (2023) - Heiko Klare, Joshua Gleitze:
Termination and Expressiveness of Execution Strategies for Networks of Bidirectional Model Transformations. Formal Aspects Comput. 35(3): 15:1-15:35 (2023) - Shankara Narayanan Krishna, Khushraj Madnani, Manuel Mazo Jr., Paritosh K. Pandya:
From Non-punctuality to Non-adjacency: A Quest for Decidability of Timed Temporal Logics with Quantifiers. Formal Aspects Comput. 35(2): 9:1-9:50 (2023) - Maria Maximova, Sven Schneider, Holger Giese:
Compositional Analysis of Probabilistic Timed Graph Transformation Systems. Formal Aspects Comput. 35(3): 16:1-16:79 (2023) - Jan Bækgaard Pedersen, Kevin Chalmers:
Toward Verifying Cooperatively Scheduled Runtimes Using CSP. Formal Aspects Comput. 35(4): 22:1-22:45 (2023) - Quan Sun, David N. Jansen, Xinxin Liu, Wei Zhang:
Rooted Divergence-Preserving Branching Bisimilarity is a Congruence for Guarded CCS. Formal Aspects Comput. 35(4): 25:1-25:21 (2023) - Daniel Wright, Sadegh Dalvandi, Mark Batty, Brijesh Dongol:
Mechanised Operational Reasoning for C11 Programs with Relaxed Dependencies. Formal Aspects Comput. 35(2): 10:1-10:27 (2023) - Feng Zhang, Leping Zhang, Yongwang Zhao, Yang Liu, Jun Sun:
Refinement-based Specification and Analysis of Multi-core ARINC 653 Using Event-B. Formal Aspects Comput. 35(4): 24:1-24:29 (2023) - Bartosz Zielinski:
Explanatory Denotational Semantics for Complex Event Patterns. Formal Aspects Comput. 35(4): 23:1-23:37 (2023)
skipping 1,011 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-07-06 04:43 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