8917 search results - page 488 / 1784 » Abstraction in Algorithm Animation |
168
click to vote
TACAS
2009
Springer
16 years 1 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...
162
click to vote
ICRA
2007
IEEE
16 years 1 months ago
2007
IEEE
— Designing algorithms for multi-robot systems can be a complex and difficult process: the cost of such systems can be very high, collecting experimental data can be timeconsumi...
208
click to vote
ASWEC
2005
IEEE
16 years 15 days ago
2005
IEEE
Program slicing is a well-known program analysis technique that extracts the elements of a program related to a particular computation. Based on modular monadic semantics of a pro...
163
click to vote
FSTTCS
2004
Springer
16 years 8 days ago
2004
Springer
Abstract. Monolithic finite-state probabilistic programs have been abstractly modeled by finite Markov chains, and the algorithmic verification problems for them have been inves...
160
click to vote
POPL
2000
ACM
15 years 11 months ago
2000
ACM
In 1998 Asperti and Mairson proved that the cost of reducing a lambda-term using an optimal lambda-reducer (a la L´evy) cannot be bound by any elementary function in the number o...