42 search results - page 5 / 9 » Widening Arithmetic Automata |
ICIP
2007
IEEE
14 years 9 months ago
2007
IEEE
This paper describes Slepian-Wolf codes based on overlapped quasi-arithmetic codes, where overlapping allows lossy compression of the source below its entropy. In the context of s...
BIRTHDAY
2008
Springer
13 years 9 months ago
2008
Springer
One of the surprising developments in the area of program verification is how ideas introduced originally by logicians in the 1950s ended up yielding by 2003 an industrial-standard...
MEMOCODE
2003
IEEE
14 years 20 days 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
14 years 2 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...
MAM
2008
13 years 7 months ago
2008
This paper presents a design methodology for a hybrid Hardwarein-the-Loop (HIL) tester tool, based on both discrete event system theory, given by timed automata, and continuous sy...