Formal correctness proofs of a nondeterministic program

DOI10.1016/0020-0190(82)90092-8MaRDI QIDQ594577zbMATH OpenOpenAlexFDO

Authors Eliezer Upfal

Publication date 1982

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(82)90092-8

zbMATH Keywords

nondeterminismbacktrackingdynamic logicpartial correctnesstotal correctness

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3594629 (Why is no real title available?)
• scientific article; zbMATH DE number 3302923 (Why is no real title available?)
• An axiomatic basis for computer programming
• Guarded commands, nondeterminacy and formal derivation of programs
• Nondeterministic Algorithms

This page was built for publication: Formal correctness proofs of a nondeterministic program

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