DocumentCode :
1558496
Title :
Specification of iterators
Author :
Lamb, David Alex
Author_Institution :
Dept. of Comput. & Inf. Sci., Queen´´s Univ., Kingston, Ont., Canada
Volume :
16
Issue :
12
fYear :
1990
fDate :
12/1/1990 12:00:00 AM
Firstpage :
1352
Lastpage :
1360
Abstract :
Iterators are defined, and previously published methods for defining their meanings are outlined. It is shown how to use trace specifications to define a common form of iterator module (Alphard-style iterators). A form of specification for an iterator is shown which can capture the key differences between a set and a sequence at a few particular places in the specification. The trace specification of a sequence iterator is compared to an algebraic specification. It is concluded that the algebraic specification is possible but somewhat clumsier. Traces are used to give partial specifications of iterator construct that make sequences of calls on procedural parameters
Keywords :
data structures; formal specification; high level languages; Alphard-style iterators; algebraic specification; common form; iterator construct; iterator module; partial specifications; procedural parameters; sequence iterator; trace specifications; Binary trees; Councils; Formal specifications; Guidelines; Information science; Observability; Programming profession; Software engineering; Tree data structures; Writing;
fLanguage :
English
Journal_Title :
Software Engineering, IEEE Transactions on
Publisher :
ieee
ISSN :
0098-5589
Type :
jour
DOI :
10.1109/32.62444
Filename :
62444
Link To Document :
بازگشت