The satisfiability of logical formula in proof of program

MaRDI QIDQ2764255zbMATH OpenFDO

Authors Cai-fen Wang

Publication date 15 December 2002

Published in Journal of Northwest Normal University. Natural Science (Search for Journal in Brave)

zbMATH Keywords

Hoare axiom system

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• Determination of the class of validity of logical formulas by directed exhaustive search
• Checking the satisfiability of formulas represented in disjunctive normal form in the language \(L\). I
• scientific article; zbMATH DE number 4039849
• scientific article; zbMATH DE number 3848602
• scientific article; zbMATH DE number 1737608

Cited in

(4)

• scientific article; zbMATH DE number 4039849 (Why is no real title available?)
• scientific article; zbMATH DE number 1099516 (Why is no real title available?)
• scientific article; zbMATH DE number 7552282 (Why is no real title available?)
• Formal proof of a program: find

This page was built for publication: The satisfiability of logical formula in proof of program

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