<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta>
      <issn pub-type="ppub">1613-0073</issn>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Combining Quantitative and Qualitative Analysis for Safe and Resilient Intelligent Hybrid Systems</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>PaulineBlohm</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>PaulaHerber</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Anne Remke</string-name>
          <email>anne.remke@uni-muenster.de</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Workshop</string-name>
        </contrib>
        <contrib contrib-type="editor">
          <string-name>Hybrid Systems, Formal Verification, Stochastic Failures, Learning, Simulink, Hybrid Automata</string-name>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>University of Münster</institution>
          ,
          <addr-line>Münster</addr-line>
          ,
          <country country="DE">Germany</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Model-driven development frameworks such as MATLAB Simulink are widely used in industrial design processes to conquer the increasing complexity of embedded control systems such as self-driving cars or critical infrastructures. As these systems are often safety-critical, formal methods to ensure safety, performance and resilience are highly desirable, in particular also in the presence of dynamic and uncertain environments. Formal verification has the potential to a) ensure that embedded systems function correctly for all possible system parameters and input scenarios, and b) provide statistical guarantees in the presence of uncertainty and probabilistic behavior. However, the application of existing formal verification and stochastic analysis techniques to embedded control systems is a major challenge, in particular if they are hybrid, i.e. combine discrete and continuous behavior, and include learning components to adapt to dynamic environments. To tackle this challenge, we aim at providing a quantitative analysis for intelligent Simulink models via a transformation to Stochastic Hybrid Automata (SHA) that gives us access to established analysis techniques for stochastic systems, such as reachability analysis or (statistical) model checking. To incorporate dynamic adaptations via learning, we investigate techniques to integrate domain-specific abstractions of the learning components into the SHA model. To ensure resilience of learning hybrid systems, we aim at combining the strengths of qualitative and quantitative analyses.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Problem</title>
      <p>The demands on the functionality and flexibility of embedded control systems are steadily increasing.
At the same time, they are more and more used in critical infrastructures, for example, controlling the
supply of energy or water, and in safety-critical systems such as self-driving cars and other autonomous
vehicles. With that, we increasingly use embedded control systems not only for our convenience
or for profit, but also trust our lives and personal well-being to these systems. At the same time,
learning components are nowadays often used to cope with dynamic environments. This makes it
crucial to ensure the safety, performance, and resilience of these systems under all circumstances.
Qualitative analysis techniques such as deductive verification can provide safety guarantees for hybrid
systems, however, they typically only consider the worst case scenario. In contrast, quantitative analysis
techniques like analytical reachability analysis or statistical model checking (SMC) can provide statistical
guarantees for safety or performance properties even in the presence of uncertainty, however, they
might not provide guarantees for all possible scenarios.</p>
      <p>The integration of learning components and uncertainties further complicates formal verification
of hybrid systems. Qualitative analysis techniques often rely on abstractions, such as contracts, to
handle learning components or uncertainties.</p>
      <p>While these abstractions are necessary to provide
safety guarantees, they usually abstract from all quantitative information, yielding imprecise and
overly pessimistic results. In contrast, quantitative techniques exploit statistical information like the
distribution of events or failure and repair times. However, they sufer from state-space explosion,
in particular if learning components have to be verified to ensure safety under all circumstances or
with high accuracy. Furthermore, quantitative analyses techniques typically do not provide us with</p>
      <p>CEUR</p>
      <p>ceur-ws.org
techniques for modular reasoning.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Proposed Solution</title>
      <p>
        To ensure the safety and resilience of hybrid systems even in the presence of learning and in uncertain
environments, we aim at combining the strengths of qualitative analysis with the strength of quantitative
analysis. We focus on hybrid systems modelled in Simulink as it is widely adopted for embedded control
systems that combine discrete and continuous behavior. Previous work of one of the co-authors has
presented an approach for a qualitative analysis of Simulink models via a transformation to Diferential
Dynamic Logic (dL) [
        <xref ref-type="bibr" rid="ref1 ref2">1, 2</xref>
        ] which is implemented in the tooSlimulink2dL. The resultingdL Model can
