scientific article; zbMATH DE number 3688693

MaRDI QIDQ3883473zbMATH OpenFDO

Authors J. A. Bergstra, John V. Tucker

Publication date 1980

zbMATH Keywords

partial correctnessequational logicHoare logicsequational specificationsinitial algebra semanticscomputable data typescomputable intermediate assertions

Mathematics Subject Classification ID

Data structures (68P05) Specification and verification (program logics, model checking, etc.) (68Q60) Theory of numerations, effectively presented structures (03D45) Abstract data types; algebraic specification (68Q65) Applications of computability and recursion theory (03D80) Undecidability and degrees of sets of sentences (03D35) Abstract and axiomatic computability and recursion theory (03D75)

Cited in

(2)

• Some natural structures which fail to possess a sound and decidable Hoare-like logic for their while-programs
• Some questions about expressiveness and relative completeness in Hoare's logic

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3883473)