7988 search results - page 15 / 1598 » A Useful Undecidable Theory |
136
click to vote
FUIN
2007
15 years 5 months ago
2007
We consider decidability questions for the emptiness problem of intersections of matrix semigroups. This problem was studied by A. Markov [7] and more recently by V. Halava and T....
114
click to vote
ICALP
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. This paper is concerned with the language inclusion problem for timed automata: given timed automata A and B, is every word accepted by B also accepted by A? Alur and Dil...
147
click to vote
CSL
2008
Springer
15 years 7 months ago
2008
Springer
We investigate decidability, complexity and expressive power issues for (first-order) separation logic with one record field (herein called SL) and its fragments. SL can specify pr...
158
Voted
CPAIOR
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. The stochastic satisfiability modulo theories (SSMT) problem is a generalization of the SMT problem on existential and randomized (aka. stochastic) quantification over di...
139
click to vote
CONCUR
2005
Springer
15 years 10 months ago
2005
Springer
Many decidability results are known for non-recursive cryptographic protocols, where the protocol steps can be expressed by simple rewriting rules. Recently, a tree transducer-base...