Termination, deadlock and divergence
Proceedings of the fifth international conference on Mathematical foundations of programming semantics
Process algebra
Bisimulation through probabilistic testing
Information and Computation
A compositional approach to performance modelling
A compositional approach to performance modelling
Model-checking continuous-time Markov chains
ACM Transactions on Computational Logic (TOCL)
Handbook of Process Algebra
Axiomatizations for the Perpetual Loop in Process Algebra
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Extended Markovian Process Algebra
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
PRISM: Probabilistic Symbolic Model Checker
TOOLS '02 Proceedings of the 12th International Conference on Computer Performance Evaluation, Modelling Techniques and Tools
Specifying Performance Measures for PEPA
ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
Model-Checking Algorithms for Continuous-Time Markov Chains
IEEE Transactions on Software Engineering
Regular Expressions in Process Algebra
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Types and Effects for Secure Service Orchestration
CSFW '06 Proceedings of the 19th IEEE workshop on Computer Security Foundations
Measure Theory and Probability Theory (Springer Texts in Statistics)
Measure Theory and Probability Theory (Springer Texts in Statistics)
Semantics-Based Design for Secure Web Services
IEEE Transactions on Software Engineering
On the origins of bisimulation and coinduction
ACM Transactions on Programming Languages and Systems (TOPLAS)
Local policies for resource usage analysis
ACM Transactions on Programming Languages and Systems (TOPLAS)
Rate-Based Transition Systems for Stochastic Process Calculi
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Planning and verifying service composition
Journal of Computer Security - 18th IEEE Computer Security Foundations Symposium (CSF 18)
Labelled Markov Processes
SFM'07 Proceedings of the 7th international conference on Formal methods for performance evaluation
The Measurable Space of Stochastic Processes
QEST '10 Proceedings of the 2010 Seventh International Conference on the Quantitative Evaluation of Systems
| Hi-index | 0.00 |
We introduce a formal framework to specify and enforce quantitative security policies. The framework consists of: (i) a stochastic process calculus to express the measurable space of computations in terms of Continuous Time Markov Chains; (ii) a stochastic modal logic (a variant of CSL) to represent the bound constraints on execution speed; (iii) two enforcement mechanisms of our quantitative security policies: potential and actual. The potential enforcement computes the probability of policy violations, thus providing a sort of static evaluation of when the policy is obeyed. This supports the user to accept/discard a component when the probability of the security violation is below/above a suitable chosen threshold. The actual enforcement computes at run-time the deviation of the execution speed from the acceptable rate. This specifies the execution monitor and drives it to abort unsafe executions.