scientific article; zbMATH DE number 3936484

MaRDI QIDQ3707370zbMATH OpenFDO

Authors Bogdan Oporowski

Publication date 1985

zbMATH Keywords

correctness of nondeterministic programsverification

Mathematics Subject Classification ID

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

Recommendations

• Strong Semantical Characterization for Nondeterministic Programs
• Correctness of recursive parallel nondeterministic flow programs
• scientific article; zbMATH DE number 53100
• Two most nondeterministic programs
• Logical analysis of demonic nondeterministic programs

Cited in

(15)

• Two most nondeterministic programs
• On verifying that a concurrent program satisfies a nondeterministic specification
• Proving correctness with respect to nondeterministic safety specifications
• On the complexity of the correctness problem for non-zeroness test instruction sequences
• A unified approach of program verification
• Semantical proofs of correctness for programs performing non-deterministic tests on real numbers
• scientific article; zbMATH DE number 3876560 (Why is no real title available?)
• scientific article; zbMATH DE number 3905832 (Why is no real title available?)
• scientific article; zbMATH DE number 3958707 (Why is no real title available?)
• Strong Semantical Characterization for Nondeterministic Programs
• Dijkstra's interpretation of the approach to solving a problem of program correctness
• Program correctness and matricial iteration theories
• Correctness of recursive parallel nondeterministic flow programs
• Correctness of programs with Pascal-like procedures without global variables
• Generation of correctness conditions for imperative programs

This page was built for publication:

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