Abstract
Following the approach in UTP, we describe a language of state-rich processes with communication, concurrency, and imperative commands on program variables. We give this language an operational semantics, with states and transitions represented symbolically. The semantics is described in Z, allowing us to execute the semantics using an animator, and to start work on a mechanical proof of correctness using the deep embedding in ProofPowerZ of the existing denotational semantics for the language. An extension of the operational semantics has been used in an algorithm to construct automata as part of the Circus model checker. This is joint work with Ana Cavalcanti and Leonardo Freitas.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsAuthor information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Woodcock, J. (2006). An Operational Semantics in UTP for a Language of Reactive Designs (Abstract). In: Dunne, S., Stoddart, B. (eds) Unifying Theories of Programming. UTP 2006. Lecture Notes in Computer Science, vol 4010. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11768173_5
Download citation
DOI: https://doi.org/10.1007/11768173_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34750-7
Online ISBN: 978-3-540-34752-1
eBook Packages: Computer ScienceComputer Science (R0)