Sciweavers

4095 search results - page 23 / 819
» How to test a tree
Sort
View
DFT
2000
IEEE
104views VLSI» more  DFT 2000»
14 years 3 days ago
How Does Resource Utilization Affect Fault Tolerance?
Many fault-tolerant architectures are based on the single-fault assumption, hence accumulation of dormant faults represents a potential reliability hazard. Based on the example of...
Andreas Steininger, Christoph Scherrer
FM
2003
Springer
139views Formal Methods» more  FM 2003»
14 years 28 days ago
Combining Real-Time Model-Checking and Fault Tree Analysis
We present a semantics for fault tree analysis, a technique used for the analysis of safety critical systems, in the real-time interval logic Duration Calculus with Liveness and sh...
Andreas Schäfer
AGTIVE
2003
Springer
14 years 28 days ago
Specifying Pointer Structures by Graph Reduction
Graph-reduction specifications (GRSs) are a powerful new method for specifying classes of pointer data structures (shapes). They cover important shapes, like various forms of bal...
Adam Bakewell, Detlef Plump, Colin Runciman

Book
2145views
15 years 5 months ago
An Introduction to Binary Search Trees and Balanced Trees
"Libavl is a library in ANSI C for manipulation of various types of binary trees. This book provides an introduction to binary tree techniques and presents all of Libavl’s ...
Ben Pfaff
FMCO
2009
Springer
161views Formal Methods» more  FMCO 2009»
13 years 5 months ago
The How and Why of Interactive Markov Chains
This paper reviews the model of interactive Markov chains (IMCs, for short), an extension of labelled transition systems with exponentially delayed transitions. We show that IMCs a...
Holger Hermanns, Joost-Pieter Katoen