then be analyzed usingDeductive Verification to obtain formal guarantees that a system satisfies a given
Safety Property. Our aim is to complement this with eficient and scalable quantitative anal3y,s4i,s5[]
and also to combine these techniques to provide an approach for comprehensive safety, resilience and
performance analysis for intelligent hybrid systems. The concept of the thesis is shown in1Faing.d
consists of four main parts:
1. We plan to provide an automated transformatSiiomnulink2SHA from Simulink to Stochastic
Hybrid Automata. With this transformation, we define a formal semantics for Simulink, and it
gives us access to establisheQduantitative Analysis techniques, such as reachability analysis or
(statistical) model checking.
2. We aim at investigating how to introduce stochastic componentPsrvoibaability Distributions into
the Simulink model to model uncertainties like component failure or sensor noise. With that, we
can also investigate resilience and performance of a model under verification.
3. We aim at investigating hoQwualitative and Quantitative Properties for the dL and SHA models
can be derived from safety, resilience and performance requirements.
4. We plan to provide a technique to combinQeualitative Analysis results (e.g. from deductive
verification) with a Quantitative Analysis for (potentially learning) Simulink models. In particular,
we aim at investigating two diferent approaches: a) the integration of shielded SMC-based
learning, which has been proposed by one of the co-authors in previous work6][, and b) the use
of contracts or other domain-specific abstractions to safely integrate learning components, as has
been proposed by two of the co-authors in2,[
        <xref ref-type="bibr" rid="ref7">7</xref>
        ].
      </p>
      <p>As a first step, we have presented an approach for a manual transformation from Simulink to SHA,
