Abstract
Pratt's dynamic logic is extended to encompass programs with Pascal-like pointers and record variables. In this way more complicated data structures may be described. Some examples are given on application of this extension for a program to a linked stack. Formal justification of the backward transformations for assignment statements concerning pointers and records is presented.
Original language | English |
---|---|
Pages (from-to) | 301-325 |
Number of pages | 25 |
Journal | Mem Fac Eng Kyushu Univ |
Volume | 38 |
Issue number | 4 |
Publication status | Published - Jan 1 1978 |
All Science Journal Classification (ASJC) codes
- Energy(all)
- Atmospheric Science
- Earth and Planetary Sciences(all)
- Management of Technology and Innovation