Adapting Calculational Logic to the Undefined

DOI10.1093/COMJNL/42.2.73MaRDI QIDQ4269811zbMATH OpenOpenAlexFDO

Authors Birgit Schieder, Manfred Broy

Publication date 4 May 2000

Published in The Computer Journal (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/8e7f401f8e02e0b4eb91321d40d12aeb45382bce

zbMATH Keywords

Dijkstra/Scholten calculational logicfixed-point rulepartial functionsprogramming logic

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• A first order logic for partial functions (extended abstract)
• Partial logics reconsidered: A conservative approach
• The connection between two ways of reasoning about partial functions
• scientific article; zbMATH DE number 1088212

Cited in

(8)

• Reasoning about partial functions in the formal development of programs
• A two-valued logic for properties of strict functional programs allowing partial functions
• Efficient Well-Definedness Checking
• scientific article; zbMATH DE number 1088212 (Why is no real title available?)
• Automated Reasoning
• A completeness proof for a regular predicate logic with undefined truth value
• Reasoning about incompletely defined programs
• A logic covering undefinedness in program proofs

This page was built for publication: Adapting Calculational Logic to the Undefined

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