The implication problem of computing policies

DOI10.1007/978-3-319-21741-3_8zbMATH Open1428.68088OpenAlexW2113033881MaRDI QIDQ5207905FDOQ5207905

Authors: Rezwana Reaz, Muqeet Ali, Marijn J. H. Heule, Mohamed G. Gouda, Ehab S. Elmallah 

Publication date: 14 January 2020

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-21741-3_8

Recommendations

• Policy expressions and the bottom-up design of computing policies
• Refinement of history-based policies
• Matching Trace Patterns with Regular Policies
• Polynomial-time inference of all valid implications for Horn and related formulae
• Polynomial-time computation via local inference relations

zbMATH Keywords

implication problemfirewallsroutingaccess controlpolicystep-wise refinement

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer security (68M25)

Cited In (4)

• Matching Trace Patterns with Regular Policies
• Policy expressions and the bottom-up design of computing policies
• Refinement of history-based policies
• Elimination of the redundancy related to combining algorithms to improve the PDP evaluation performance

This page was built for publication: The implication problem of computing policies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5207905)