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.
[1]
Peter Dybjer,et al.
Dependent Types at Work
,
2009,
LerNet ALFA Summer School.
[2]
Burkhart Wolff,et al.
A Symbolic Operational Semantics for TESL - With an Application to Heterogeneous System Testing
,
2017,
FORMATS.
[3]
Mamoun Filali,et al.
A Mechanized Semantic Framework for Real-Time Systems
,
2013,
FORMATS.
[4]
Ulf Norell.
Dependently typed programming in Agda
,
2009,
TLDI '09.
[5]
Per Martin-Löf,et al.
Intuitionistic type theory
,
1984,
Studies in proof theory.
[6]
Julien DeAntoni,et al.
TimeSquare: Treat Your Models with Logical Time
,
2012,
TOOLS.
[7]
Rachel Cardell-Oliver,et al.
An embedding of Timed Transition Systems in HOL
,
1993,
Formal Methods Syst. Des..
[8]
Christine Paulin-Mohring.
Modelisation of Timed Automata in Coq
,
2001,
TACS.