A simple proof for the completeness of Floyd's method
type: Item
instance of: scholarly article
title: A simple proof for the completeness of Floyd's method
zbMATH Open document ID: 0552.68003
DOI: 10.1016/0304-3975(85)90024-6
published in: Theoretical Computer Science
publication date: 1985-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 03B10
zbMATH DE Number: 3880071
zbMATH Keywords: completeness of Floyd's method
zbMATH Keywords: semantics for programs
zbMATH Keywords: program verification methods
zbMATH Keywords: first order logic
author: Ildikó Sain
MaRDI profile type: Publication
full work available at URL: 0304-3975(85)90024-6
OpenAlex ID: W2007789697
cites work: Q3309036
cites work: Q4193440
cites work: A complete logic for reasoning about programs via nonstandard model theory. II
cites work: Programs and program verifications in a general setting
cites work: Q3956390
cites work: Q3744163
cites work: Q3698302
description: scientific article; zbMATH DE number 3880071