8 search results - page 2 / 2 » On the Use of Non-deterministic Automata for Presburger Arit... |
MEMOCODE
2003
IEEE
13 years 10 months ago
2003
IEEE
In this paper, we present a technique for determining tight bounds on the execution time of assembler programs. Thus, our method is independent of the design flow, but takes into...
TACAS
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. In this paper we prove that the transitive closure of a nondeterministic octagonal relation using integer counters can be expressed in Presburger arithmetic. The direct c...
JALC
2006
13 years 4 months ago
2006
Automated Web Service Composition has gained a significant momentum in facilitating fast and efficient formation of business-to-business collaborations where an important objectiv...