Zobrazeno 1 - 10
of 17
pro vyhledávání: '"Mitja Kulczynski"'
Autor:
Murphy Berzish, Joel D. Day, Vijay Ganesh, Mitja Kulczynski, Florin Manea, Federico Mora, Dirk Nowotka
Publikováno v:
Theoretical Computer Science. 943:50-72
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0a3144602367473a74f1701d509b42cd
https://doi.org/10.1016/j.tcs.2022.12.009
https://doi.org/10.1016/j.tcs.2022.12.009
This ZIP-file contains all data needed to run SMTQuery within the TACAS '23 Ubuntu VM. For further information we refer tohttps://smtquery.github.io. The package contains: 1. The Python 3 source code of SMTQuery is located in `code`, 2. SMTLib files,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1d876986f765522341b59ac9d79b44c2
Autor:
Mitja Kulczynski
Widespread use of string solvers in formal analysis of string-heavy programs has led to a growing demand for more efficient and reliable techniques which can be applied in this context, especially for real-world cases. Designing an algorithm for the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2719b84ff0068f3e05b7e33b17fed80e
https://doi.org/10.21941/kcss/2022/1
https://doi.org/10.21941/kcss/2022/1
Publikováno v:
Model Checking Software ISBN: 9783031150760
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::07c45ed1c4f62135a4569f88d13e8eab
https://doi.org/10.1007/978-3-031-15077-7_8
https://doi.org/10.1007/978-3-031-15077-7_8
Publikováno v:
Kulczynski, M, Manea, F, Nowotka, D & Poulsen, D B 2021, ' ZaligVinder : A generic test framework for string solvers ', Journal of Software: Evolution and Process . https://doi.org/10.1002/smr.2400
The increased interest in string solving in the recent years has made it very hard to identify the right tool to address a particular user's purpose. Firstly, there is a multitude of string solvers, each addressing essentially some subset of the gene
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::528461d383ee861fd9c2d9147004e708
https://doi.org/10.1002/smr.2400
https://doi.org/10.1002/smr.2400
In recent years there has been a considerable effort in optimising formal methods for application to code. This has been driven by tools such as CPAChecker, DIVINE, and CBMC. At the same time tools such as Uppaal have been massively expanding the rea
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c70341a48d1456d51a770087b557efdf
http://arxiv.org/abs/2108.02963
http://arxiv.org/abs/2108.02963
Autor:
Murphy Berzish, Mitja Kulczynski, Federico Mora, Florin Manea, Joel Day, Dirk Nowotka, Vijay Ganesh
This VM setup is heavily based onSebastian Hjort Hyberts, Peter Gjøl Jensen and Thomas Neele:TACAS 21 Artifact Evaluation VM - Ubuntu 20.04 LTS. This file describes how to compile and install Z3str3RE and setup the benchmark infrastructure including
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::10345972a529a3239bfa1843e1deb00c
Autor:
Federico Mora, Florin Manea, Mitja Kulczynski, Murphy Berzish, Dirk Nowotka, Vijay Ganesh, Joel D. Day
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030850876
WORDS
WORDS
Widespread use of string solvers in formal analysis of string-heavy programs has led to a growing demand for more efficient and reliable techniques which can be applied in this context, especially for real-world cases. Designing an algorithm for the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3158f82c75ec6cd1d94a785b26f58aeb
https://doi.org/10.1007/978-3-030-85088-3_5
https://doi.org/10.1007/978-3-030-85088-3_5
Autor:
Federico Mora, Mitja Kulczynski, Joel D. Day, Florin Manea, Murphy Berzish, Dirk Nowotka, Vijay Ganesh
Publikováno v:
Computer Aided Verification ISBN: 9783030816872
CAV (2)
CAV (2)
We present a novel length-aware solving algorithm for the quantifier-free first-order theory over regex membership predicate and linear arithmetic over string length. We implement and evaluate this algorithm and related heuristics in the Z3 theorem p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e514f1a2474eda7c83bdf817c6cbbba9
https://doi.org/10.1007/978-3-030-81688-9_14
https://doi.org/10.1007/978-3-030-81688-9_14
Publikováno v:
Developments in Language Theory ISBN: 9783030815073
DLT
DLT
A prefix normal word is a binary word whose prefixes contain at least as many 1s as any of its factors of the same length. Introduced by Fici and Liptak in 2011, the notion of prefix normality has been, thus far, only defined for words over the binar
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c0f8fe3fc2ab16b8cd3a35b3bcbcf33f
https://doi.org/10.1007/978-3-030-81508-0_12
https://doi.org/10.1007/978-3-030-81508-0_12