Introduces refactoring-as-propositions in dRL to prove hybrid system refactorings preserve required properties via proved refinements, supporting automatic or modular local proofs.
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
Develops Bishop-style constructive apparatus for geometric sets, integration, extremum theorems, selectors, differential inclusions, Markov chains, and densities in systems and control.
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.
-
Some Essential Constructive Foundations for Systems and Control
Develops Bishop-style constructive apparatus for geometric sets, integration, extremum theorems, selectors, differential inclusions, Markov chains, and densities in systems and control.