A Formal Method for the Abstract Specification of Software
Journal of the ACM (JACM)
Handbook of theoretical computer science (vol. B)
Relations and graphs: discrete mathematics for computer scientists
Relations and graphs: discrete mathematics for computer scientists
Theoretical Computer Science
Finite transition systems: semantics of communicating systems
Finite transition systems: semantics of communicating systems
Precise Documentation of Well-Structured Programs
IEEE Transactions on Software Engineering
Forward and backward simulations I.: untimed systems
Information and Computation
Towards a formal semantics of Parnas tables
Proceedings of the 17th international conference on Software engineering
Automated consistency checking of requirements specifications
ACM Transactions on Software Engineering and Methodology (TOSEM)
The B-book: assigning programs to meanings
The B-book: assigning programs to meanings
Tabular representations in relational documents
Relational methods in computer science
A technique for software module specification with examples
Communications of the ACM
Automata, Languages, and Machines
Automata, Languages, and Machines
The Book of Traces
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Fundamentals of Algebraic Specification I
Fundamentals of Algebraic Specification I
ESOP '86 Proceedings of the European Symposium on Programming
Using assertions about traces to write abstract specifications for software modules
Proceedings of the 2nd Conference of the European Cooperation on Informatics: Information Systems Methodology
Specifying and simulating the externally observable behavior of modules
Specifying and simulating the externally observable behavior of modules
Sequence-based software specification
Sequence-based software specification
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
Representation of a class of nondeterministic semiautomata by canonical words
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Specifying module interfaces with finitely defined automata
ICCOMP'07 Proceedings of the 11th WSEAS International Conference on Computers
Enforcing behavioral constraints in evolving aspect-oriented programs
Proceedings of the 7th workshop on Foundations of aspect-oriented languages
Programming and Computing Software
The impact of requirements changes on specifications and state machines
Software—Practice & Experience
An axiom system for sequence-based specification
Theoretical Computer Science
Computing refactorings of behavior models
MoDELS'05 Proceedings of the 8th international conference on Model Driven Engineering Languages and Systems
Applying string-rewriting to sequence-based specification
Formal Methods in System Design
| Hi-index | 0.00 |
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 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.