Compositionality, Decompositionality and Refinement in Input/Output Conformance Testing

@inproceedings{Luthmann2016CompositionalityDA,
  title={Compositionality, Decompositionality and Refinement in Input/Output Conformance Testing},
  author={Lars Luthmann and Stephan Mennicke and Malte Lochau},
  booktitle={FACS},
  year={2016}
}
  • Lars Luthmann, Stephan Mennicke, Malte Lochau
  • Published in FACS 2016
  • Mathematics, Computer Science
  • We propose an input/output conformance testing theory utilizing Modal Interface Automata with Input Refusals (IR-MIA) as novel behavioral formalism for both the specification and the implementation under test. A modal refinement relation on IR-MIA allows distinguishing between obligatory and allowed output behaviors, as well as between implicitly underspecified and explicitly forbidden input behaviors. The theory therefore supports positive and negative conformance testing with optimistic and… CONTINUE READING
    7 Citations

    References

    SHOWING 1-10 OF 49 REFERENCES
    Richer interface automata with optimistic and pessimistic compatibility
    • 14
    Formal Conformance Testing of Systems with Refused Inputs and Forbidden Actions
    • 18
    • PDF
    Testing Preorders for dMTS: Deadlock- and the New Deadlock/Divergence-Testing
    • 6
    Modal interfaces: unifying interface automata and modal specifications
    • 76
    • PDF
    Compositional Specifications for ioco Testing
    • 22
    • PDF
    Interface automata
    • 1,347
    • PDF
    On the relationship between process algebra and input/output automata
    • F. Vaandrager
    • Mathematics, Computer Science
    • [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science
    • 1991
    • 121
    Test Generation with Inputs, Outputs and Repetitive Quiescence
    • 581
    • PDF