Sciweavers

140 search results - page 22 / 28
» An Automated Approach to Verifying Diagnosability in Multi-a...
Sort
View
RTS
2008
131views more  RTS 2008»
13 years 7 months ago
Formal verification of multitasking applications based on timed automata model
The aim of this paper is to show, how a multitasking application running under a real-time operating system compliant with an OSEK/VDX standard can be modeled by timed automata. Th...
Libor Waszniowski, Zdenek Hanzálek
DAC
2000
ACM
14 years 8 months ago
Formal verification of iterative algorithms in microprocessors
Contemporary microprocessors implement many iterative algorithms. For example, the front-end of a microprocessor repeatedly fetches and decodes instructions while updating interna...
Mark Aagaard, Robert B. Jones, Roope Kaivola, Kath...
AAECC
2005
Springer
128views Algorithms» more  AAECC 2005»
13 years 7 months ago
The size-change principle and dependency pairs for termination of term rewriting
Abstract In [24], a new size-change principle was proposed to verify termination of functional programs automatically. We extend this principle in order to prove termination and in...
René Thiemann, Jürgen Giesl
MODELS
2010
Springer
13 years 6 months ago
Automatically Discovering Properties That Specify the Latent Behavior of UML Models
Formal analysis can be used to verify that a model of the system adheres to its requirements. As such, traditional formal analysis focuses on whether known (desired) system propert...
Heather Goldsby, Betty H. C. Cheng
CODES
2007
IEEE
13 years 11 months ago
Pointer re-coding for creating definitive MPSoC models
Today's MPSoC synthesis and exploration design flows start abstract input specification model captured in a system level design language. Usually this model is created from a...
Pramod Chandraiah, Rainer Dömer