Zobrazeno 1 - 10
of 806
pro vyhledávání: '"RAMANATHAN, S. P."'
Pushdown Vector Addition Systems with States (PVASS) consist of finitely many control states, a pushdown stack, and a set of counters that can be incremented and decremented, but not tested for zero. Whether the reachability problem is decidable for
Externí odkaz:
http://arxiv.org/abs/2310.16798
In the language-theoretic approach to refinement verification, we check that the language of traces of an implementation all belong to the language of a specification. We consider the refinement verification problem for asynchronous programs against
Externí odkaz:
http://arxiv.org/abs/2306.13058
Publikováno v:
Logical Methods in Computer Science, Volume 19, Issue 4 (December 21, 2023) lmcs:10219
We study first-order logic (FO) over the structure consisting of finite words over some alphabet $A$, together with the (non-contiguous) subword ordering. In terms of decidability of quantifier alternation fragments, this logic is well-understood: If
Externí odkaz:
http://arxiv.org/abs/2210.15642
Thread pooling is a common programming idiom in which a fixed set of worker threads are maintained to execute tasks concurrently. The workers repeatedly pick tasks and execute them to completion. Each task is sequential, with possibly recursive code,
Externí odkaz:
http://arxiv.org/abs/2111.09022
Publikováno v:
Logical Methods in Computer Science, Volume 18, Issue 4 (October 21, 2022) lmcs:7606
The model of asynchronous programming arises in many contexts, from low-level systems software to high-level web programming. We take a language-theoretic perspective and show general decidability and undecidability results for asynchronous programs
Externí odkaz:
http://arxiv.org/abs/2101.08611
Publikováno v:
ICALP 2020, vol. 168, pages 111:1-111:16
Dynamic networks of concurrent pushdown systems (DCPS) are a theoretical model for multi-threaded recursive programs with shared global state and dynamical creation of threads. The (global) state reachability problem for DCPS is undecidable in genera
Externí odkaz:
http://arxiv.org/abs/2011.05825
We study context-bounded verification of liveness properties of multi-threaded, shared-memory programs, where each thread can spawn additional threads. Our main result shows that context-bounded fair termination is decidable for the model; context-bo
Externí odkaz:
http://arxiv.org/abs/2011.04581
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:
Logical Methods in Computer Science, Vol Volume 19, Issue 4 (2023)
We study first-order logic (FO) over the structure consisting of finite words over some alphabet $A$, together with the (non-contiguous) subword ordering. In terms of decidability of quantifier alternation fragments, this logic is well-understood: If
Externí odkaz:
https://doaj.org/article/385a245fae9c4cb08e71337563a7aaf9
The problem of \emph{regular separability} asks, given two languages $K$ and $L$, whether there exists a regular language $S$ with $K\subseteq S$ and $S\cap L=\emptyset$. This problem has recently been studied for various classes of languages. All th
Externí odkaz:
http://arxiv.org/abs/1908.04038