# Refactoring, Refinement, and Reasoning - A Logical Characterization for Hybrid Systems

@inproceedings{Mitsch2014RefactoringRA, title={Refactoring, Refinement, and Reasoning - A Logical Characterization for Hybrid Systems}, author={Stefan Mitsch and Jan-David Quesel and A. Platzer}, booktitle={FM}, year={2014} }

Refactoring of code is a common device in software engineering. As cyber-physical systems CPS become ever more complex, similar engineering practices become more common in CPS development. Proper safe developments of CPS designs are accompanied by a proof of correctness. Since the inherent complexities of CPS practically mandate iterative development, frequent changes of models are standard practice, but require reverification of the resulting models after every change.
To overcome this… Expand

#### Supplemental Presentations

Presentation Slides

Refactoring, Refinement, and Reasoning - A Logical Characterization for Hybrid Systems

#### 23 Citations

A Logical Characterization for Hybrid Systems

- Computer Science
- 2014

This work develops proof-aware refactorings for CPS and shows how the impact of model transformations on correctness can be characterized by dierent notions of renement in dierential dy- namic logic. Expand

Di ff erential Refinement Logic ∗

- 2016

We introduce differential refinement logic (dRL), a logic with firstclass support for refinement relations on hybrid systems, and a proof calculus for verifying such relations. dRL simultaneously… Expand

Handling Refinement of Continuous Behaviors: A Proof Based Approach with Event-B

- Computer Science
- 2019 International Symposium on Theoretical Aspects of Software Engineering (TASE)
- 2019

This paper addresses the formal development of CPS using correct-by-construction refinement and proof based approaches using the Event-B formal method and shows that the generic formal model, integrating both discrete and continuous behaviors, can be instantiated by various kinds of CPS. Expand

Differential Refinement Logic*

- Computer Science
- 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
- 2016

dRℒ is introduced, a logic with first-class support for refinement relations on hybrid systems, and a proof calculus for verifying such relations, and its usefulness is demonstrated with examples where using refinement results in easier and better-structured proofs. Expand

Compositional Proofs in Differential Dynamic Logic dL

- Computer Science
- 2017 17th International Conference on Application of Concurrency to System Design (ACSD)
- 2017

This paper defines a new composition operator in dL and proves that it is associative and commutative (AC), and provides a theorem which characterizes necessary conditions to automate the proof that composed components satisfy the composition of their individual contracts, enabling modular and compositional verification. Expand

Controller Verification and Design with Logical Analysis Support

- Computer Science
- 2015

The addition of a forward invariant cut proof rule to KeYmaera’s reasoning calculus allows one to leverage designer insights into proofs of safety of aclosed-loop system, and a tool called Perseus to automatically check when a controller satisfies a control envelope is described. Expand

ModelPlex: verified runtime validation of verified cyber-physical system models

- Computer Science
- Formal Methods Syst. Des.
- 2016

ModelPlex is introduced, a method ensuring that verification results about models apply to CPS implementations and a systematic technique to synthesize provably correct monitors automatically from CPS proofs in differential dynamic logic by a correct-by-construction approach, leading to verifiably correct runtime model validation. Expand

A Component-Based Approach to Hybrid Systems Safety Verification

- Computer Science
- IFM
- 2016

This paper introduces the necessary formalism to define the structure and behavior of components and a technique how to compose components such that safety properties provably emerge from component safety. Expand

Modeling and cross-domain dependability analysis of cyber-physical systems

- Computer Science
- 2018 Annual IEEE International Systems Conference (SysCon)
- 2018

A novel method of modeling and formal verification to support dependability analyses is demonstrated in an example of a fault management capability of robots that interacts with equipment and humans. Expand

Collaborative Verification-Driven Engineering of Hybrid Systems

- Computer Science
- Math. Comput. Sci.
- 2014

A verification-driven engineering toolset that extends previous work on hybrid and arithmetic verification with tools for graphical and textual modeling of hybrid systems, exchanging and comparing models and proofs, and managing verification tasks, which makes it easier to tackle large-scale verification tasks. Expand

#### References

SHOWING 1-10 OF 33 REFERENCES

A Logical Characterization for Hybrid Systems

- Computer Science
- 2014

This work develops proof-aware refactorings for CPS and shows how the impact of model transformations on correctness can be characterized by dierent notions of renement in dierential dy- namic logic. Expand

Refactoring object-oriented frameworks

- Computer Science
- 1992

This thesis gives some conservative algorithms for determining whether a program satisfies constraints, and describes how to use this design information to refactor a program. Expand

A Vision of Collaborative Verification-Driven Engineering of Hybrid Systems

- Computer Science
- 2013

A verification-driven engineering toolset that extends previous work on hybrid and arithmetic verification with tools for modeling hybrid systems, exchanging and comparing models and proofs, and managing verification tasks, which makes it easier to tackle large-scale verification tasks. Expand

Abstraction and Counterexample-Guided Refinement in Model Checking of Hybrid Systems

- Computer Science
- Int. J. Found. Comput. Sci.
- 2003

This paper presents a new procedure to perform this refinement operation for abstractions of hybrid systems, and shows how reachability computations with varying degrees of complexity can be used to refine hybrid system abstractions efficiently. Expand

Counterexample-guided abstraction refinement for symbolic model checking

- Computer Science
- JACM
- 2003

An automatic iterative abstraction-refinement methodology that extends symbolic model checking to large hardware designs and devise new symbolic techniques that analyze such counterexamples and refine the abstract model correspondingly. Expand

Collaborative Verification-Driven Engineering of Hybrid Systems

- Computer Science
- Math. Comput. Sci.
- 2014

A verification-driven engineering toolset that extends previous work on hybrid and arithmetic verification with tools for graphical and textual modeling of hybrid systems, exchanging and comparing models and proofs, and managing verification tasks, which makes it easier to tackle large-scale verification tasks. Expand

Rodin: an open toolset for modelling and reasoning in Event-B

- Computer Science
- International Journal on Software Tools for Technology Transfer
- 2010

This article presents the Rodin modelling tool that seamlessly integrates modelling and proving, and outlines how the Event-B language was designed to facilitate proof and how the tool has been designed to support changes to models while minimising the impact of changes on existing proofs. Expand

The behavioural semantics of Event-B refinement

- Mathematics, Computer Science
- Formal Aspects of Computing
- 2012

A behavioural semantics for Event-B refinement is given, with a treatment for the first time of events and of anticipated events, adding to the well-understood treatment of convergent events. Expand

KeYmaera: A Hybrid Theorem Prover for Hybrid Systems (System Description)

- Mathematics, Computer Science
- IJCAR
- 2008

This work integrates real quantifier elimination following an iterative background closure strategy to overcome the complexity of real arithmetic and implements a generalized free-variable sequent calculus and automatic proof strategies that decompose the hybrid system specification symbolically. Expand

Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets

- Computer Science
- FORMATS
- 2008

This paper shall semi-formally introduce these time dependant models, discuss their strengths and weaknesses, and provide an overview of the known results about the relationships among the models. Expand