An automata theoretic decision procedure for the propositional mu-calculus
Information and Computation
Synthesising controllers from real-time specifications
ISSS '97 Proceedings of the 10th international symposium on System synthesis
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
ACM Transactions on Information and System Security (TISSEC)
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Analysis of security protocols as open systems
Theoretical Computer Science
Extending Process Languages with Time
AMAST '97 Proceedings of the 6th International Conference on Algebraic Methodology and Software Technology
The Propositional Mu-Calculus is Elementary
Proceedings of the 11th Colloquium on Automata, Languages and Programming
FORTE '90 Proceedings of the IFIP TC6/WG6.1 Third International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols: Formal Description Techniques, III
On the Expressivity of the Modal Mu-Calculus
STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
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
Process Algebra and Non-interference
CSFW '99 Proceedings of the 12th IEEE workshop on Computer Security Foundations
A simple framework for real-time cryptographic protocol analysis with compositional proof rules
Science of Computer Programming - Special issue on 12th European symposium on programming (ESOP 2003)
Semantic models for information flow
Theoretical Computer Science - Mathematical foundations of programming semantics
Automated analysis of timed security: a case study on web privacy
International Journal of Information Security - Special issue on security in global computing
Enforcing Secure Service Composition
CSFW '05 Proceedings of the 18th IEEE workshop on Computer Security Foundations
Through Modeling to Synthesis of Security Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
Compositional analysis for verification of parameterized systems
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Safety interfaces for component-based systems
SAFECOMP'05 Proceedings of the 24th international conference on Computer Safety, Reliability, and Security
On the Relationships among four Timed Process Algebras
Fundamenta Informaticae
An Approach for the Specification, Verification and Synthesis of Secure Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Run-Time Enforcement of Nonsafety Policies
ACM Transactions on Information and System Security (TISSEC)
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
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.01 |
In [Martinelli, F. and I. Matteucci, Modeling security automata with process algebras and related results (2006), presented at the 6th International Workshop on Issues in the Theory of Security (WITS '06) - Informal proceedings; Martinelli, F. and I. Matteucci, Through modeling to synthesis of security automata (2006), accepted to STM06. To appeare in ENTCS] we have presented an approach for enforcing security properties. It is based on the automatic synthesis of controller programs that are able to detect and eventually prevent possible wrong action performed by an external agent. Here, we extend this approach also to a timed setting. Under certain assumptions, we are also able to enforce several information flow properties. We show how to deal with parameterized systems.