DocumentCode
1513189
Title
Foundations of the trace assertion method of module interface specification
Author
Janicki, Ryszard ; Sekerinski, Emil
Author_Institution
McMaster Univ., Hamilton, Ont., Canada
Volume
27
Issue
7
fYear
2001
fDate
7/1/2001 12:00:00 AM
Firstpage
577
Lastpage
598
Abstract
The trace assertion method is a formal state machine based method for specifying module interfaces. A module interface specification treats the module as a black-box, identifying all the module´s access programs (i.e., programs that can be invoked from outside of the module) and describing their externally visible effects. In the method, both the module states and the behaviors observed are fully described by traces built from access program invocations and their visible effects. A formal model for the trace assertion method is proposed. The concept of step-traces is introduced and applied. The stepwise refinement of trace assertion specifications is considered. The role of nondeterminism, normal and exceptional behavior, value functions, and multiobject modules are discussed. The relationship with algebraic specifications is analyzed. A tabular notation for writing trace specifications to ensure readability is adapted
Keywords
automata theory; formal specification; access program invocations; access programs; algebraic specifications; black-box; exceptional behavior; externally visible effects; formal state machine based method; module behavior; module interface specification; module states; multiobject modules; nondeterminism; normal behavior; readability; step traces; stepwise refinement; tabular notation; trace assertion method; trace assertion specifications; trace specification writing; value functions; Algebra; Commutation; Computer Society; Equations; History; Tail; Writing;
fLanguage
English
Journal_Title
Software Engineering, IEEE Transactions on
Publisher
ieee
ISSN
0098-5589
Type
jour
DOI
10.1109/32.935852
Filename
935852
Link To Document