Zobrazeno 1 - 10
of 127
pro vyhledávání: '"Tomáš Vojnar"'
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 233, Iss Proc. MEMICS 2016, Pp 87-93 (2016)
HADES is a fully automated verification tool for pipeline-based microprocessors that aims at flaws caused by improperly handled data hazards. It focuses on single-pipeline microprocessors designed at the register transfer level (RTL) and deals with r
Externí odkaz:
https://doaj.org/article/e11088bcbf0040f5a07e37ab720ad10f
Autor:
Tomáš Vojnar, Lijun Zhang
This book is Open Access under a CC BY licence. The LNCS 11427 and 11428 proceedings set constitutes the proceedings of the 25th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2019, which took pla
Publikováno v:
Tools and Algorithms for the Construction and Analysis of Systems ISBN: 9783031308192
2LS is a C program analyser built upon the CPROVER infrastructure that can verify and refute program assertions, memory safety, and termination. Until now, one of the main drawbacks of 2LS was its inability to verify most programs with arrays. This p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8505cbd79b47a8e51b91de06f1711ac9
https://doi.org/10.1007/978-3-031-30820-8_31
https://doi.org/10.1007/978-3-031-30820-8_31
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:
Proceedings of the 30th ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1b64ecaba40afc3d3f277b4a59805d87
https://doi.org/10.1145/3540250.3558939
https://doi.org/10.1145/3540250.3558939
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
Autor:
Lijun Zhang, Tomáš Vojnar
Publikováno v:
International Journal on Software Tools for Technology Transfer. 24:29-31
Automated techniques and tools for the construction and analysis of systems are inevitable to manage the complexity of the current systems. Such techniques and tools are the subject of interest of the International Conference on Tools and Algorithms
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5baf58306f09647608d4f541704ca5b7
https://doi.org/10.1007/s10009-021-00642-y
https://doi.org/10.1007/s10009-021-00642-y
Publikováno v:
International Journal on Software Tools for Technology Transfer. 24:1-28
The current stress on having a rapid development cycle for microprocessors featuring pipeline-based execution leads to a high demand of automated techniques supporting the design, including a support for its verification. We present an automated appr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ae19bbf6bbb9099fd1a867cc3eb91b27
https://doi.org/10.1007/s10009-020-00591-y
https://doi.org/10.1007/s10009-020-00591-y
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:
Computer Aided Systems Theory – EUROCAST 2022 ISBN: 9783031253119
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::82b6bbaa8554d7162a7ea7499fc57f88
https://doi.org/10.1007/978-3-031-25312-6_28
https://doi.org/10.1007/978-3-031-25312-6_28