Sciweavers

28 search results - page 1 / 6
» Reachability Analysis for Formal Verification of SystemC
Sort
View
DSD
2002
IEEE
95views Hardware» more  DSD 2002»
13 years 9 months ago
Reachability Analysis for Formal Verification of SystemC
Rolf Drechsler, Daniel Große
FMCAD
2004
Springer
13 years 8 months ago
A Partitioning Methodology for BDD-Based Verification
The main challenge in BDD-based verification is dealing with the memory explosion problem during reachability analysis. In this paper we advocate a methodology to handle this probl...
Debashis Sahoo, Subramanian K. Iyer, Jawahar Jain,...
FORMATS
2009
Springer
13 years 8 months ago
Stochastic Games for Verification of Probabilistic Timed Automata
Probabilistic timed automata (PTAs) are used for formal modelling and verification of systems with probabilistic, nondeterministic and real-time behaviour. For non-probabilistic ti...
Marta Z. Kwiatkowska, Gethin Norman, David Parker
EMSOFT
2010
Springer
13 years 2 months ago
PinaVM: a systemC front-end based on an executable intermediate representation
SystemC is the de facto standard for modeling embedded systems. It allows system design at various levels of abstractions, provides typical object-orientation features and incorpo...
Kevin Marquet, Matthieu Moy
CAV
2004
Springer
108views Hardware» more  CAV 2004»
13 years 8 months ago
Functional Dependency for Verification Reduction
Abstract. The existence of functional dependency among the state variables of a state transition system was identified as a common cause of inefficient BDD representation in formal...
Jie-Hong Roland Jiang, Robert K. Brayton