20 search results - page 3 / 4 » Reachability in Unions of Commutative Rewriting Systems Is D... |
FSTTCS
2010
Springer
13 years 4 months ago
2010
Springer
This paper focuses on first-order logic (FO) extended by reachability predicates such that the expressiveness and hence decidability properties lie between FO and monadic second-o...
APN
2009
Springer
14 years 25 days ago
2009
Springer
In previous works we defined ν-APNs, an extension of P/T nets with the capability of creating and managing pure names. We proved that, though reachability is undecidable, coverab...
RTA
1993
Springer
13 years 10 months ago
1993
Springer
We propose an extension of rewriting techniques to derive inclusion relations a ⊆ b between terms built from monotonic operators. Instead of using only a rewriting relation ⊆ ...
FCT
2007
Springer
14 years 12 days ago
2007
Springer
Abstract. We introduce a uniform framework for reasoning about infinitestate systems with unbounded control structures and unbounded data domains. Our framework is based on constr...
ATVA
2008
Springer
13 years 8 months ago
2008
Springer
Classical verification often uses abstraction when dealing with data. On the other hand, dynamic XML-based applications have become pervasive, for instance with the ever growing im...