# Relational Differential Dynamic Logic

@article{Kolck2020RelationalDD,
title={Relational Differential Dynamic Logic},
author={Juraj Kolc{\'a}k and Ichiro Hasuo and J{\'e}r{\'e}my Dubut and Shin-ya Katsumata and David Sprunger and Akihisa Yamada},
journal={Tools and Algorithms for the Construction and Analysis of Systems},
year={2020},
volume={12078},
pages={191 - 208}
}
• Juraj Kolcák, +3 authors A. Yamada
• Published 1 March 2019
• Computer Science
• Tools and Algorithms for the Construction and Analysis of Systems
In the field of quality assurance of hybrid systems, Platzer’s differential dynamic logic (dL) is widely recognized as a deductive verification method with solid mathematical foundations and sophisticated tool support. Motivated by case studies provided by our industry partner, we study a relational extension of dL, aiming to formally prove statements such as “an earlier engagement of the emergency brake yields a smaller collision speed.” A main technical challenge is to combine two dynamics…
1 Citations
Relational Analysis of Sensor Attacks on Cyber-Physical Systems
• Computer Science
2021 IEEE 34th Computer Security Foundations Symposium (CSF)
• 2021
A framework for modeling and analyzing sensor attacks on cyber-physical systems, using the formalism of hybrid programs, is contributed and two relational properties of a system’s robustness are formalized and analyzed.

## References

SHOWING 1-10 OF 36 REFERENCES
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.
Simple relational correctness proofs for static analyses and program transformations
We show how some classical static analyses for imperative programs, and the optimizing transformations which they enable, may be expressed and proved correct using elementary logical and
Robustness of Temporal Logic Specifications
• Computer Science
FATES/RV
• 2006
This paper defines robust, multi-valued semantics for MTL formulas, which capture not only the usual Boolean satisfiability of the formula, but also topological information regarding the distance, e, from unsatisfiability.
Differential Dynamic Logic for Hybrid Systems
• A. Platzer
• Mathematics, Computer Science
Journal of Automated Reasoning
• 2008
A dynamic logic for hybrid programs is introduced, which is a program notation for hybrid systems with a free variable proof calculus with a novel combination of real-valued free variables and Skolemisation for lifting quantifier elimination for real arithmetic to dynamic logic.
Metric Semantics for Probabilistic Relational Reasoning
• Computer Science
ArXiv
• 2018
This work shows how to extend Fuzz to encompass more general relational properties of probabilistic programs, with a motivating example being the (\epsilon, {\delta})-variant of differential privacy.
Probabilistic Relational Reasoning via Metrics
• Computer Science
2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
• 2019
The Fuzz programming language by Reed and Pierce uses an elegant linear type system combined with a monad-like type to express and reason about probabilistic sensitivity properties, most notably
Deductive Verification of Hybrid Control Systems Modeled in Simulink with KeYmaera X
• Computer Science
ICFEM
• 2018
An approach to map the informally defined execution semantics of hybrid Simulink models into the formally well-defined semantics of differential dynamic logic ( Open image in new window ); in doing so, this work provides a formal foundation for Simulinks, and enables deductive formal verification of hybridSimulinks models with an interactive theorem prover for hybrid systems.
Programming with Infinitesimals: A While-Language for Hybrid System Modeling
• Mathematics, Computer Science
ICALP
• 2011
This work rigorously defines the semantics of programs in the language of nonstandard analysis, on the basis of which the program logic is shown to be sound and relatively complete and a framework for modeling and verification of hybrid systems.
Approximate Bisimulation: A Bridge Between Computer Science and Control Theory
• Computer Science
Eur. J. Control
• 2011
A framework of system approximation that applies to both discrete and continuous systems and contains a hierarchy of approximation metrics between two systems that quantify the quality of the approximation, and captures the established notions in computer science as zero sections.
A Complete Uniform Substitution Calculus for Differential Dynamic Logic
• A. Platzer
• Computer Science, Mathematics
Journal of Automated Reasoning
• 2016
This article introduces a relatively complete proof calculus for differential dynamic logic (dL) that is entirely based on uniform substitution, a proof rule that substitutes a formula for a