Formal Techniques for Deriving Binary Search Algorithms

DOI10.1080/02522667.1985.10698821zbMath0593.68026OpenAlexW2016170755MaRDI QIDQ3723690

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

guarded commandspost-conditionscontrolling variableformal techniques for deriving correct algorithms

Mathematics Subject Classification ID

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

Cites Work

• Analysis of Internal Computer Sorting
• Some Lessons Drawn from the History of the Binary Search Algorithm
• Structure and Use of ALGOL 60
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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