27 search results - page 5 / 6 » On Pebble Automata for Data Languages with Decidable Emptine... |
CSL
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. The relationship between automata and logics has been investigated since the 1960s. In particular, it was shown how to determine, given an automaton, whether or not it is...
CADE
2008
Springer
14 years 6 months ago
2008
Springer
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...
CSL
2009
Springer
14 years 10 days ago
2009
Springer
For programs whose data variables range over boolean or finite domains, program verification is decidable, and this forms the basis of recent tools for software model checking. I...
IDEAS
2005
IEEE
13 years 11 months ago
2005
IEEE
— XPath is a common language for selecting nodes in an XML document. XPath uses so called path expressions which describe a navigation path through semistructured data. In the la...
FC
2005
Springer
13 years 11 months ago
2005
Springer
Two parties, say Alice and Bob, possess two sets of elements that belong to a universe of possible values and wish to test whether these sets are disjoint or not. In this paper we ...