Is ``Some-other-time sometimes better than ``Sometime for proving partial correctness of programs?

DOI10.1007/BF00370557zbMath0684.68031MaRDI QIDQ1825630

Ildikó Sain

Publication date: 1989

Published in: Studia Logica (Search for Journal in Brave)

zbMATH Keywords

modal logicsprogram verificationIntermittent Assertions Methodnonstandard logics of programs

Mathematics Subject Classification ID

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

Related Items (5)

Derivation rules as anti-axioms in modal logic ⋮ Taming logic ⋮ A logical study of group-size based social network creation ⋮ The Modelwise Interpolation Property of Semantic Logics ⋮ Peano arithmetic as axiomatization of the time frame in logics of programs and in dynamic logics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A simple proof for the completeness of Floyd's method
• Definability with bounded number of bound variables
• Cylindric algebras. Part II
• Expressive completeness failure in branching time structures
• The temporal semantics of concurrent programs
• Axiomatising the logic of computer programming
• A complete logic for reasoning about programs via nonstandard model theory. I
• Programs and program verifications in a general setting
• Recursive programs and denotational semantics in absolute logics of programs
• STRUCTURED NONSTANDARD DYNAMIC LOGIC
• Completeness in the theory of types

This page was built for publication: Is ``Some-other-time sometimes better than ``Sometime for proving partial correctness of programs?