This paper presents a framework for a logical characterization of fault tolerance and its formal analysis based on partial model checking techniques. The framework requires a fault tolerant system to be modeled using a formal calculus, here the CCS process algebra. To this aim we propose a uniform modeling scheme in which to specify a formal model of the system, its failing behaviour and possibly its fault-recovering procedures. Once a formal model is provided into our scheme, fault tolerance - with respect to a given property - can be formalized as an equational ?-calculus formula. This formula expresses, in a logic formalism, all the fault scenarios satisfying that fault tolerance property. Such a characterization understands the analysis...
To date, there is little evidence that modular reasoning about fault-tolerant systems can simplify t...
In this paper we show how the partial model checking approach for the analysis of secure systems may...
International audiencePartial correctness is perhaps the most important functional property of algo-...
This paper presents a framework for a logical characterisation of fault tolerance and its formal ana...
AbstractThis paper presents a framework for a logical characterization of fault tolerance and its fo...
A basic concept in modeling fault tolerant systems is that anticipated faults, being obviously outsi...
This paper proposes a modelling approach suitable for formalizing fault tolerant systems, taking int...
In this paper we show how a formal reasoning can be applied for studying the fault coverage of a fau...
Proving that a program suits its specification and thus can be called correct has been a research su...
This paper introduces different views for understanding problems and faults with the goal of definin...
AbstractFault tolerance is the ability of a system to continue delivering its services after faults ...
We propose a methodology to use the infinite state model checker MCMT, based on Satisfiability Modul...
Dependability is an ability of a computer-based system to deliver services that can be justifiably t...
We provide three methods of verifying concurrent systems which are tolerant of faults in their opera...
Model checking is shown to be an effective tool in validating the behavior of a fault tolerant embed...
To date, there is little evidence that modular reasoning about fault-tolerant systems can simplify t...
In this paper we show how the partial model checking approach for the analysis of secure systems may...
International audiencePartial correctness is perhaps the most important functional property of algo-...
This paper presents a framework for a logical characterisation of fault tolerance and its formal ana...
AbstractThis paper presents a framework for a logical characterization of fault tolerance and its fo...
A basic concept in modeling fault tolerant systems is that anticipated faults, being obviously outsi...
This paper proposes a modelling approach suitable for formalizing fault tolerant systems, taking int...
In this paper we show how a formal reasoning can be applied for studying the fault coverage of a fau...
Proving that a program suits its specification and thus can be called correct has been a research su...
This paper introduces different views for understanding problems and faults with the goal of definin...
AbstractFault tolerance is the ability of a system to continue delivering its services after faults ...
We propose a methodology to use the infinite state model checker MCMT, based on Satisfiability Modul...
Dependability is an ability of a computer-based system to deliver services that can be justifiably t...
We provide three methods of verifying concurrent systems which are tolerant of faults in their opera...
Model checking is shown to be an effective tool in validating the behavior of a fault tolerant embed...
To date, there is little evidence that modular reasoning about fault-tolerant systems can simplify t...
In this paper we show how the partial model checking approach for the analysis of secure systems may...
International audiencePartial correctness is perhaps the most important functional property of algo-...