DocumentCode
2416256
Title
Formal Derivation of Two Algorithms Involving Sequences
Author
Shi, Haihe ; Xue, Jinyun
fYear
2011
fDate
16-18 May 2011
Firstpage
287
Lastpage
291
Abstract
Using formal method PAR, two algorithms involving sequences, a majority problem deterministic algorithmic solution and computing the mode, are derived. From formal functional specifications, problems are partitioned into sub-problems, problem solving recurrences are constructed through formal specification transformation, and then loop invariants are achieved naturally, the algorithms that can be further transformed into executable programs supported by PAR platform are obtained. Formal derivation using PAR makes the algorithm idea is exhibited naturally and clearly.
Keywords
Algorithm design and analysis; Formal specifications; Heuristic algorithms; Nickel; Partitioning algorithms; Problem-solving; Transforms; Formal derivation; PAR method; majority algorithm; mode algorithm;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer and Information Science (ICIS), 2011 IEEE/ACIS 10th International Conference on
Conference_Location
Sanya, China
Print_ISBN
978-1-4577-0141-2
Type
conf
DOI
10.1109/ICIS.2011.52
Filename
6086484
Link To Document