Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...
Two equal length strings, or two equal sized two-dimensional texts, parameterize match (p-match) if there is a one-one mapping (relative to the alphabet) of their characters. Two-...
The method of Invisible Invariants was developed originally in order to verify safety properties of parameterized systems fully automatically. Roughly speaking, the method is based...
Yi Fang, Nir Piterman, Amir Pnueli, Lenore D. Zuck
We present a method for reducing the treewidth of a graph while preserving all the minimal s−t separators. This technique turns out to be very useful in the design of parameteriz...
This paper explores the concept of locality in proofs of global safety properties of asynchronously composed, multi-process programs. Model checking on the full state space is ofte...