Остановите войну!
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 30 matches
- 2023
- Radu Traian Bobe, Florentin Ipate, Ionut-Mihai Niculescu:
Modelling and Search-Based Testing of Robot Controllers Using Enzymatic Numerical P Systems. FROM 2023: 1-10 - Alen Docef, Radu Negulescu, Mihai Prunescu:
Using Z3 to Verify Inferences in Fragments of Linear Logic. FROM 2023: 11-25 - Gabriel Istrate, Romeo Negrea:
q-Overlaps in the Random Exact Cover Problem. FROM 2023: 26-40 - Dorel Lucanu:
Matching-Logic-Based Understanding of Polynomial Functors and their Initial/Final Models. FROM 2023: 41-55 - Bogdan Macovei:
A Parallel Dynamic Epistemic Perspective over Muddy Children Puzzle. FROM 2023: 56-64 - Mircea Marin, Temur Kutsia, Cleo Pau, Mikheil Rukhaia:
Enumerating All Maximal Clique-Partitions of an Undirected Graph. FROM 2023: 65-79 - Maria J. D. Lima, Flávio L. C. de Moura:
A Formalized Extension of the Substitution Lemma in Coq. FROM 2023: 80-95 - David Nowak, Vlad Rusu:
While Loops in Coq. FROM 2023: 96-109 - Mihail-Iulian Plesa, Marian Gheorghe, Florentin Ipate:
Privacy-preserving Linear Computations in Spiking Neural P Systems. FROM 2023: 110-119 - Mihai Prunescu:
Symmetric Functions over Finite Fields. FROM 2023: 131-143 - Stefan-Claudiu Susan, Andrei Arusoaie:
Identifying Vulnerabilities in Smart Contracts using Interval Analysis. FROM 2023: 144-151 - Dafina Trufas, Ioan Teodorescu, Denisa Diaconescu, Traian Serbanuta, Vlad Zamfir:
Asynchronous Muddy Children Puzzle (work in progress). FROM 2023: 152-166 - Andreea Postovan, Madalina Erascu:
Benchmarking Local Robustness of High-Accuracy Binary Neural Networks for Enhanced Traffic Sign Recognition. FROM 2023: 120-130 - Horatiu Cheval, Laurentiu Leustean, Andrei Sipos:
Proceedings 7th Symposium on Working Formal Methods, FROM 2023, Bucharest, Romania, 21-22 September 2023. EPTCS 389, 2023 [contents] - 2022
- Andrei Arusoaie, Dorel Lucanu:
Proof-Carrying Parameters in Certified Symbolic Execution: The Case Study of Antiunification. FROM 2022: 1-16 - Péter Bereczky, Xiaohong Chen, Dániel Horpácsi, Tamás Bálint Mizsei, Lucas Peña, Jan Tusil:
Mechanizing Matching Logic in Coq. FROM 2022: 17-36 - Georgian-Vlad Saioc, Hans Hüttel:
A Tool for Describing and Checking Natural Semantics Definitions of Programming Languages. FROM 2022: 51-66 - Wolfgang Jeltsch, Javier Díaz:
Correctness of Broadcast via Multicast: Graphically and Formally. FROM 2022: 37-50 - Nils Timm, Josua Botha:
Synthesis of Cost-Optimal Multi-Agent Systems for Resource Allocation. FROM 2022: 67-82 - Vlad Rusu:
Proceedings of the Sixth Working Formal Methods Symposium, FROM 2022, "Al. I. Cuza University", Iasi, Romania, 19-20 September, 2022. EPTCS 369, 2022 [contents] - 2019
- Ioana Leustean, Natalia Moanga, Traian-Florin Serbanuta:
From Hybrid Modal Logic to Matching Logic and back. FROM 2019: 16-31 - Cezar-Constantin Andrici, Stefan Ciobaca:
Verifying the DPLL Algorithm in Dafny. FROM 2019: 3-15 - Vlad Rusu, David Nowak:
(Co)inductive Proof Systems for Compositional Proofs in Reachability Logic. FROM 2019: 32-47 - Georgiana Caltais:
Explaining SDN Failures via Axiomatisations. FROM 2019: 48-60 - Georgiana Surlea, Adrian Craciun:
Gröbner Bases with Reduction Machines. FROM 2019: 61-75 - Isabela Dramnesc, Tudor Jebelean:
Proof-Based Synthesis of Sorting Algorithms Using Multisets in Theorema. FROM 2019: 76-91 - Bogdan Aman, Gabriel Ciobanu:
Probabilities in Session Types. FROM 2019: 92-106 - Lorenzo Capra:
An Operational Semantics of Graph Transformation Systems Using Symmetric Nets. FROM 2019: 107-119 - Andrei Alexandru, Gabriel Ciobanu:
Finitely Supported Sets Containing Infinite Uniformly Supported Subsets. FROM 2019: 120-134 - Mircea Marin, Adrian Craciun:
Proceedings Third Symposium on Working Formal Methods, FROM 2019, Timişoara, Romania, 3-5 September 2019. EPTCS 303, 2019 [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-06-03 20:08 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