抄録
This paper extends V. Pratt's dynamic logic so as to treat assignment statements concerning Pascal-like pointers and records. It presents backward transformation rules for these statements and gives the formal justification of the rules by extending Pratt's program-semantics. Properties of programs which manipulate more complex data structures composed of pointers and records (e. g. , linked stacks, queues, trees, etc. ) can be described in the logic. The authors prove as an example a partial correctness assertion of a program which treats a linked stack.
本文言語 | 英語 |
---|---|
ページ(範囲) | 641-648 |
ページ数 | 8 |
ジャーナル | Transactions of the Institute of Electronics and Communication Engineers of Japan, Section E (English) |
巻 | E62 |
号 | 10 |
出版ステータス | 出版済み - 1月 1 1979 |
!!!All Science Journal Classification (ASJC) codes
- 工学(全般)