Proof system for weakest prespecification

DOI10.1016/0020-0190(88)90218-9MaRDI QIDQ1104780zbMATH OpenOpenAlexFDO

Authors Ewa Orłowska

Publication date 1988

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

Full work available at URL https://doi.org/10.1016/0020-0190(88)90218-9

zbMATH Keywords

weakest prespecificationcalculus of binary relationsEntailmentlogic of databasesrelational representation of specificationsweakest postspecification

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Data structures (68P05) Modal logic (including the logic of norms) (03B45) Abstract data types; algebraic specification (68Q65)

Recommendations

• scientific article; zbMATH DE number 4068837
• The weakest prespecification
• scientific article; zbMATH DE number 3974258
• Dynamic logic with program specifications and its relational proof system
• Algebraic proofs of consistency and completeness

Cited in

(7)

• scientific article; zbMATH DE number 3974258 (Why is no real title available?)
• Dynamic logic with program specifications and its relational proof system
• The weakest prespecification
• scientific article; zbMATH DE number 4068837 (Why is no real title available?)
• Some Variants of the Weakest Precondition in Nondeterminism
• The weakest specifunction
• An efficient relational deductive system for propositional non-classical logics

This page was built for publication: Proof system for weakest prespecification

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