Add to ORKGIn this paper we show how the partial model checking approach for the analysis of secure systems may also be useful for enforcing security properties. We define a set of process algebra operators that act as pro-grammable controllers of possibly insecure components. The program of these controllers may be automatically obtained through the usage of satisfiability procedures for a variant of µ-calculus.
This paper concerns the study, the development and the synthesis of mechanisms for guaranteeing the ...
In the design process of distributed systems we may have to replace abstract specifications of compo...
We investigate security enforcement mechanisms that run in parallel with a system; the aim is to che...
In this paper we show how the partial model checking approach for the analysis of secure systems may...
Partial model checking, process algebra operators and satisfiability procedures for (automatically) ...
Abstract. We define a set of process algebra operators (controllers) that mimic the security automat...
AbstractWe define a set of process algebra operators, that we call controller operators, able to mim...
AbstractWe define a set of process algebra operators, that we call controller operators, able to mim...
Several information flow security definitions, proposed in the literature, are generalized and adapt...
The standard approach to the specification of a secure system is to present a (usually state-hased) ...
We propose a methodology for the formal analysis of security protocols. This originates from the obs...
Recently there has been much interest towards using formal methods in the analysis of security proto...
We define a set of process algebra operators (controllers) that mimic the security automata introduc...
AbstractIn [Martinelli, F. and I. Matteucci, Modeling security automata with process algebras and re...
Abstract—Process algebras provide the mathematical foundation for several formal verification techni...
This paper concerns the study, the development and the synthesis of mechanisms for guaranteeing the ...
In the design process of distributed systems we may have to replace abstract specifications of compo...
We investigate security enforcement mechanisms that run in parallel with a system; the aim is to che...
In this paper we show how the partial model checking approach for the analysis of secure systems may...
Partial model checking, process algebra operators and satisfiability procedures for (automatically) ...
Abstract. We define a set of process algebra operators (controllers) that mimic the security automat...
AbstractWe define a set of process algebra operators, that we call controller operators, able to mim...
AbstractWe define a set of process algebra operators, that we call controller operators, able to mim...
Several information flow security definitions, proposed in the literature, are generalized and adapt...
The standard approach to the specification of a secure system is to present a (usually state-hased) ...
We propose a methodology for the formal analysis of security protocols. This originates from the obs...
Recently there has been much interest towards using formal methods in the analysis of security proto...
We define a set of process algebra operators (controllers) that mimic the security automata introduc...
AbstractIn [Martinelli, F. and I. Matteucci, Modeling security automata with process algebras and re...
Abstract—Process algebras provide the mathematical foundation for several formal verification techni...
This paper concerns the study, the development and the synthesis of mechanisms for guaranteeing the ...
In the design process of distributed systems we may have to replace abstract specifications of compo...
We investigate security enforcement mechanisms that run in parallel with a system; the aim is to che...