Foundations of the trace assertion method of module interface specification

IEEE Transactions on Software Engineering

Volumn 27, Issue 7, 2001, Pages 577-598

  Janicki, Ryszard ^a,b   Sekerinski, Emil ^a,b  

^a IEEE   (Canada)

^b MCMASTER UNIVERSITY   (Canada)

Author keywords

Mealy machines; Module interface specifications; Module refinement; Nondeterminism; Relational model; State machines; Step sequences; Tabular notation; Trace assertion method

Indexed keywords

TRACE ASSERTION METHODS;

AUTOMATA THEORY; COMPUTER SIMULATION; COMPUTER SOFTWARE; INTERFACES (COMPUTER);

SOFTWARE ENGINEERING;

EID: 0035394510     PISSN: 00985589     EISSN: None     Source Type: Journal    
DOI: 10.1109/32.935852     Document Type: Review

References (34)

1. Using assertions about traces to write abstract specifications for software modules
2. Data refinement refined
3. Automated consistency checking of requirements specification
4. The trace specification of communication protocols
5. Towards a formal semantics of parnas tables
6. Structure of concurrency
7. Tabular representations in relational documents
8. An introduction to input/output automata
9. Forward and backward simulations: I. Untimed systems
10. A formal foundations for the abstract specification of software
11. Stepwise refinement and verification in box-structure systems
12. On trace specifications
13. A Technique for software module specification with examples
14. Precise documentation of well-structured programs
15. Subset languages of petri nets
16. EATCS monographs in theoretical computer science
17. On the road to practical module interface specification
18. Algebraic specification