Refutational normalization reconciles efficiency and completeness for JSON Schema inclusion checking.
Checking NFA equivalence with bisim- ulations up to congruence
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
Proposes embedding on-the-fly minimization via equivalence registries into subset construction and Brzozowski's algorithm for NFA canonization, with empirical improvements on automatic sequences and an open-source implementation.
citing papers explorer
-
JSON Schema Inclusion through Refutational Normalization: Reconciling Efficiency and Completeness
Refutational normalization reconciles efficiency and completeness for JSON Schema inclusion checking.
-
Deconstructing Subset Construction -- Reducing While Determinizing
Proposes embedding on-the-fly minimization via equivalence registries into subset construction and Brzozowski's algorithm for NFA canonization, with empirical improvements on automatic sequences and an open-source implementation.