Skip to main content

Mechanizing the Denotational Semantics of the Clock Constraint Specification Language

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 11163))

Abstract

Domain Specific Modelling Languages provide the designers with appropriate languages for the task they must conduct. These dedicated languages play a key role in popular Model Driven Engineering (MDE) approaches. Their semantics are usually written in a semi-formal manner mixing natural language and mathematical notations. The mechanization of these semantics rely on formal specification languages. They are usually conducted in order to assess the correctness of verification and transformation tools for such languages. This contribution illustrates such a mechanization for the Clock Constraint Specification Language (CCSL). This language allows to model the timed concurrency concern in the MARTE UML profile and was designed to be easier to master than temporal logics for the system engineers. Its semantics has been defined in the usual semi-formal manner and implemented in the TimeSquare simulation tool. We discuss the interest of this mechanization and show how it allowed to prove properties about this language and ease the definition of a refinement relation for such models. This work relies on the Agda proof assistant and is presented accordingly.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. André, C., Mallet, F.: Clock Constraints in UML/MARTE CCSL. Research Report RR-6540, INRIA (2008)

    Google Scholar 

  2. Bertot, Y., Castéran, P.: Interactive Theorem Proving and Program Development - Coq’Art: The Calculus of Inductive Constructions. Texts in Theoretical Computer Science. An EATCS Series. Springer, Heidelberg (2004)

    Book  Google Scholar 

  3. Bove, A., Dybjer, P.: Dependent types at work. In: Language Engineering and Rigorous Software Development, International LerNetALFA Summer School 2008, Piriapolis, Uruguay, February 24–March 1 2008, Revised Tutorial Lectures, pp. 57–99 (2008)

    Google Scholar 

  4. Deantoni, J., André, C., Gascon, R.: CCSL denotational semantics. Research Report RR-8628, INRIA (2014)

    Google Scholar 

  5. Deantoni, J., Mallet, F.: TimeSquare: treat your models with logical time. In: TOOLS - 50th International Conference on Objects, Models, Components, Patterns - 2012 (2012)

    Google Scholar 

  6. Garnacho, M., Bodeveix, J., Filali-Amine, M.: A mechanized semantic framework for real-time systems. In: Proceedings of Formal Modeling and Analysis of Timed Systems - 11th International Conference, FORMATS 2013, Buenos Aires, Argentina, 29–31 August 2013 (2013)

    Google Scholar 

  7. Hale, R., Cardell-Oliver, R., Herbert, J.: An embedding of timed transition systems in HOL. Formal Methods Syst. Des. 3(1/2) (1993)

    Google Scholar 

  8. Malakhovski, J.: Brutal [meta]introduction to dependent types in agda

    Google Scholar 

  9. Martin-Löf, P.: Intuitionistic type theory

    Google Scholar 

  10. Martin-Löf, P.: Intuitionistic type theory. Notes by Giovanni Sambin

    Google Scholar 

  11. Montin, M., Pantel, M.: Ordering strict partial orders to model behavioural refinement. In: Proceedings of 18th Refinement Workshop 2018, affiliated with FM 2018 and part of FLoC 2018 (2018)

    Google Scholar 

  12. Norell, U.: Dependently typed programming in agda. In: Proceedings of TLDI 2009: 2009 ACM SIGPLAN International Workshop on Types in Languages Design and Implementation, Savannah, GA, USA, 24 January 2009 (2009)

    Google Scholar 

  13. Paulin-Mohring, C.: Modelisation of timed automata in Coq. In: Kobayashi, N., Pierce, B.C. (eds.) TACS 2001. LNCS, vol. 2215, pp. 298–315. Springer, Heidelberg (2001). https://doi.org/10.1007/3-540-45500-0_15

    Chapter  MATH  Google Scholar 

  14. Nguyen Van, H., Balabonski, T., Boulanger, F., Keller, C., Valiron, B., Wolff, B.: A symbolic operational semantics for TESL. In: Abate, A., Geeraerts, G. (eds.) FORMATS 2017. LNCS, vol. 10419, pp. 318–334. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-65765-3_18

    Chapter  Google Scholar 

  15. Winskel, G.: Event structures. In: Petri Nets: Central Models and Their Properties, Advances in Petri Nets 1986, Part II, Proceedings of an Advanced Course, Bad Honnef, 8–19 September 1986 (1986)

    Google Scholar 

Download references

Acknowledgement

The authors would like to thank the CCSL team at INRIA for providing them with their time and valuable expertise regarding this language.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Marc Pantel .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Montin, M., Pantel, M. (2018). Mechanizing the Denotational Semantics of the Clock Constraint Specification Language. In: Abdelwahed, E., Bellatreche, L., Golfarelli, M., Méry, D., Ordonez, C. (eds) Model and Data Engineering. MEDI 2018. Lecture Notes in Computer Science(), vol 11163. Springer, Cham. https://doi.org/10.1007/978-3-030-00856-7_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-00856-7_26

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-00855-0

  • Online ISBN: 978-3-030-00856-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics