Visibly recursive automata extend procedural automata and use codeterminism to achieve efficient complementation and other desirable algorithmic properties.
Scalable, graph- based network vulnerability analysis
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
Extension of MulVAL attack graphs to incorporate physical topology, short-range protocols, protocol design vulnerabilities, and industrial architectures, demonstrated via modeling of spoofing, MITM, and DoS attacks on an IT-industrial testbed.
citing papers explorer
-
Visibly Recursive Automata
Visibly recursive automata extend procedural automata and use codeterminism to achieve efficient complementation and other desirable algorithmic properties.
-
Extending Attack Graphs to Represent Cyber-Attacks in Communication Protocols and Modern IT Networks
Extension of MulVAL attack graphs to incorporate physical topology, short-range protocols, protocol design vulnerabilities, and industrial architectures, demonstrated via modeling of spoofing, MITM, and DoS attacks on an IT-industrial testbed.