Formalizing Dijkstra's predicate transformer wp in weak second-order logic

DOI10.1016/0304-3975(94)00184-KzbMath0873.68033MaRDI QIDQ673132

Birgit Elbl, Rudolf Berghammer, Ulf R. Schmerl

Publication date: 28 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

Dijkstra's predicate transformer wp

Mathematics Subject Classification ID

Theory of software (68N99)

Related Items (1)

Verifiable properties of database transactions

Cites Work

• Proving total correctness of nondeterministic programs in infinitary logic
• Characterizations of certain classes of norms
• Model theory for infinitary logic. Logic with countable conjunctions and finite quantifiers
• Guarded commands, nondeterminacy and formal derivation of programs
• Programming as a Discipline of Mathematical Nature
• An axiomatic basis for computer programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Formalizing Dijkstra's predicate transformer wp in weak second-order logic