View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Cronfa at Swansea University Institution-based Encoding and Verification of Simple UML State Machines in CASL/SPASS Tobias Rosenberger1;2, Saddek Bensalem2, Alexander Knapp3, and Markus Roggenbach1 1 Swansea University, U.K. ft.rosenberger.971978;
[email protected] 2 Université Grenoble Alpes, France
[email protected] 3 Universität Augsburg, Germany
[email protected] Abstract. We present a new approach on how to provide institution-based seman- tics for UML state machines. Rather than capturing UML state machines directly # as an institution, we build up a new logical framework MD into which UML # state machines can be embedded. A theoroidal comorphism maps MD into the Casl institution. This allows for symbolic reasoning on UML state machines. By utilising the heterogeneous toolset HeTS that supports Casl, a broad range of verification tools, including the automatic theorem prover Spass, can be combined in the analysis of a single state machine. 1 Introduction As part of a longstanding line of research [9,10,19,8], we set out on a general programme to bring together multi-view system specification with UML diagrams and heterogeneous specification and verification based on institution theory, giving the different system views both a joint semantics and richer tool support. Institutions, a formal notion of a logic, are a principled way of creating such joint semantics. They make moderate assumptions about the data constituting a logic, give uniform notions of well-behaved translations between logics and, given a graph of such translations, automatically give rise to a joint institution.