Formal Verification of Security Policy Implementations in Enterprise Networks
ICISS '09 Proceedings of the 5th International Conference on Information Systems Security
Combination of simulation and formal methods to analyse network survivability
Proceedings of the 3rd International ICST Conference on Simulation Tools and Techniques
Model checking firewall policy configurations
POLICY'09 Proceedings of the 10th IEEE international conference on Policies for distributed systems and networks
Generating policy based security implementation in enterprise network: a formal framework
Proceedings of the 3rd ACM workshop on Assurable and usable security configuration
Packet flow analysis in IP networks using data-flow analysis
Proceedings of the 5th India Software Engineering Conference
Achieving resilience of heterogeneous networks through predictive, formal analysis
Proceedings of the 2nd ACM international conference on High confidence networked systems
Finding security vulnerabilities in a network protocol using parameterized systems
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
| Hi-index | 0.02 |
Network designers perform challenging tasks with so many configuration options that it is often hard or even impossible for a human to predict all potentially dangerous situations. In this paper, we introduce a formal method approach for verification of security constraints on networks with dynamic routing protocols in use. A unifying model based on packet-filters is employed for modelling of network behaviour. Over this graph model augmented with filtering rules over edges verification of reachability properties can be made. In our approach we also consider topology changes caused by dynamic routing protocols.