Is ``Some-other-time'' sometimes better than ``Sometime'' for proving partial correctness of programs?
type: Item
instance of: scholarly article
title: Is ``Some-other-time'' sometimes better than ``Sometime'' for proving partial correctness of programs?
zbMATH Open document ID: 0684.68031
DOI: 10.1007/BF00370557
author: Ildikó Sain
published in: Studia Logica
publication date: 1989-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 03B70
zbMATH DE Number: 4121408
zbMATH Keywords: program verification
zbMATH Keywords: nonstandard logics of programs
zbMATH Keywords: Intermittent Assertions Method
zbMATH Keywords: modal logics
MaRDI profile type: Publication
cites work: Expressive completeness failure in branching time structures
cites work: A complete logic for reasoning about programs via nonstandard model theory. I
cites work: Q4054648
cites work: Q3911362
cites work: Programs and program verifications in a general setting
cites work: Axiomatising the logic of computer programming
cites work: Q3696488
cites work: Completeness in the theory of types
cites work: Cylindric algebras. Part II
cites work: Definability with bounded number of bound variables
cites work: Q4190096
cites work: Recursive programs and denotational semantics in absolute logics of programs
cites work: The temporal semantics of concurrent programs
cites work: STRUCTURED NONSTANDARD DYNAMIC LOGIC
cites work: A simple proof for the completeness of Floyd's method
Recommended article: On the strength of “sometimes” and “always” in program verification
Recommended article: Sometime = always + recursion \(\equiv\) always. On the equivalence of the intermittent and invariant assertions methods for proving inevitability properties of programs
Recommended article: “Sometimes” and “not never” revisited
Recommended article: Does “N+1 times” prove more programs correct than “N times”?
Recommended article: Computer Science Logic
Recommended article: From Model Checking to a Temporal Proof for Partial Models
Recommended article: Towards a Theory of Time-Bounded Verification
Recommended article: Q5455088
Recommended article: Q4031327
Recommended article: Q4934533
description: scientific article; zbMATH DE number 4121408