Zobrazeno 1 - 10
of 50
pro vyhledávání: '"Pierre Ganty"'
Autor:
Pierre Ganty, Damir Valput
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 226, Iss Proc. GandALF 2016, Pp 178-197 (2016)
We present an underapproximation for context-free languages by filtering out runs of the underlying pushdown automaton depending on how the stack height evolves over time. In particular, we assign to each run a number quantifying the oscillating beha
Externí odkaz:
https://doaj.org/article/3aba988ec6a243dcb709ea863b140ffd
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 219, Iss Proc. HCVS2016, Pp 33-48 (2016)
In this paper we show that checking satisfiability of a set of non-linear Horn clauses (also called a non-linear Horn clause program) can be achieved using a solver for linear Horn clauses. We achieve this by interleaving a program transformation wit
Externí odkaz:
https://doaj.org/article/30d2f4d2e6ff45ec893bf9574c936250
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 199, Iss Proc. VPT 2015, Pp 1-14 (2015)
In this paper we investigate the use of the concept of tree dimension in Horn clause analysis and verification. The dimension of a tree is a measure of its non-linearity - for example a list of any length has dimension zero while a complete binary tr
Externí odkaz:
https://doaj.org/article/b2529455f77946c9ba41ff02e620063a
Publikováno v:
Tools and Algorithms for the Construction and Analysis of Systems ISBN: 9783031308222
We define novel algorithms for the inclusion problem between two visibly pushdown languages of infinite words, an EXPTime-complete problem. Our algorithms search for counterexamples to inclusion in the form of ultimately periodic words i.e. words of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::65c3ce33b7ca5704f726ebcee6eccdcc
https://doi.org/10.1007/978-3-031-30823-9_15
https://doi.org/10.1007/978-3-031-30823-9_15
Autor:
Pierre Ganty, Dario Della Monica
Publikováno v:
Electronic Proceedings in Theoretical Computer Science. 370
Publikováno v:
Computer Aided Verification ISBN: 9783031131875
We propose a novel algorithm to decide the language inclusion between (nondeterministic) Büchi automata, a PSpace-complete problem. Our approach, like others before, leverage a notion of quasiorder to prune the search for a counterexample by discard
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3f2a3e9832f05ae548b74cfc1e3ea787
https://doi.org/10.1007/978-3-031-13188-2_6
https://doi.org/10.1007/978-3-031-13188-2_6
Autor:
Pierre Ganty, Davide Bresolin
Publikováno v:
Electronic Proceedings in Theoretical Computer Science. 346
Publikováno v:
PLDI
We show how to infer deterministic cache replacement policies using off-the-shelf automata learning and program synthesis techniques. For this, we construct and chain two abstractions that expose the cache replacement policy of any set in the cache h
We study the language inclusion problem $L_1 \subseteq L_2$ where $L_1$ is regular or context-free. Our approach relies on abstract interpretation and checks whether an overapproximating abstraction of $L_1$, obtained by overapproximating the Kleene
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7161096b339f5452754a35f72e42b656
Publikováno v:
Static analysis : 26th International Symposium (SAS 2019) | 26th International Symposium (SAS 2019) | 8-11 Oct 2019 | Oporto, Portugal
Archivo Digital UPM
Universidad Politécnica de Madrid
Static Analysis ISBN: 9783030323035
SAS
Archivo Digital UPM
Universidad Politécnica de Madrid
Static Analysis ISBN: 9783030323035
SAS
We study the language inclusion problem \(L_1 \subseteq L_2\) where \(L_1\) is regular. Our approach relies on abstract interpretation and checks whether an overapproximating abstraction of \(L_1\), obtained by successively overapproximating the Klee
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0c5aae9d77cfd921819aa9e3972f3742
https://oa.upm.es/57610/
https://oa.upm.es/57610/