DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2018 · 19 citations · 22 references
ComputingComputer EngineeringComputer ScienceFormal MethodsProgramming LanguagesSafety EngineeringControl-flow AnalysisDeductive VerificationModel CheckingRecursion TheorySpecification LanguagesAutomated Program SynthesisAutomated Synthesis ModulesEnforcementMonitorsRuntime Policy EnforcementRuntime SemanticsSecurity EnforcementSuppression
Runtime enforcement is a dynamic analysis technique that uses monitors to enforce the behaviour specified by some correctness property on an executing system. The enforceability of a logic captures the extent to which the properties expressible via the logic can be enforced at runtime. We study the enforceability of Hennessy-Milner Logic with Recursion (muHML) with respect to suppression enforcement. We develop an operational framework for enforcement which we then use to formalise when a monitor enforces a muHML property. We also show that the safety syntactic fragment of the logic, sHML, is enforceable by providing an automated synthesis function that generates correct suppression monitors from sHML formulas.
22
A calculus of mobile processes, I
Robin Milner, Joachim Parrow, David Walker · Information and Computation · 1992 · 2.8K citations · Full text
Results on the propositional μ-calculus
Dexter Kozen · Theoretical Computer Science · 1983 · 1.8K citations
Humanities, Mathematics, Logic +4
Transductions and Context-Free Languages
Jean Berstel · 1979 · 1.3K citations
Fred B. Schneider · ACM Transactions on Information and System Security · 2000 · 1.3K citations · Full text