Topic: semantics by an abstract machine
Topic: program proof via assertions
ThesaHelp: references g-h
Topic: uniform language systems
| |
Reference
Hoare, C.A.R., Lauer, P.E.,
"Consistent and complementary formal theory of the semantics of programming languages",
Acta Informatica, 3, 2, pp. 135-54, 1974.
Google
Quotations
136 ;;Quote: a regular language has many formal descriptions
| QuoteRef: hoarCA2_1974 ;;139 interpretive model-- abstract machine with control function (eg Vienna definition
| QuoteRef: hoarCA2_1974 ;;142 computation model--memory state sequence through recursion on sub-parts of statement [like this one]
| QuoteRef: hoarCA2_1974 ;;144 relational model--defined by axioms. theorems of true assertions on memory states before and after program execution
| QuoteRef: hoarCA2_1974 ;;146 deductive theory--describe memory state properties before and after each statement [like this one]
|
Related Topics
Topic: semantics by an abstract machine (38 items)
Topic: program proof via assertions (61 items)
ThesaHelp: references g-h (299 items)
Topic: uniform language systems (25 items)
|