Introduces refactoring-as-propositions in dRL to prove hybrid system refactorings preserve required properties via proved refinements, supporting automatic or modular local proofs.
(eds.) Theories of Programming and Formal Methods - Essays Dedicated to Jifeng He on the Occasion of His 70th Birthday
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
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.