Zobrazeno 1 - 10
of 319
pro vyhledávání: '"Sokolsky O"'
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:
Automated Technology for Verification and Analysis ISBN: 9783030591519
ATVA
Hung, D.V.; Sokolsky, O. (ed.), Automated Technology for Verification and Analysis: 18th International Symposium, ATVA 2020, Hanoi, Vietnam, October 19–23, 2020, Proceedings, 271-287. Cham : Springer International Publishing
STARTPAGE=271;ENDPAGE=287;ISSN=0302-9743;TITLE=Hung, D.V.; Sokolsky, O. (ed.), Automated Technology for Verification and Analysis: 18th International Symposium, ATVA 2020, Hanoi, Vietnam, October 19–23, 2020, Proceedings
Hung, D.V.; Sokolsky, O. (ed.), Automated Technology for Verification and Analysis: 18th International Symposium, ATVA 2020, Hanoi, Vietnam, October 19–23, 2020, Proceedings, pp. 271-287
Lecture notes in computer science
ATVA
Hung, D.V.; Sokolsky, O. (ed.), Automated Technology for Verification and Analysis: 18th International Symposium, ATVA 2020, Hanoi, Vietnam, October 19–23, 2020, Proceedings, 271-287. Cham : Springer International Publishing
STARTPAGE=271;ENDPAGE=287;ISSN=0302-9743;TITLE=Hung, D.V.; Sokolsky, O. (ed.), Automated Technology for Verification and Analysis: 18th International Symposium, ATVA 2020, Hanoi, Vietnam, October 19–23, 2020, Proceedings
Hung, D.V.; Sokolsky, O. (ed.), Automated Technology for Verification and Analysis: 18th International Symposium, ATVA 2020, Hanoi, Vietnam, October 19–23, 2020, Proceedings, pp. 271-287
Lecture notes in computer science
We give a formal verification procedure that decides whether a classifier ensemble is robust against arbitrary randomized attacks. Such attacks consist of a set of deterministic attacks and a distribution over this set. The robustness-checking proble
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::eee66a3999bc32938af27ff292a02a59
https://doi.org/10.1007/978-3-030-59152-6_15
https://doi.org/10.1007/978-3-030-59152-6_15
Autor:
Češka, M., Dehnert, C., Jansen, Nils, Junges, J.S.L., Katoen, J.-P., Bartocci, E., Cleaveland, R., Grosu, R., Sokolsky, O.
Publikováno v:
From Reactive Systems to Cyber-Physical Systems ISBN: 9783030315139
From Reactive Systems to Cyber-Physical Systems
Bartocci, E.; Cleaveland, R.; Grosu, R. (ed.), From Reactive Systems to Cyber-Physical Systems: Essays Dedicated to Scott A. Smolka on the Occasion of His 65th Birthday, pp. 107-125
Bartocci, E.; Cleaveland, R.; Grosu, R. (ed.), From Reactive Systems to Cyber-Physical Systems: Essays Dedicated to Scott A. Smolka on the Occasion of His 65th Birthday, 107-125. Cham : Springer International Publishing
STARTPAGE=107;ENDPAGE=125;TITLE=Bartocci, E.; Cleaveland, R.; Grosu, R. (ed.), From Reactive Systems to Cyber-Physical Systems: Essays Dedicated to Scott A. Smolka on the Occasion of His 65th Birthday
From Reactive Systems to Cyber-Physical Systems-Essays Dedicated to Scott A. Smolka on the Occasion of His 65th Birthday
From Reactive Systems to Cyber-Physical Systems
Bartocci, E.; Cleaveland, R.; Grosu, R. (ed.), From Reactive Systems to Cyber-Physical Systems: Essays Dedicated to Scott A. Smolka on the Occasion of His 65th Birthday, pp. 107-125
Bartocci, E.; Cleaveland, R.; Grosu, R. (ed.), From Reactive Systems to Cyber-Physical Systems: Essays Dedicated to Scott A. Smolka on the Occasion of His 65th Birthday, 107-125. Cham : Springer International Publishing
STARTPAGE=107;ENDPAGE=125;TITLE=Bartocci, E.; Cleaveland, R.; Grosu, R. (ed.), From Reactive Systems to Cyber-Physical Systems: Essays Dedicated to Scott A. Smolka on the Occasion of His 65th Birthday
From Reactive Systems to Cyber-Physical Systems-Essays Dedicated to Scott A. Smolka on the Occasion of His 65th Birthday
This paper outlines two approaches|based on counterexample-guided abstraction refinement (CEGAR) and counterexample-guided inductive synthesis (CEGIS), respectively to the automated synthesis of finite-state probabilistic models and programs. Our CEG
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d18c4088488f08d9ff2dc1e33cbf5c61
https://doi.org/10.1007/978-3-030-31514-6_7
https://doi.org/10.1007/978-3-030-31514-6_7
Publikováno v:
In Electronic Notes in Theoretical Computer Science October 2001 55(2):218-235
Publikováno v:
Theoretical Computer Science
Theor.Comput.Sci.
Theor.Comput.Sci.
As real-time embedded systems become more complex, resource partitioning is increasingly used to guarantee real-time performance. Recently, several compositional frameworks of resource partitioning have been proposed using real-time scheduling theory
Conference
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:
Journal of Logic and Algebraic Programming
J.Logic.Algebraic Program.
J.Logic.Algebraic Program.
The Algebra of Communicating Shared Resources (ACSR) is a timed process algebra which extends classical process algebras with the notion of a resource. It takes the view that the timing behavior of a real-time system depends not only on delays due to
Publikováno v:
Electronic Notes in Theoretical Computer Science
Electron.Notes Theor.Comput.Sci.
Electron.Notes Theor.Comput.Sci.
The Algebra of Communicating Shared Resources (ACSR) is a timed process algebra which extends classical process algebras with the notion of a resource. It takes the view that the timing behavior of a real-time system depends not only on delays due to
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.