A framework for modeling the semantics of expression evaluation with abstract state machines

  • Authors:
  • Wolf Zimmermann;Axel Dold

  • Affiliations:
  • Martin-Luther Universität Halle-Wittenberg, Institut für Informatik, Germany;Universität Ulm, Abteilung Künstliche Intelligenz, Ulm, Germany

  • Venue:
  • ASM'03 Proceedings of the abstract state machines 10th international conference on Advances in theory and practice
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present a framework for formalizing the semantics of expression evaluation using Abstract State Machines. Many programming languages allow some non-determinism for evaluating expressions. The semantics only have in common that arguments are evaluated before an operator is applied. The evaluation of one argument may be interleaved with the evaluation of the other arguments. However, programming languages usually restrict this most liberal evaluation order. For example, the expression evaluation may take into account short-circuit evaluation of boolean expressions which implies that right operands must not be evaluated before the complete left operand is evaluated. Our approach provides a generic expression evaluation semantics that only need to be instantiated adequatly. We demonstrate this approach by the example of Ada95, C, C++, Java, C#, and Fortran.