Dyck reachability is the standard formulation of a large domain of static analyses, as it
achieves the sweet spot between precision and efficiency, and has thus been studied …

A fundamental problem in refinement verification is to check that the language of behaviors
of an implementation is included in the language of the specification. We consider the …

This paper presents a technique for summarizing recursive procedures operating on integer
variables. The motivation of our work is to create more predictable program analyzers, and …

A pushdown vector addition system with states (PVASS) extends the model of vector
addition systems with a pushdown store. A PVASS is said to be\emph {bidirected} if every …

We prove that the reachability problem for two-dimensional vector addition systems with
states is NL-complete or PSPACE-complete, depending on whether the numbers in the input …

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 …

The reachability problem is a central decision problem for formal verification based on vector
addition systems with states (VASS), which are equivalent to Petri nets and form one of the …

We investigate the dimension-parametric complexity of the reachability problem in vector
addition systems with states (VASS) and its extension with pushdown stack (pushdown …

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 …

A lower bound for the coverability problem in acyclic pushdown VAS - ScienceDirect Skip to
main contentSkip to article Elsevier logo Journals & Books Search RegisterSign in View PDF …