534 search results - page 69 / 107 » Proving Termination of Rewrite Systems Using Bounds |
ATVA
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. This paper is concerned with a method for computing reachable sets of linear continuous systems with uncertain input. Such a method is required for verification of hybrid...
SAS
2005
Springer
14 years 2 months ago
2005
Springer
A technique for generating invariant polynomial inequalities of bounded degree is presented using the abstract interpretation framework. It is based on overapproximating basic semi...
CONCUR
2007
Springer
14 years 3 months ago
2007
Springer
Priority is a frequently used feature of many computational systems. In this paper we study the expressiveness of two process algebras enriched with different priority mechanisms...
CORR
2006
Springer
13 years 9 months ago
2006
Springer
: This document gives an algebraic and two polygraphic translations of Petri nets, all three providing an easier way to describe reductions and to identify some of them. The first ...
CIKM
2005
Springer
14 years 2 months ago
2005
Springer
In this paper, we propose a versatile disambiguation approach which can be used to make explicit the meaning of structure based information such as XML schemas, XML document struc...