Introduces a layer-order automaton model that equates faithful online enforcement to regular prefix-closed languages under causal visibility and shows equivalence to deterministic edit automata while preserving layer-local invariants.
Rewriting-based techniques for runtime verification
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CR 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Layer Order Semantics for Automata-Based Cybersecurity
Introduces a layer-order automaton model that equates faithful online enforcement to regular prefix-closed languages under causal visibility and shows equivalence to deterministic edit automata while preserving layer-local invariants.