Strong Semantical Characterization for Nondeterministic Programs

DOI10.1002/MALQ.19870330504MaRDI QIDQ3814773zbMATH OpenOpenAlexFDO

Authors László Csirmaz

Publication date 1987

Published in Zeitschrift für Mathematische Logik und Grundlagen der Mathematik (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/malq.19870330504

zbMATH Keywords

data structuresFloyd-Hoare logicnondeterministic programsprogram verification

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• An elementary proof for some semantic characterizations of nondeterministic Floyd-Hoare logic
• scientific article; zbMATH DE number 3936484
• scientific article; zbMATH DE number 3905832
• Non-standard algorithmic and dynamic logic
• Verification of procedural programs

Cited in

(5)

• Weak second order characterizations of various program verification systems
• Stability of weak second-order semantics
• scientific article; zbMATH DE number 3905832 (Why is no real title available?)
• scientific article; zbMATH DE number 3936484 (Why is no real title available?)
• An elementary proof for some semantic characterizations of nondeterministic Floyd-Hoare logic

This page was built for publication: Strong Semantical Characterization for Nondeterministic Programs

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