@article{JanickiSekerinski01TraceAssertion,
	title = {Foundations of the {Trace} {Assertion} {Method} of {Module} {Interface} {Specification}},
	volume = {27},
	issn = {0098-5589},
	doi = {10.1109/32.935852},
	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.},
	number = {7},
	journal = {IEEE Transactions on Software Engineering},
	author = {Janicki, Ryszard and Sekerinski, Emil},
	month = jul,
	year = {2001},
	keywords = {Mealy machines, Module interface specifications, module refinement, nondeterminism, relational model, state machines, step-sequences, tabular notation., trace assertion method},
	pages = {577--598},
}

{"_id":"neSTJQpNTZj5MfZvy","bibbaseid":"janicki-sekerinski-foundationsofthetraceassertionmethodofmoduleinterfacespecification-2001","downloads":1,"creationDate":"2019-02-02T15:48:53.597Z","title":"Foundations of the Trace Assertion Method of Module Interface Specification","author_short":["Janicki, R.","Sekerinski, E."],"year":2001,"bibtype":"article","biburl":"https://api.krunk.cn/emil/bib.php","bibdata":{"bibtype":"article","type":"article","title":"Foundations of the Trace Assertion Method of Module Interface Specification","volume":"27","issn":"0098-5589","doi":"10.1109/32.935852","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.","number":"7","journal":"IEEE Transactions on Software Engineering","author":[{"propositions":[],"lastnames":["Janicki"],"firstnames":["Ryszard"],"suffixes":[]},{"propositions":[],"lastnames":["Sekerinski"],"firstnames":["Emil"],"suffixes":[]}],"month":"July","year":"2001","keywords":"Mealy machines, Module interface specifications, module refinement, nondeterminism, relational model, state machines, step-sequences, tabular notation., trace assertion method","pages":"577–598","bibtex":"@article{JanickiSekerinski01TraceAssertion,\n\ttitle = {Foundations of the {Trace} {Assertion} {Method} of {Module} {Interface} {Specification}},\n\tvolume = {27},\n\tissn = {0098-5589},\n\tdoi = {10.1109/32.935852},\n\tabstract = {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.},\n\tnumber = {7},\n\tjournal = {IEEE Transactions on Software Engineering},\n\tauthor = {Janicki, Ryszard and Sekerinski, Emil},\n\tmonth = jul,\n\tyear = {2001},\n\tkeywords = {Mealy machines, Module interface specifications, module refinement, nondeterminism, relational model, state machines, step-sequences, tabular notation., trace assertion method},\n\tpages = {577--598},\n}\n\n","author_short":["Janicki, R.","Sekerinski, E."],"key":"JanickiSekerinski01TraceAssertion","id":"JanickiSekerinski01TraceAssertion","bibbaseid":"janicki-sekerinski-foundationsofthetraceassertionmethodofmoduleinterfacespecification-2001","role":"author","urls":{},"keyword":["Mealy machines","Module interface specifications","module refinement","nondeterminism","relational model","state machines","step-sequences","tabular notation.","trace assertion method"],"metadata":{"authorlinks":{}},"downloads":1},"search_terms":["foundations","trace","assertion","method","module","interface","specification","janicki","sekerinski"],"keywords":["mealy machines","module interface specifications","module refinement","nondeterminism","relational model","state machines","step-sequences","tabular notation.","trace assertion method"],"authorIDs":[],"dataSources":["fDYYrPxpzcyDvQK6b","HEdahWqKBpmSGmDwq","MF5eGzpJnqf6bSAoG","ienufKdnmJs49AsjR","So4gmSWFmbQRNEuFs","ezsmw4w22u9JFLNYJ","CvQYP6Tmpapx74Mgr","RWydLHbBJqgdeh5jr"]}