Proof system for weakest prespecification

DOI10.1016/0020-0190(88)90218-9zbMath0647.68108OpenAlexW1990227422MaRDI QIDQ1104780

Ewa S. 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

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

Related Items (2)

Dynamic logic with program specifications and its relational proof system ⋮ An efficient relational deductive system for propositional non-classical logics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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