Fixed MSO queries admit ranked enumeration with linear preprocessing and constant delay on grammar-compressed strings.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Introduces refactoring-as-propositions in dRL to prove hybrid system refactorings preserve required properties via proved refinements, supporting automatic or modular local proofs.
citing papers explorer
-
Ranked MSO-enumeration over compressed words
Fixed MSO queries admit ranked enumeration with linear preprocessing and constant delay on grammar-compressed strings.
-
Refactoring-as-Propositions: Proved Refactoring of Hybrid Systems via Proved Refinements
Introduces refactoring-as-propositions in dRL to prove hybrid system refactorings preserve required properties via proved refinements, supporting automatic or modular local proofs.