Specifying module interfaces with finitely defined automata

Authors:
Ryszard Janicki
Affiliations:
McMaster University, Department of Computing and Software, Hamilton, Ontario, Canada
Venue:
ICCOMP'07 Proceedings of the 11th WSEAS International Conference on Computers
Year:
2007

Citing 8
Cited 0

Evolving algebras 1993: Lipari guide

Specification and validation methods
Automated consistency checking of requirements specifications

ACM Transactions on Software Engineering and Methodology (TOSEM)
Software fundamentals: collected papers by David L. Parnas

Software fundamentals: collected papers by David L. Parnas
Foundations of the Trace Assertion Method of Module Interface Specification

IEEE Transactions on Software Engineering
Automata, Languages, and Machines

Automata, Languages, and Machines
On Trace Assertion Method of Module Interface Specification with Concurrency

RSCTC '00 Revised Papers from the Second International Conference on Rough Sets and Current Trends in Computing
Foundations of Sequence-Based Software Specification

IEEE Transactions on Software Engineering
Tabular Expressions and Their Relational Semantics

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

The use of automata as a specification tool is analyzed. Trace Assertion Method (TAM) is used as an example. TAM is a formal method for specifying module interfaces. It treats the module as a black box, and was designed as an alternative to an algebraic specification technique [1], and became quite popular in the software industry [13]. Finiteness and concurrency issues are discussed.