A Behavioral Specification of Imperative Programming Languages*This paper was presented at Session TD3: Computer Systems & Applications (2) 3 of ITC-CSCC 2005.

  • Authors:

  • Masaki Nakamura;Masahiro Watanabe;Kokichi Futatsugi

  • Affiliations:

  • The authors are with the School of Information Science, Japan Advanced Institute of Science and Technology, Nomi-shi, 923-1292 Japan. E-mail: masaki-n@jaist.ac.jp,;The author is with Production Engineering Research Laboratory, Hitachi, Ltd., Yokohama-shi, 244-0817 Japan.;The authors are with the School of Information Science, Japan Advanced Institute of Science and Technology, Nomi-shi, 923-1292 Japan. E-mail: masaki-n@jaist.ac.jp,

  • Venue:
  • IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we give a denotational semantics of imperative programming languages as a CafeOBJ behavioral specification. Since CafeOBJ is an executable algebraic specification language, not only execution of programs but also semi-automatic verification of programs properties can be done. We first describe an imperative programming language with integer and Boolean types, called IPL. Next we discuss about how to extend IPL, that is, IPL with user-defined types. We give a notion of equivalent programs, which is defined by using the notion of the behavioral equivalence of behavioral specifications. We show a sufficient condition for the equivalence relation of programs, which reduces the task to prove programs to be equivalent.