1650 search results - page 137 / 330 » The HOM problem is decidable |
123
click to vote
CHARME
2003
Springer
15 years 9 months ago
2003
Springer
We consider the problem of bounded model checking of systems expressed in a decidable fragment of first-order logic. While model checking is not guaranteed to terminate for an ar...
164
click to vote
DBPL
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. We are interested in the theoretical foundations of the optimization of conjunctive regular path queries (CRPQs). The basic problem here is deciding query containment bot...
115
click to vote
WIA
2001
Springer
15 years 8 months ago
2001
Springer
d Abstract) Zhe Dang , Tevfik Bultan ¡ , Oscar H. Ibarra ¡ , and Richard A. Kemmerer ¡ ¢ School of Electrical Engineering and Computer Science Washington State University P...
131
click to vote
BIRTHDAY
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. We consider programs which are data independent with respect to two type variables X and Y , and can in addition use arrays indexed by X and storing values from Y . We ar...
157
click to vote
FOSSACS
2004
Springer
15 years 8 months ago
2004
Springer
In the literature there are several CCS-like process calculi differing in the constructs for the specification of infinite behavior and in the scoping rules for channel names. In t...