A lattice-theoretical algorithm, #PEC, builds unique minimal packet equivalence classes with exact cardinality counting, avoiding BDD overhead while supporting richer match conditions.
An incremental algorithm to construct a lattice of set interse ctions,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.NI 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification
A lattice-theoretical algorithm, #PEC, builds unique minimal packet equivalence classes with exact cardinality counting, avoiding BDD overhead while supporting richer match conditions.