Sciweavers

288 search results - page 20 / 58
» Model checking SystemC designs using timed automata
Sort
View
CADE
2002
Springer
15 years 9 months ago
Lazy Theorem Proving for Bounded Model Checking over Infinite Domains
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
Harald Rueß, Leonardo Mendonça de Mou...
EMSOFT
2009
Springer
15 years 4 months ago
Analytic real-time analysis and timed automata: a hybrid method for analyzing embedded real-time systems
This paper advocates a strict compositional and hybrid approach for obtaining key (performance) metrics of embedded At its core the developed methodology abstracts system componen...
Kai Lampka, Simon Perathoner, Lothar Thiele
ENTCS
2006
231views more  ENTCS 2006»
14 years 9 months ago
SaveCCM: An Analysable Component Model for Real-Time Systems
Component based development is a promising approach for embedded systems. Typical for embedded software is the presence of resource constraints in multiple dimensions. An essentia...
Jan Carlson, John Håkansson, Paul Pettersson
GLVLSI
2006
IEEE
95views VLSI» more  GLVLSI 2006»
15 years 3 months ago
Test generation using SAT-based bounded model checking for validation of pipelined processors
Functional verification is one of the major bottlenecks in microprocessor design. Simulation-based techniques are the most widely used form of processor verification. Efficient ...
Heon-Mo Koo, Prabhat Mishra
ATVA
2006
Springer
130views Hardware» more  ATVA 2006»
15 years 1 months ago
The Implementation of Mazurkiewicz Traces in POEM
We present the implementation of the trace theory in a new model checking tool framework, POEM, that has a strong emphasis on Partial Order Methods. A tree structure is used to sto...
Peter Niebert, Hongyang Qu