90 search results - page 13 / 18 » On the Decidability of the Equivalence Problem for Monadic R... |
TACAS
2012
Springer
12 years 3 months ago
2012
Springer
Abstract. The pairwise reachability problem for a multi-threaded program asks, given control locations in two threads, whether they can be simultaneously reached in an execution of...
FSTTCS
2004
Springer
14 years 29 days ago
2004
Springer
Abstract. Monolithic finite-state probabilistic programs have been abstractly modeled by finite Markov chains, and the algorithmic verification problems for them have been inves...
ESOP
2009
Springer
13 years 11 months ago
2009
Springer
This paper studies inductive definitions involving binders, in which aliasing between free and bound names is permitted. Such aliasing occurs in informal specifications of operatio...
JAPLL
2010
13 years 2 months ago
2010
The satisfiability problem of hybrid logics with the downarrow binder is known to be undecidable. This initiated a research program on decidable and tractable fragments. In this p...
ICDT
2001
ACM
14 years 15 hour ago
2001
ACM
In information-integration systems, source relations often have limitations on access patterns to their data; i.e., when one must provide values for certain attributes of a relatio...