摘要
Security is an essential aspect for mobile systems. Usually, mobile system modeling and its security policies specification are realized in different techniques. So when constructed a mobile system using formal methods it is difficult to verify if the system comply with any given security policies. A method was introduced to express security automata which specifying enforceable security policies as processes in an extended π-calculus. In this extended π-calculus, an exception termination process was introduced, called bad. Any input which violating a security automaton will correspond to a step of transformation of the process that specifying the security automaton to exception termination process. Our method shows that any security automata which specifying enforceable security policies would decide a process in the extended π-calculus.
Security is an essential aspect for mobile systems. Usually, mobile system modeling and its security policies specification are realized in different techniques. So when constructed a mobile system using formal methods it is difficult to verify if the system comply with any given security policies. A method was introduced to express security automata which specifying enforceable security policies as processes in an extended π-calculus. In this extended π-calculus, an exception termination process was introduced, called bad. Any input which violating a security automaton will correspond to a step of transformation of the process that specifying the security automaton to exception termination process. Our method shows that any security automata which specifying enforceable security policies would decide a process in the extended π-calculus.
