Formalizing Dijkstra's predicate transformer wp in weak second-order logic
From MaRDI portal
Publication:673132
DOI10.1016/0304-3975(94)00184-KzbMATH Open0873.68033MaRDI QIDQ673132FDOQ673132
Authors: Rudolf Berghammer, Birgit Elbl, Ulf R. Schmerl 
Publication date: 28 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Recommendations
- Towards a calculus of predicate transformers
- A syntactic embedding of predicate logic into second-order propositional logic
- scientific article; zbMATH DE number 404251
- Predicate transformers and higher-order programs
- Computer Science Logic
- An algebraic construction of predicate transformers
- scientific article; zbMATH DE number 512951
- Combining logic programs and monadic second order logics by program transformation
- A general proof rule for procedures in predicate transformer semantics
- scientific article; zbMATH DE number 1973217
Cites Work
- Title not available (Why is that?)
- An axiomatic basis for computer programming
- Title not available (Why is that?)
- Guarded commands, nondeterminacy and formal derivation of programs
- Programming as a Discipline of Mathematical Nature
- Model theory for infinitary logic. Logic with countable conjunctions and finite quantifiers
- Title not available (Why is that?)
- Proving total correctness of nondeterministic programs in infinitary logic
- Characterizations of certain classes of norms
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (3)
This page was built for publication: Formalizing Dijkstra's predicate transformer wp in weak second-order logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q673132)
