Sciweavers

3653 search results - page 369 / 731
» On Recognizable Timed Languages
Sort
View
212
Voted
WORDS
2003
IEEE
16 years 1 days ago
A Tool for Automatic Flow Analysis of C-programs for WCET Calculation
Bounding the Worst Case Execution Time (WCET) of programs is essential for real-time systems. To be able to do WCET calculations, the iteration bounds for loops and recursion must...
Jan Gustafsson, Björn Lisper, Christer Sandbe...
CAV
2003
Springer
160views Hardware» more  CAV 2003»
16 years 3 hour ago
Fast Mu-Calculus Model Checking when Tree-Width Is Bounded
We show that the model checking problem for µ-calculus on graphs of bounded tree-width can be solved in time linear in the size of the system. The result is presented by first sh...
Jan Obdrzálek
HYBRID
2003
Springer
15 years 12 months ago
Model Checking LTL over Controllable Linear Systems Is Decidable
Abstract. The use of algorithmic verification and synthesis tools for hybrid systems is currently limited to systems exhibiting simple continuous dynamics such as timed automata o...
Paulo Tabuada, George J. Pappas
ICALP
2003
Springer
15 years 12 months ago
Hierarchical and Recursive State Machines with Context-Dependent Properties
Abstract. Hierarchical and recursive state machines are suitable abstract models for many software systems. In this paper we extend a model recently introduced in literature, by al...
Salvatore La Torre, Margherita Napoli, Mimmo Paren...
178
Voted
IV
2002
IEEE
135views Visualization» more  IV 2002»
15 years 11 months ago
Static Visualization of Dynamic Data Flow Visual Program Execution
We propose ‘Trace View’, a static visualization method for monitoringand debugging the dynamic behavior of programs written in data flow visual programming languages. Trace V...
Buntarou Shizuki, Etsuya Shibayama, Masashi Toyoda