8 search results - page 1 / 2 » memocode 2003 |
MEMOCODE
2003
IEEE
13 years 9 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...
MEMOCODE
2003
IEEE
13 years 9 months ago
2003
IEEE
An executable computational logic can provide the desired bridge between formal system properties and formal methods to verify them on the one hand, and executable models of syste...
MEMOCODE
2003
IEEE
13 years 9 months ago
2003
IEEE
— Modern SAT solvers have proved highly successful in finding counterexamples to temporal properties of systems, using a method known as ”bounded model checking”. It is natu...
MEMOCODE
2003
IEEE
13 years 9 months ago
2003
IEEE
Several efficient compilation techniques have been recently proposed for the generation of sequential (C) code from Esterel programs. Consisting essentially in direct simulation ...
MEMOCODE
2003
IEEE
13 years 9 months ago
2003
IEEE
Formal techniques have been widely applied in the design of real-time systems and have significantly helped detect design errors by checking real-time properties of the model. Ho...