Nondeterministic flowchart programs with recursive procedures: Semantics and correctness. I
type: Item
instance of: scholarly article
title: Nondeterministic flowchart programs with recursive procedures: Semantics and correctness. I
zbMATH Open document ID: 0441.68011
DOI: 10.1016/0304-3975(81)90039-6
author: Jean Gallier
published in: Theoretical Computer Science
publication date: 1981-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q60
zbMATH DE Number: 3688679
zbMATH Keywords: nondeterministic flowchart programs
zbMATH Keywords: semantics
zbMATH Keywords: correctness
zbMATH Keywords: recursive procedures
MaRDI profile type: Publication
full work available at URL: 0304-3975(81)90039-6
OpenAlex ID: W4213187981
cites work: Q3698292
cites work: Q5679697
cites work: Q4138103
cites work: On Classes of Program Schemata
cites work: Q4125720
cites work: On the completeness of the inductive assertion method
cites work: Nondeterministic Algorithms
cites work: Q4160373
cites work: On homomorphisms, correctness, termination, unfoldments, and equivalence of flow diagram programs
cites work: Q4125728
cites work: Initial Algebra Semantics and Continuous Algebras
cites work: Theory of program structures: Schemes, semantics, verification
cites work: Q4159365
cites work: Q4693151
cites work: The correctness of nondeterministic programs
cites work: Mathematical theory of partial correctness
cites work: Q4124327
cites work: Q4116078
cites work: Q3947101
cites work: Q3853124
cites work: Q5636307
description: scientific article; zbMATH DE number 3688679