On the completeness of modular proof systems

DOI10.1016/0020-0190(90)90073-7zbMath0704.68080OpenAlexW2091774687MaRDI QIDQ917327

Elsie Sterbin Gottlieb

Publication date: 1990

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(90)90073-7

zbMATH Keywords

program correctness

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (1)

On mechanizing proofs within a complete proof system for Unity

Cites Work

• Unnamed Item
• Unnamed Item
• Compositionality, Concurrency and Partial Correctness. Proof Theories for Networks of Processes, and their Relationship
• On the notion of expressiveness and the rule of adaptation
• Ten Years of Hoare's Logic: A Survey—Part I
• A New Incompleteness Result for Hoare's System
• Soundness and Completeness of an Axiom System for Program Verification
• An axiomatic basis for computer programming

This page was built for publication: On the completeness of modular proof systems