534 search results - page 70 / 107 » Proving Termination of Rewrite Systems Using Bounds |
TAPSOFT
1997
Springer
14 years 1 months ago
1997
Springer
The goal of this paper is to analyse semantics of algorithms with explicit continuous time with further aim to nd approaches to automatize model checking in high level, easily unde...
FMSD
2006
13 years 8 months ago
2006
This paper describes the application of the Real-Time Maude tool and the Maude formal methodology to the specification and analysis of the AER/NCA suite of active network multicast...
KBSE
2000
IEEE
14 years 12 days ago
2000
IEEE
c specifications provide a powerful method for the specification of abstract data types in programming languages and software systems. Completeness and ground confluence are fundam...
ALT
2010
Springer
13 years 10 months ago
2010
Springer
We address the problem of constructing randomized online algorithms for the Metrical Task Systems (MTS) problem on a metric against an oblivious adversary. Restricting our attenti...
PODC
2009
ACM
14 years 6 months ago
2009
ACM
In this paper, we study the wireless synchronization problem which requires devices activated at different times on a congested single-hop radio network to synchronize their roun...