An automata theoretic decision procedure for the propositional mu-calculus
Information and Computation
Journal of the ACM (JACM)
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
ACM Transactions on Information and System Security (TISSEC)
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Partial Model Checking and Theorem Proving for Ensuring Security Properties
CSFW '98 Proceedings of the 11th IEEE workshop on Computer Security Foundations
Policy framings for access control
WITS '05 Proceedings of the 2005 workshop on Issues in the theory of security
Logical Specification and Analysis of Fault Tolerant Systems Through Partial Model Checking
Electronic Notes in Theoretical Computer Science (ENTCS)
Enforcing non-safety security policies with program monitors
ESORICS'05 Proceedings of the 10th European conference on Research in Computer Security
An Approach for the Specification, Verification and Synthesis of Secure Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Automated Synthesis of Enforcing Mechanisms for Security Properties in a Timed Setting
Electronic Notes in Theoretical Computer Science (ENTCS)
Run-Time Enforcement of Nonsafety Policies
ACM Transactions on Information and System Security (TISSEC)
Do You Really Mean What You Actually Enforced?
Formal Aspects in Security and Trust
Synthesis of web services orchestrators in a timed setting
WS-FM'07 Proceedings of the 4th international conference on Web services and formal methods
You should better enforce than verify
RV'10 Proceedings of the First international conference on Runtime verification
Runtime enforcement monitors: composition, synthesis, and enforcement abilities
Formal Methods in System Design
Proceedings of the joint ACM SIGSOFT conference -- QoSA and ACM SIGSOFT symposium -- ISARCS on Quality of software architectures -- QoSA and architecting critical systems -- ISARCS
Formal enforcement of security policies on concurrent systems
Journal of Symbolic Computation
Specifying and analysing run-time security policies for time dependant services
Proceedings of the First International Workshop on Security and Privacy Preserving in e-Societies
Gate automata-driven run-time enforcement
Computers & Mathematics with Applications
Gained and Excluded Private Actions by Process Observations
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
From qualitative to quantitative enforcement of security policy
MMM-ACNS'12 Proceedings of the 6th international conference on Mathematical Methods, Models and Architectures for Computer Network Security: computer network security
A framework for automatic generation of security controller
Software Testing, Verification & Reliability
Iterative enforcement by suppression: Towards practical enforcement theories
Journal of Computer Security - ARSPA-WITS'10
| Hi-index | 0.00 |
We define a set of process algebra operators, that we call controller operators, able to mimic the behavior of security automata introduced by Schneider in [Schneider, F. B., Enforceable security policies, ACM Transactions on Information and System Security 3 (2000), pp. 30-50] and by Ligatti and al. in [Bauer, L., J. Ligatti and D. Walker, More enforceable security policies, in: I. Cervesato, editor, Foundations of Computer Security: proceedings of the FLoC'02 workshop on Foundations of Computer Security (2002), pp. 95-104]. Security automata are mechanisms for enforcing security policies that specify acceptable executions of programs. Here we give the semantics of four controllers that act by monitoring possible un-trusted component of a system in order to enforce certain security policies. Moreover, exploiting satisfiability results for temporal logic, we show how to automatically build these controllers for a given security policy.