Programs as partial graphs. I: Flow equivalence and correctness

DOI10.1016/0304-3975(81)90060-8MaRDI QIDQ1168723zbMATH OpenOpenAlexWikidataFDO

Authors Gunther Schmidt

Publication date 1981

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(81)90060-8

zbMATH Keywords

program semanticsterminationcorrectnessprograms as partial graphs

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Cites work

• scientific article; zbMATH DE number 3551848 (Why is no real title available?)
• scientific article; zbMATH DE number 3602653 (Why is no real title available?)
• scientific article; zbMATH DE number 3621088 (Why is no real title available?)
• scientific article; zbMATH DE number 3628356 (Why is no real title available?)
• scientific article; zbMATH DE number 3436597 (Why is no real title available?)
• scientific article; zbMATH DE number 3448070 (Why is no real title available?)
• scientific article; zbMATH DE number 3204690 (Why is no real title available?)
• scientific article; zbMATH DE number 3302923 (Why is no real title available?)
• scientific article; zbMATH DE number 3322506 (Why is no real title available?)
• scientific article; zbMATH DE number 3349291 (Why is no real title available?)
• scientific article; zbMATH DE number 3351179 (Why is no real title available?)
• scientific article; zbMATH DE number 3378527 (Why is no real title available?)
• scientific article; zbMATH DE number 3412171 (Why is no real title available?)
• An axiomatic basis for computer programming
• Boolean Algebras with Operators
• Boolean Algebras with Operators. Part I
• Decidable Properties of Monadic Functional Schemas
• Formalization of Properties of Functional Programs
• Guarded commands, nondeterminacy and formal derivation of programs
• On formalised computer programs
• On homomorphisms, correctness, termination, unfoldments, and equivalence of flow diagram programs
• On matrix program schemes
• On the algebraic structure of rooted trees
• On the completeness of the inductive assertion method
• Programs as partial graphs. II: Recursion
• Properties of Programs and the First-Order Predicate Calculus
• Proving Properties of Programs by Structural Induction
• Relations binaires, fermetures, correspondances de Galois
• Some Properties of Predicate Transformers
• The representation of relation algebras. II
• The representation of relational algebras

Cited in

(17)

• Nondeterministic semantics of compound diagrams
• Gunther Schmidt's life as a mathematician and computer scientist
• Embedding a demonic semilattice in a relation algebra
• Partiality. I: Embedding relation algebras
• Relational algebraic semantics of deterministic and nondeterministic programs
• Relation algebras: Concept of points and representability
• Programs as partial graphs. II: Recursion
• Relation-algebraic semantics
• Cryptomorphic topological structures: a computational, relation-algebraic approach
• Relational computation of sets of relations
• Cardinality of relations with applications
• Partiality. II: Constructed relation algebras
• Relation algebraic domain constructions
• A relational division operator: The conjugate kernel
• Bjarni Jónsson's contributions in algebra
• Parallel constructions of maximal path sets and applications to short superstrings
• Discrete ordering relations

This page was built for publication: Programs as partial graphs. I: Flow equivalence and correctness

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