Algebraic proofs of consistency and completeness

DOI10.1016/0304-3975(94)00211-ZzbMath0874.68195MaRDI QIDQ672320

Paul H. B. Gardiner

Publication date: 28 February 1997

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

zbMATH Keywords

Horare logic

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (4)

Power simulation and its relation to traces and failures refinement ⋮ A mathematical characterization of quantum Gaussian stochastic evolution schemes ⋮ Algebraic proofs of consistency and completeness ⋮ Calculating sharp adaptation rules.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algebraic proofs of consistency and completeness
• A single complete rule for data refinement
• Data refinement by calculation
• Auxiliary variables in data refinement
• Data refinement of predicate transformers
• Proof of correctness of data representations
• Programming as a Discipline of Mathematical Nature
• An axiomatic basis for computer programming

This page was built for publication: Algebraic proofs of consistency and completeness