which has been accepted at iFM 20248][. Open research problems we plan to address in this thesis
are how to model uncertainties such that the resulting models are still analyzable, how to capture
qualitative and quantitative properties of intelligent systems appropriately and also how to combine
qualitative with quantitative analysis techniques for SHA with learning components. One key challenge
is that, while modular reasoning would be highly desirable to handle complex systems, there exists no
established concept to include quantitative and statistical information in contracts.</p>
    </sec>
    <sec id="sec-3">
      <title>3. Related Work</title>
      <p>
        There have been quite some eforts to enable the formal verification of systems that are modeled in
Simulink [
        <xref ref-type="bibr" rid="ref10 ref11 ref12 ref13 ref14 ref15 ref9">9, 10, 11, 12, 13, 14, 15</xref>
        ]. Yet, all of these approaches, including the Simulink Design Verifier
[16], are limited to discrete subsets of Simulink. Formal verification methods that support hybrid
systems modeled in Simulink are, e.g., proposed in1[, 17, 18, 19, 20, 21]. However, they either focus on
techniques for a special class of systems and do not provide general transformation rules for a broader
set of blocks or focus on the qualitative analysis of safety properties and they neither take stochastic
components nor learning into consideration.
      </p>
      <p>There also has been a number of works on statistical model checking (SMC) for Simulink, for example
[22, 23, 24]. Still they do not provide a stochastic model with formal semantics and thus cannot make
use of more advanced quantitative analysis techniques.2I5n],[the authors propose a transformation
from Simulink into stochastic timed automata (STA) and perform SMC with UPPAAL SMC on the
resulting network of STA. However, they do not consider stochastic blocks and transform a given
Simulink model into a deterministic STA model where all probabilities are one.</p>
      <p>
        There also exists a broad variety of approaches to formally ensure safety of learning components
using shielding or runtime monitoring2[
        <xref ref-type="bibr" rid="ref6">6, 27, 28</xref>
        ]. These approaches do not directly support Simulink
though, and they do not consider formal analysis techniques that take stochastic failures and learning
into account.
      </p>
      <p>
        Uppaal Stratego29[] uses priced timed automata to model stochastic behavior, and provides tooling
for statistical model checkin3g0[], timed games 3[
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] and learning-based strategy synthesi3s2[]. While
Uppaal Stratego comes with a graphical interface and is designed for usability, the underlying formalisms
are less expressive than stochastic hybrid automata, in particular w.r.t. continuous system behavior
governed by diferential equations and controlled by continuous and stochastic variables.
      </p>
      <p>Finally, there has been some work on combining rigorous formal and statistical method3s.3]I,n [
the authors incorporate statistical hypothesis testing to compute promising configurations of program
verifiers automatically. However, they do not support hybrid systems, and they do not consider both
safety and performance properties. In34[], the authors present a formal framework for an integrated
qualitative and quantitative model-based safety analysis. However, they do not support hybrid systems
and do not consider deductive verification methods.</p>
    </sec>
    <sec id="sec-4">
      <title>4. Progress and Current State</title>
      <p>
        The first step towards safe and resilient hybrid system is enabling a quantitative analysis for (stochastic)
Simulink models. As Simulink does not ofer elaborate quantitative analysis, such as reachability
analysis or statistical model checking, a transformation into a formal model is desired. To tackle this
problem, we are currently working on a modular approach to transform Simulink models into SHA. In
[
        <xref ref-type="bibr" rid="ref8">8</xref>
        ], we present an approach that enables us to transform a subset of Simulink models to SHA and analyze
the SHA using the tooRlealySt [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] to obtain reachability probabilities for critical safety properties.
This is an important first step towards ensuring safety and resilience of hybrid systems in the presence
of uncertainties. However, it still has some limitations, e.g. we only provide transformation rules for a
subset of Simulink blocks and the parallel composition has to be performed manually. To tackle these
limitations, we are currently working on a tool to automatically transform a given Simulink model to an
SHA using the transformation rules provided in8][. Additionally, we plan to define transformation rules
for a larger subset of Simulink blocks and provide better support for the integration of stochasticity into
Simulink models, e.g. by providing parameterized subsystems that model specific stochastic behaviour.
      </p>
      <p>As next steps, we plan to address the research challenges defined above, namely the integration of
stochastic and learning components in Simulink, the derivation of qualitative and quantitative properties
that are important for safety, resilience and performance of intelligent Simulink models in uncertain
and dynamic environments, and the development of combined quantitative and quantitative analysis
techniques that enable us to formally analyze these properties.
verifier for object-oriented programs, in: Int. Symposium on Formal Methods for Components
and Objects, Springer, 2005, pp. 364–387. doi1: 0.1007/11804192_17.
[16] The MathWorks, Simulink Design Verifier, https://de.mathworks.com/products/
simulink-design-verifier.htm,l2024.
[17] A. Chutinan, B. H. Krogh, Computational techniques for hybrid system verification, in: IEEE Trans.</p>
      <p>on Automatic Control, volume 48(1), IEEE, 2003, pp. 64–75. d1o0i:.1109/TAC.2002.806655.
[18] S. Minopoli, G. Frehse, SL2SX translator: from Simulink to SpaceEx models, in: Int. Conf. on Hybrid</p>
      <p>Systems: Computation and Control, ACM, 2016, pp. 93–98. d1o0i:.1145/2883817.2883826.
[19] L. Zou, N. Zhan, S. Wang, M. Fränzle, Formal Verification of Simulink/Stateflow Diagrams, in:
Int. Symposium on Automated Technology for Verification and Analysis (ATVA), volume 9364 of
LNCS, Springer, 2015, pp. 464–481. doi:10.1007/978-3-319-47016-0.
[20] M. Chen, X. Han, T. Tang, S. Wang, M. Yang, N. Zhan, H. Zhao, L. Zou, MARS: A toolchain for
modelling, analysis and verification of hybrid systems, in: Provably Correct Systems, Springer,
2017, pp. 39–58. doi:10.1007/978-3-319-48628-4_3.
[21] T. Liebrenz, P. Herber, S. Glesner, A service-oriented approach for decomposing and verifying
hybrid system models, in: Int. Conference on Formal Aspects of Component Software, volume
12018 of LNCS, Springer, 2019, pp. 127–146. doi:10.1007/978-3-030-40914-2_7.
[22] P. Zuliani, A. Platzer, E. M. Clarke, Bayesian statistical model checking with application to
stateflow/simulink verification, Formal Methods in System Design 43 (2013) 338–367. do1i:0.
1007/s10703-013-0195-3.
[23] A. Legay, L.-M. Traonouez, Statistical model checking of simulink models with Plasma Lab, in:
Formal Techniques for Safety-Critical Systems: 4th International Workshop, Springer, 2016, pp.
259–264. doi:10.1007/978-3-319-29510-7_15.
[24] B. Boyer, K. Corre, A. Legay, S. Sedwards, PLASMA-lab: A flexible, distributable statistical model
checking library, in: Quantitative Evaluation of Systems: 10th International Conference, Springer,
2013, pp. 160–164. doi:10.1007/978-3-642-40196-1_12.
[25] P. Filipovikj, N. Mahmud, R. Marinescu, C. Seceleanu, O. Ljungkrantz, H. Lönn, Simulink to uppaal
statistical model checker: Analyzing automotive industrial systems, in: International Symposium
on Formal Methods, Springer, 2016, pp. 748–756. do1i:0.1007/978-3-319-48989-6_46.
[26] M. Alshiekh, R. Bloem, R. Ehlers, B. Könighofer, S. Niekum, U. Topcu, Safe Reinforcement
Learning via Shielding, Proceedings of the AAAI Conference on Artificial Intelligence 32 (2018).
doi:10.5555/3504035.3504361.
[27] B. Könighofer, F. Lorber, N. Jansen, R. Bloem, Shield synthesis for reinforcement learning, in:
International Symposium on Leveraging Applications of Formal Methods, Springer, 2020, pp.
290–306. doi:10.1007/978-3-030-61362-4_16.
[28] D. Phan, J. Yang, M. Clark, R. Grosu, J. Schierman, S. Smolka, S. Stoller, A Component-Based
Simplex Architecture for High-Assurance Cyber-Physical Systems, in: 2017 17th International
Conference on Application of Concurrency to System Design (ACSD), IEEE, 2017, pp. 49–58.
doi:10.1109/ACSD.2017.23.
[29] A. David, P. G. Jensen, K. G. Larsen, M. Mikučionis, J. H. Taankvist, Uppaal stratego, in: Int.</p>
      <p>Conf. on Tools and Algorithms for the Construction and Analysis of Systems, Springer, 2015, pp.
206–211. doi:10.1007/978-3-662-46681-0_16.
[30] A. David, K. G. Larsen, A. Legay, M. Mikučionis, D. B. Poulsen, Uppaal smc tutorial, International</p>
      <p>Journal on Software Tools for Technology Transfer 17 (2015) 397–415.
[31] F. Cassez, A. David, E. Fleury, K. G. Larsen, D. Lime, Eficient on-the-fly algorithms for the analysis
of timed games, in: M. Abadi, L. de Alfaro (Eds.), Concurrency Theory, Springer, Berlin, Heidelberg,
2005, pp. 66–80. doi:10.1007/11539452_9.
[32] P. Ashok, J. Křetínsk ỳ, K. G. Larsen, A. Le Coënt, J. H. Taankvist, M. Weininger, SOS: Safe, optimal
and small strategies for hybrid markov decision processes, in: International Conference on
Quantitative Evaluation of Systems, Springer, 2019, pp. 147–164. 1d0o.i:1007/978-3-030-30281-8_9.
[33] A. Knüppel, T. Thüm, I. Schaefer, GUIDO: Automated Guidance for the Configuration of Deductive
Program Verifiers, in: IEEE/ACM Int. Conference on Formal Methods in Software Engineering
(FormaliSE), IEEE, 2021, pp. 124–129. doi1:0.1109/FormaliSE52586.2021.00018.
[34] M. Gudemann, F. Ortmeier, A framework for qualitative and quantitative formal model-based
safety analysis, in: IEEE Int. Symposium on High Assurance Systems Engineering, IEEE, 2010, pp.
132–141. doi:10.1109/HASE.2010.24.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>T.</given-names>
            <surname>Liebrenz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Herber</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Glesner</surname>
          </string-name>
          ,
          <article-title>Deductive verification of hybrid control systems modeled in Simulink with KeYmaera X, in:</article-title>
          <source>Int. Conference on Formal Engineering Methods</source>
          , volume
          <volume>11232</volume>
          <source>of LNCS</source>
          , Springer,
          <year>2018</year>
          , pp.
          <fpage>89</fpage>
          -
          <lpage>105</lpage>
          . doi:
          <volume>10</volume>
          .1007/978-3-
          <fpage>030</fpage>
          -02450-
          <issue>5</issue>
          _
          <fpage>6</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>J.</given-names>
            <surname>Adelt</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Liebrenz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Herber</surname>
          </string-name>
          ,
          <article-title>Formal Verification of Intelligent Hybrid Systems that are modeled with Simulink and the Reinforcement Learning Toolbox</article-title>
          , in: Formal Methods, volume
          <volume>13047</volume>
          <source>of LNCS</source>
          , Springer,
          <year>2021</year>
          , pp.
          <fpage>349</fpage>
          -
          <lpage>366</lpage>
          . doi:
          <volume>10</volume>
          .1007/978-3-
          <fpage>030</fpage>
          -90870-6_
          <fpage>19</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>J.</given-names>
            <surname>Delicaris</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Stübbe</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Schupp</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Remke</surname>
          </string-name>
          ,
          <string-name>
            <surname>Realyst: A C+</surname>
          </string-name>
          <article-title>+ tool for optimizing reachability probabilities in stochastic hybrid systems</article-title>
          ,
          <source>in: 16th EAI Int. Conference on Performance Evaluation Methodologies and Tools</source>
          , volume
          <volume>539LNofICS</volume>
          , Springer,
          <year>2023</year>
          , pp.
          <fpage>170</fpage>
          -
          <lpage>182</lpage>
          . doi:
          <volume>10</volume>
          .1007/978-3-
          <fpage>031</fpage>
          -48885-6_
          <fpage>11</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>C.</given-names>
            <surname>Da Silva</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Schupp</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Remke</surname>
          </string-name>
          ,
          <article-title>Optimizing reachability probabilities for a restricted class of stochastic hybrid automata via flowpipe construction</article-title>
          ,
          <source>ACM Trans. Model. Comput. Simul</source>
          .
          <volume>33</volume>
          (
          <year>2023</year>
          ). doi:
          <volume>10</volume>
          .1145/3607197.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>M.</given-names>
            <surname>Niehage</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Remke</surname>
          </string-name>
          ,
          <article-title>The best of both worlds: Analytically-guided simulation of hpngs for optimal reachability</article-title>
          ,
          <source>in: Performance Evaluation Methodologies and Tools</source>
          , Springer Nature,
          <year>2024</year>
          , pp.
          <fpage>61</fpage>
          -
          <lpage>81</lpage>
          . doi:
          <volume>10</volume>
          .1007/978-3-
          <fpage>031</fpage>
          -48885-
          <issue>6</issue>
          _
          <fpage>5</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>M.</given-names>
            <surname>Niehage</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Hartmanns</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Remke</surname>
          </string-name>
          ,
          <article-title>Learning optimal decisions for stochastic hybrid systems</article-title>
          ,
          <source>in: ACM-IEEE Int. Conference on Formal Methods and Models for System Design, ACM</source>
          ,
          <year>2021</year>
          , pp.
          <fpage>44</fpage>
          -
          <lpage>55</lpage>
          . doi:
          <volume>10</volume>
          .1145/3487212.3487339.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>P.</given-names>
            <surname>Blohm</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Adelt</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Herber</surname>
          </string-name>
          ,
          <article-title>Safe Integration of Learning in SystemC using Timed Contracts and Model Checking</article-title>
          , in: R. von Hanxleden,
          <string-name>
            <given-names>S. A.</given-names>
            <surname>Edwards</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Brandt</surname>
          </string-name>
          ,
          <string-name>
            <surname>Q.</surname>
          </string-name>
          Zhu (Eds.),
          <source>21st ACM-IEEE International Symposium on Formal Methods and Models for System Design</source>
          , ACM / IEEE,
          <year>2023</year>
          , pp.
          <fpage>12</fpage>
          -
          <lpage>22</lpage>
          . doi:
          <volume>10</volume>
          .1145/3610579.3611078.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>P.</given-names>
            <surname>Blohm</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Herber</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Remke</surname>
          </string-name>
          ,
          <article-title>Towards Quantitative Analysis of Simulink Models using Stochastic Hybrid Automata</article-title>
          , in: International Conference on Integrated Formal Methods, accepted for publication,
          <year>2024</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>D.</given-names>
            <surname>Araiza-Illan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Eder</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Richards</surname>
          </string-name>
          ,
          <article-title>Formal verification of control systems' properties with theorem proving</article-title>
          ,
          <source>in: UKACC Int. Conference on Control, IEEE</source>
          ,
          <year>2014</year>
          , pp.
          <fpage>244</fpage>
          -
          <lpage>249</lpage>
          .
          <year>do1i0</year>
          :.1109/ CONTROL.
          <year>2014</year>
          .
          <volume>6915147</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <surname>L. De Moura</surname>
            ,
            <given-names>N. Bjørner,</given-names>
          </string-name>
          <article-title>Z3: An eficient SMT solver</article-title>
          ,
          <source>in: International conference on Tools and Algorithms for the Construction and Analysis of Systems</source>
          , Springer,
          <year>2008</year>
          , pp.
          <fpage>337</fpage>
          -
          <lpage>340</lpage>
          .
          <year>1d0o</year>
          .i:
          <volume>1007</volume>
          /
          <fpage>978</fpage>
          -3-
          <fpage>540</fpage>
          -78800-3_
          <fpage>24</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <surname>J.-C. Filliâtre</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Paskevich</surname>
          </string-name>
          , Why3
          <article-title>- where programs meet provers</article-title>
          ,
          <source>in: European Symposium on Programming</source>
          , Springer,
          <year>2013</year>
          , pp.
          <fpage>125</fpage>
          -
          <lpage>128</lpage>
          . doi:
          <volume>10</volume>
          .1007/978-3-
          <fpage>642</fpage>
          -37036-
          <issue>6</issue>
          _
          <fpage>8</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>P.</given-names>
            <surname>Herber</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Reicherdt</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Bittner</surname>
          </string-name>
          ,
          <article-title>Bit-precise formal verification of discrete-time MATLAB/Simulink models using SMT solving</article-title>
          ,
          <source>in: Int. Conference on Embedded Software, IEEE</source>
          ,
          <year>2013</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>10</lpage>
          . doi:
          <volume>10</volume>
          .1109/EMSOFT.
          <year>2013</year>
          .
          <volume>6658586</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>S. K.</given-names>
            <surname>Lahiri</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. A.</given-names>
            <surname>Seshia</surname>
          </string-name>
          ,
          <article-title>The UCLID decision procedure</article-title>
          ,
          <source>in: Int. Conference on Computer Aided Verification</source>
          , Springer,
          <year>2004</year>
          , pp.
          <fpage>475</fpage>
          -
          <lpage>478</lpage>
          . doi:
          <volume>10</volume>
          .1007/978-3-
          <fpage>540</fpage>
          -27813-9_
          <fpage>40</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>R.</given-names>
            <surname>Reicherdt</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Glesner</surname>
          </string-name>
          ,
          <article-title>Formal verification of discrete-time MATLAB/Simulink models using Boogie</article-title>
          ,
          <source>in: Int. Conference on Software Engineering and Formal Methods</source>
          , volume
          <volume>8702</volume>
          oLfNCS, Springer,
          <year>2014</year>
          , pp.
          <fpage>190</fpage>
          -
          <lpage>204</lpage>
          . doi:
          <volume>10</volume>
          .1007/978-3-
          <fpage>319</fpage>
          -10431-7_
          <fpage>14</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>M.</given-names>
            <surname>Barnett</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.-Y. E.</given-names>
            <surname>Chang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>DeLine</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Jacobs</surname>
          </string-name>
          ,
          <string-name>
            <surname>K. R. M. Leino</surname>
          </string-name>
          , Boogie: A modular reusable
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>