Sciweavers

8 search results - page 1 / 2
» memocode 2003
Sort
View
MEMOCODE
2003
IEEE
14 years 19 days ago
Exact Runtime Analysis Using Automata-Based Symbolic Simulation
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...
Tobias Schüle, Klaus Schneider
MEMOCODE
2003
IEEE
14 years 19 days ago
Executable Computational Logics: Combining Formal Methods and Programming Language Based System Design
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...
José Meseguer
MEMOCODE
2003
IEEE
14 years 19 days ago
Methods for exploiting SAT solvers in unbounded model checking
— 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...
Kenneth L. McMillan
MEMOCODE
2003
IEEE
14 years 19 days ago
Optimizations for Faster Execution of Esterel Programs
Several efficient compilation techniques have been recently proposed for the generation of sequential (C) code from Esterel programs. Consisting essentially in direct simulation ...
Dumitru Potop-Butucaru, Robert de Simone
MEMOCODE
2003
IEEE
14 years 19 days ago
Real-time Property Preservation in Approximations of Timed Systems
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...
Jinfeng Huang, Jeroen Voeten, Marc Geilen