Proof system for weakest prespecification

DOI10.1016/0020-0190(88)90218-9zbMATH Open0647.68108OpenAlexW1990227422MaRDI QIDQ1104780FDOQ1104780

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (5)

• Title not available (Why is that?)
• Dynamic logic with program specifications and its relational proof system
• Some Variants of the Weakest Precondition in Nondeterminism
• The weakest specifunction
• An efficient relational deductive system for propositional non-classical logics

   Recommendations

• Title not available (Why is that?) 👍 👎
• The weakest prespecification 👍 👎
• Title not available (Why is that?) 👍 👎
• Dynamic logic with program specifications and its relational proof system 👍 👎
• Algebraic proofs of consistency and completeness 👍 👎

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)