Formal Techniques for Deriving Binary Search Algorithms

DOI10.1080/02522667.1985.10698821MaRDI QIDQ3723690zbMATH OpenOpenAlexFDO

Authors M. C. Er

Publication date 1985

Published in Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02522667.1985.10698821

zbMATH Keywords

controlling variableformal techniques for deriving correct algorithmsguarded commandspost-conditions

Mathematics Subject Classification ID

Searching and sorting (68P10) Specification and verification (program logics, model checking, etc.) (68Q60) Algorithms in computer science (68W99)

Recommendations

• Publication:4828947
• Formal derivation of a pattern matching algorithm
• scientific article; zbMATH DE number 1354109
• The derivation and formal proof of binary tree sorting non-recursive algorithm
• Proof search algorithm in pure logical framework
• scientific article; zbMATH DE number 3936509
• Search algorithms in type theory
• scientific article; zbMATH DE number 6698765
• A formal method for developing algebraic and numerical algorithms

Cites work

• Analysis of Internal Computer Sorting
• scientific article; zbMATH DE number 3740740 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 3543601 (Why is no real title available?)
• scientific article; zbMATH DE number 3574936 (Why is no real title available?)
• scientific article; zbMATH DE number 3584897 (Why is no real title available?)
• scientific article; zbMATH DE number 3610691 (Why is no real title available?)
• scientific article; zbMATH DE number 3403720 (Why is no real title available?)
• Some Lessons Drawn from the History of the Binary Search Algorithm
• Structure and Use of ALGOL 60

Cited in

(3)

• The origin of a binary-search paradigm
• A New Programming Technique Derived from Dijkstra’s Methodology
• The derivation and formal proof of binary tree sorting non-recursive algorithm

This page was built for publication: Formal Techniques for Deriving Binary Search Algorithms

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