Enhanced Operational Semantics PIERPAOLO DEGANO AND CORRADO PRIAMI Dipartimento di Informatica, Universita di Pisa, Pisa, Italy {degano,priami}@di.unipi.it ` The behavior of machines is conveniently given by an operational approach that describes the transitions between states that a machine performs while computing. The states and the transitions, possibly labeled by the activity they represent, give rise to a transition system. A logical approach to operational semantics due to Plotkin and to his formal method, called structural operational semantics [Plotkin 1981; Nielson and Nielson 1992], exploits the duality between languages and abstract machines, so one deduces transitions by inducing on the syntactic structure of the machine itself. We propose an enhancement to structural operational semantics capable of expressing (almost) all the information needed during software production. Indeed, our approach can be easily specialized, both to cover the various different aspects relevant to the project phase and to refine in more and more detail specifications towards implementations. Operational semantics is mathematically simple and is close to intuition, thus giving guidelines for implementation. It permits the use of induction for proving properties of programs. This approach is better suited than others to cope with programming languages that include heterogeneous features. In fact,
/lp/association-for-computing-machinery/enhanced-operational-semantics-akcCx9wu94