An elementary and unified approach to program correctness

DOI10.1007/S00165-009-0137-4zbMATH Open1211.68079OpenAlexW2017923582MaRDI QIDQ607408FDOQ607408

Authors: Jaime A. Bohórquez V. 

Publication date: 22 November 2010

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00165-009-0137-4

Recommendations

• Dijkstra-Scholten predicate calculus: Concepts and misconceptions
• Partial correctness: The term-wise approach
• Laws of programming
• A theoretical basis for stepwise refinement and the programming calculus
• Dijkstra's interpretation of the approach to solving a problem of program correctness

zbMATH Keywords

recursionprogram verificationprogram correctnessprogramming methodologyDijkstra-Hehner language

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• An axiomatic basis for computer programming
• Program development by stepwise refinement
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A presentation of the Fibonacci algorithm
• Exercises in Quantifier Manipulation
• Guarded commands, nondeterminacy and formal derivation of programs
• Retrospective and Prospective for Unifying Theories of Programming
• Title not available (Why is that?)
• The weakest prespecification
• The derivation of systolic computations
• Predicative programming Part I
• On the shape of mathematical arguments
• Title not available (Why is that?)
• Intuitionistic logic according to Dijkstra's calculus of equational deduction
• The associativity of equivalence and the Towers of Hanoi problem
• Programs are predicates
• Title not available (Why is that?)
• An Inductive Theorem on the Correctness of General Recursive Programs
• On calculational proofs
• A practical theory of programming

Cited In (8)

• Dijkstra's interpretation of the approach to solving a problem of program correctness
• Correctness of programs with Pascal-like procedures without global variables
• The Formal System of Dijkstra and Scholten
• Loop verification with invariants and contracts
• General correctness: A unification of partial and total correctness
• Title not available (Why is that?)
• Unifying Recursion in Partial, Total and General Correctness
• Program correctness and matricial iteration theories

Uses Software

• CalcCheck

This page was built for publication: An elementary and unified approach to program correctness

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