An SMT-Based Approach to the Formal Analysis of MARTE/CCSL

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10009)

Abstract

MARTE (abbreviated for Modeling and Analysis of Real-Time and Embedded systems) is a UML profile which provides a general modeling framework to design and analyze real-time embedded systems. CCSL (abbreviated for Clock Constraint Specification Language) is a formal language companion to MARTE, used to specify the constraints between the occurrences of events in real-time embedded systems. Many approaches have been proposed to the formal analysis of CCSL such as simulation and model checking. We propose in this paper an SMT-based approach to the formal analysis of CCSL. It is well-known that the SMT-based approach can effectively overcome the state-explosion problem for model checking, and can also be used for theorem proving. The latter feature allows us to prove the invalidity of ccsl constraints, which most of the existing approaches lack. We implement the proposed approach in a prototype tool clyzer on top of \(\mathbb {K}\) framework and use Z3 as the underlying SMT solver.

Keywords

MARTE/CCSL SMT Z3 \(\mathbb {K}\) framework Model checking 

References

  1. 1.
    André, C., Cuccuru, A., Dekeyser, J.L., et al.: MARTE: a new OMG profile RFP for the modeling and analysis of real-time embedded systems. In: Proceedings of the 2nd UML-SoC Workshop (2005)Google Scholar
  2. 2.
    Barrett, C., Fontaine, P., Tinelli, C.: The SMT-LIB standard (version 2.5) (2015)Google Scholar
  3. 3.
    Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. MIT Press, Cambridge (2001)CrossRefGoogle Scholar
  4. 4.
    Clavel, M., Durán, F., Eker, S., Lincoln, P., Martí-Oliet, N., Meseguer, J., Talcott, C. (eds.): All About Maude - A High-Performance Logical Framework: How to Specify, Program and Verify Systems in Rewriting Logic. LNCS, vol. 4350. Springer, Heidelberg (2007)MATHGoogle Scholar
  5. 5.
    Ebeid, E., Fummi, F., Quaglia, D.: HDL code generation from UML/MARTE sequence diagrams for verification and synthesis. Des. Autom. Embed. Syst. 19(3), 277–299 (2015)CrossRefGoogle Scholar
  6. 6.
    Ellison, C., Roşu, G.: An executable formal semantics of C with applications. In: Proceedings of the 39th POPL, pp. 533–544. ACM (2012)Google Scholar
  7. 7.
    Feiler, P., Hansson, J.: Flow latency analysis with the architecture analysis and design language (AADL) (2007)Google Scholar
  8. 8.
    Gascon, R., Mallet, F., DeAntoni, J.: Logical time and temporal logics: comparing UML MARTE/CCSL and PSL. In: Proceedings of the 18th TIME, pp. 141–148. IEEE CS (2011)Google Scholar
  9. 9.
    Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Commun. ACM 21(7), 558–565 (1978)CrossRefMATHGoogle Scholar
  10. 10.
    Mallet, F., André, C.: On the semantics of UML/MARTE clock constraints. In: Proceedings of ISORC, pp. 305–312. IEEE CS (2009)Google Scholar
  11. 11.
    Mallet, F., de Simone, R.: Correctness issues on MARTE/CCSL constraints. Sci. Comput. Program. 106, 78–92 (2015)CrossRefGoogle Scholar
  12. 12.
    de Moura, L., Bjørner, N.S.: Z3: an efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337–340. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  13. 13.
    Roşu, G., Şerbănută, T.F.: An overview of the \(\mathbb{K}\) semantic framework. J. Logic Algebraic Program. 79(6), 397–434 (2010)MathSciNetCrossRefMATHGoogle Scholar
  14. 14.
    Suryadevara, J., Seceleanu, C., Mallet, F., Pettersson, P.: Verifying MARTE/CCSL mode behaviors using UPPAAL. In: Hierons, R.M., Merayo, M.G., Bravetti, M. (eds.) SEFM 2013. LNCS, vol. 8137, pp. 1–15. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  15. 15.
    Yin, L., Mallet, F., Liu, J.: Verification of MARTE/CCSL time requirements in Promela/SPIN. In: Proceedings of the 16th ICECCS, pp. 65–74. IEEE CS (2011)Google Scholar
  16. 16.
    Zhang, M., Mallet, F.: An executable semantics of clock constraint specification language and its applications. In: Artho, C., et al. (eds.) FTSCS 2015. CCIS, vol. 596, pp. 37–51. Springer, Heidelberg (2016). doi:10.1007/978-3-319-29510-7_2 CrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG 2016

Authors and Affiliations

  1. 1.Shanghai Key Laboratory of Trustworthy ComputingECNUShanghaiChina
  2. 2.University of Nice Sophia Antipolis, I3S, UMR 7271 CNRSNiceFrance
  3. 3.INRIA Sophia Antipolis MéditerranéeValbonneFrance

Personalised recommendations