Zobrazeno 1 - 10
of 58
pro vyhledávání: '"Lukáš Holík"'
Publikováno v:
IEEE Transactions on Smart Grid. 14:2352-2366
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b6ee51ee807d783c27483c94b2c8b369
https://doi.org/10.1109/tsg.2022.3216726
https://doi.org/10.1109/tsg.2022.3216726
Autor:
František Blahoudek, Yu-Fang Chen, David Chocholatý, Vojtěch Havlena, Lukáš Holík, Ondřej Lengál, Juraj Síč
Publikováno v:
Formal Methods ISBN: 9783031274800
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a85af3a55f28a094f76b54510b32d4ef
https://doi.org/10.1007/978-3-031-27481-7_23
https://doi.org/10.1007/978-3-031-27481-7_23
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783031308284
Fast matching of regular expressions with bounded repetition, aka counting, such as $$\texttt {(ab)\{50,100\}}$$ ( ab ) { 50 , 100 } , i.e., matching linear in the length of the text and independent of the repetition bounds, has been an open problem
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3aca4c8830fc1bdca5bec6e0c7e868cf
https://doi.org/10.1007/978-3-031-30829-1_19
https://doi.org/10.1007/978-3-031-30829-1_19
Publikováno v:
Journal of Automated Reasoning. 65:971-999
We propose a lazy decision procedure for the logic WS $$k$$ S. It builds a term-based symbolic representation of the state space of the tree automaton (TA) constructed by the classical WS $$k$$ S decision procedure. The classical decision procedure t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::627c56dba5952662b2202ab6592d02c8
https://doi.org/10.1007/s10817-021-09597-w
https://doi.org/10.1007/s10817-021-09597-w
Publikováno v:
Formal Methods in System Design
Formal Methods in System Design, Springer Verlag, 2020, ⟨10.1007/s10703-020-00345-1⟩
Formal Methods in System Design, Springer Verlag, 2020, ⟨10.1007/s10703-020-00345-1⟩
International audience; A generic register automaton is a finite automaton equipped with variables (which may be viewed as counters or, more generally, registers) ranging over infinite data domains. A trace of a generic register automaton is an alter
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f444cbdceb0b431d8ba11dea81172085
https://doi.org/10.1007/s10703-020-00345-1
https://doi.org/10.1007/s10703-020-00345-1
Publikováno v:
Lecture Notes in Computer Science. 2018, vol. 10806, issue 2, p. 155-175.
Tools and Algorithms for the Construction and Analysis of Systems ISBN: 9783319899626
TACAS (2)
Tools and Algorithms for the Construction and Analysis of Systems ISBN: 9783319899626
TACAS (2)
We consider the problem of approximate reduction of non-deterministic automata that appear in hardware-accelerated network intrusion detection systems (NIDSes). We define an error distance of a reduced automaton from the original one as the probabili
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b8517ed0b2e0d847b8fa73af92f458a7
https://doi.org/10.1007/s10009-019-00520-8
https://doi.org/10.1007/s10009-019-00520-8
Autor:
Di-De Yen, Denghang Hu, Lukáš Holík, Wei-Lun Tsai, Yu-Fang Chen, Zhillin Wu, Parosh Aziz Abdulla, Mohamed Faouzi Atig, Bui Phi Diep
Publikováno v:
Programming Languages and Systems ISBN: 9783030890506
Not-substring is currently among the least supported types of string constraints, and existing solvers use only relatively crude heuristics. Yet, not-substring occurs relatively often in practical examples and is useful in encoding other types of con
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7a2e54444a799552efb796ca18f26d0c
https://doi.org/10.1007/978-3-030-89051-3_17
https://doi.org/10.1007/978-3-030-89051-3_17
Autor:
Pavol Vargovčík, Lukáš Holík
Publikováno v:
Programming Languages and Systems ISBN: 9783030890506
We propose preprocessing techniques that improve efficiency of testing language emptiness of alternating automata. We target mainly automata that come from practical application such as processing regular expressions, LTL formulae, or string solving.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8bd3b345d369ee210bf61e95fbe8a2bf
https://doi.org/10.1007/978-3-030-89051-3_14
https://doi.org/10.1007/978-3-030-89051-3_14
Autor:
Martin Hruška, Lukáš Holík
Publikováno v:
Networked Systems ISBN: 9783030910136
Networked Systems
Networked Systems
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5b961fb3d583695ef406d41a16a7ec2c
https://doi.org/10.1007/978-3-030-91014-3_14
https://doi.org/10.1007/978-3-030-91014-3_14
Autor:
Mohamed Faouzi Atig, Bui Phi Diep, Lukáš Holík, Yu-Fang Chen, Petr Janků, Wei-Cheng Wu, Hsin-Hung Lin, Parosh Aziz Abdulla, Julian Dolby
Publikováno v:
PLDI
String-number conversion is an important class of constraints needed for the symbolic execution of string-manipulating programs. In particular solving string constraints with string-number conversion is necessary for the analysis of scripting languag
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::be9ccc676ce1647c7314c7864352e779
https://doi.org/10.1145/3385412.3386034
https://doi.org/10.1145/3385412.3386034