Connecting software build with maintaining consistency between models: towards sound, optimal, and flexible building from megamodels. Perdita Stevens. Softw Syst Model 19, 935–958, 2020. 2020 shelley2024-07-26T09:03:55+00:00 Share this content FacebookXLinkedInWhatsAppEmail Related Posts History-deterministic Timed Automata. History-deterministic Timed Automata. Compositional Assume-Guarantee Reasoning of Control Law Diagrams Using UTP. Compositional Assume-Guarantee Reasoning of Control Law Diagrams Using UTP. Strongly Normalizing Higher-Order Relational Queries. Strongly Normalizing Higher-Order Relational Queries. Proof-Producing Synthesis of CakeML from Monadic HOL Functions. Proof-Producing Synthesis of CakeML from Monadic HOL Functions.
by