Zobrazeno 1 - 10
of 103
pro vyhledávání: '"Neider, D."'
Virtually all verification and synthesis techniques assume that the formal specifications are readily available, functionally correct, and fully match the engineer's understanding of the given system. However, this assumption is often unrealistic in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______1874::30eb7f8ef07edd13dceb8e2461ff60f6
https://hdl.handle.net/21.11116/0000-000A-BF32-721.11116/0000-000A-BF34-5
https://hdl.handle.net/21.11116/0000-000A-BF32-721.11116/0000-000A-BF34-5
We consider the problem of explaining the temporal behavior of black-boxsystems using human-interpretable models. To this end, based on recent researchtrends, we rely on the fundamental yet interpretable models of deterministicfinite automata (DFAs)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______1874::40fbacab729cce1b34b4ef15c5980c47
https://hdl.handle.net/21.11116/0000-000B-4703-221.11116/0000-000B-4705-0
https://hdl.handle.net/21.11116/0000-000B-4703-221.11116/0000-000B-4705-0
Publikováno v:
Tools and Algorithms for the Construction and Analysis of Systems
Lecture Notes in Computer Science
Lecture Notes in Computer Science
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______1874::4a4448f1d134a2de1550c38aeec3e50b
https://hdl.handle.net/21.11116/0000-000A-9951-E21.11116/0000-000A-9953-C
https://hdl.handle.net/21.11116/0000-000A-9951-E21.11116/0000-000A-9953-C
Autor:
Barbot, B., Bollig, B., Finkel, A., Haddad, S., Khmelnitsky, I., Leucker, M., Neider, D., Roy, R., Ye, L.
Publikováno v:
Proceedings of the Fifteenth International Conference on Grammatical Inference
Proceedings of the Machine Learning
Proceedings of the Machine Learning
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______1874::2a109a82edb34d505821cf6e997aa179
https://hdl.handle.net/21.11116/0000-000A-996A-321.11116/0000-000A-996C-1
https://hdl.handle.net/21.11116/0000-000A-996A-321.11116/0000-000A-996C-1
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Margaria, T. (ed.), Models, Mindsets, Meta: The What, the How, and the Why Not?: Essays Dedicated to Bernhard Steffen on the Occasion of His 60th Birthday, pp. 390-416
Lecture notes in computer science ; 11200, 390-416. Cham : Springer
STARTPAGE=390;ENDPAGE=416;TITLE=Lecture notes in computer science ; 11200
Lecture Notes in Computer Science ISBN: 9783030223472
Models, Mindsets, Meta
Lecture notes in computer science ; 11200, 390-416. Cham : Springer
STARTPAGE=390;ENDPAGE=416;TITLE=Lecture notes in computer science ; 11200
Lecture Notes in Computer Science ISBN: 9783030223472
Models, Mindsets, Meta
We describe a large collection of benchmarks, publicly available through the wiki automata.cs.ru.nl, of different types of state machine models: DFAs, Moore machines, Mealy machines, interface automata and register automata. Our repository includes b
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::36c20db8a0851a21453cd709272b0f4e
https://hdl.handle.net/2066/204557
https://hdl.handle.net/2066/204557
Publikováno v:
Neuropsychiatric Disease and Treatment, Vol 2016, Iss Issue 1, Pp 1711-1714 (2016)
Daniel Neider, Leif H Lindström, Robert Bodén Department of Neuroscience, Psychiatry, Uppsala University, Uppsala University Hospital, Uppsala, Sweden Background: The objective of this study was to investigate the association between 5-hydroxyindol
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doajarticles::3a6386747ffba67a7c6f725ae648ac6f
https://www.dovepress.com/risk-factors-for-suicide-among-patients-with-schizophrenia-a-cohort-st-peer-reviewed-article-NDT
https://www.dovepress.com/risk-factors-for-suicide-among-patients-with-schizophrenia-a-cohort-st-peer-reviewed-article-NDT
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
We propose a framework for synthesizing inductive invariants for incomplete verification engines, which soundly reduce logical problems in undecidable theories to decidable theories. Our framework is based on the counter-example guided inductive synt
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______1874::545250a0f6037ac6812992aea27848a1
https://hdl.handle.net/21.11116/0000-0000-7652-F21.11116/0000-0000-7650-1
https://hdl.handle.net/21.11116/0000-0000-7652-F21.11116/0000-0000-7650-1