Sciweavers

70 search results - page 2 / 14
» Symbolic Fault Tree Analysis for Reactive Systems
Sort
View
TACAS
1998
Springer
105views Algorithms» more  TACAS 1998»
13 years 9 months ago
Verification of Large State/Event Systems Using Compositionality and Dependency Analysis
A state/event model is a concurrent version of Mealy machines used for describing embedded reactive systems. This paper introduces a technique that uses compositionality and depend...
Jørn Lind-Nielsen, Henrik Reif Andersen, Ge...
DATE
1997
IEEE
116views Hardware» more  DATE 1997»
13 years 9 months ago
A new approach to build a low-level malicious fault list starting from high-level description and alternative graphs
In this paper a new approach is presented to build a list of faults to be used by the fault injection environment; the list is built starting from a high-level description of the ...
Alfredo Benso, Paolo Prinetto, Maurizio Rebaudengo...
ECRTS
2002
IEEE
13 years 9 months ago
Scope-Tree: A Program Representation for Symbolic Worst-Case Execution Time Analysis
Most WCET analysis techniques only provide an upper bound on the worst case execution time as a constant value. However, it often appears that the execution time of a piece of cod...
Antoine Colin, Guillem Bernat
APN
2000
Springer
13 years 8 months ago
Efficient Symbolic State-Space Construction for Asynchronous Systems
Many techniques for the verification of reactive systems rely on the analysis of their reachable state spaces. In this paper, a new algorithm for the symbolic generation of the sta...
Gianfranco Ciardo, Gerald Lüttgen, Radu Simin...
RE
2002
Springer
13 years 4 months ago
A Software Fault Tree Approach to Requirements Analysis of an Intrusion Detection System
Requirements analysis for an Intrusion Detection System (IDS) involves deriving requirements for the IDS from analysis of the intrusion domain. When the IDS is, as here, a collecti...
Guy G. Helmer, Johnny S. Wong, Mark Slagell, Vasan...