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}
}
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… 
7 Citations

Compositional Liveness-Preserving Conformance Testing of Timed I/O Automata - Technical Report

TLDR
An improved version of tioco is proposed, called live timed ioco (ltioco), tackling various weaknesses of existing definitions and extending the theory of zone graphs to enable ltioco testing on a finite semantic model of TIOA.

Service-Oriented and Cloud Computing: 8th IFIP WG 2.14 European Conference, ESOCC 2020, Heraklion, Crete, Greece, September 28–30, 2020, Proceedings

TLDR
A parametric relation is proposed for testing the conformance of the management of application components, based on an existing formalism to model multi-component application management (i.e., management protocols), and how such relation can be exploited to ensure that replacing a specification with a conforming implementation continues to enable all already allowed management activities, and/or that no additional management activity gets enabled.

Model-based Quality Assurance of Cyber-Physical Systems with Variability in Space, over Time and at Runtime

TLDR
The main focus of this thesis is laid on computation and communication aspects of CPS, utilizing evolving dynamic software product lines as engineering methodology and model-based testing as quality-assurance technique.

Efficient Computation of Invariably Safe States for Motion Planning of Self-Driving Vehicles

  • Christian PekM. Althoff
  • Computer Science
    2018 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)
  • 2018
TLDR
Always safe sets are introduced, regions that allow vehicles to remain safe for an infinite time horizon and can be used to determine the existence of feasible evasive maneuvers and the criticality of scenarios by computing the time-to-react metric.

Testing Conformance in Multi-component Enterprise Application Management

TLDR
A parametric relation is proposed for testing the conformance of the management of application components, based on an existing formalism to model multi-component application management (i.e., management protocols), and how such relation can be exploited to ensure that replacing a specification with a conforming implementation continues to enable all already allowed management activities, and/or that no additional management activity gets enabled.

Modal Interface Theories for Specifying Component-based Systems

TLDR
The proposed EMIA improves on previous interface theories by providing a more precise semantics with respect to erroneous behaviour based on error-preservation, and allows for the change of operational environment by permitting one to adapt system components to new interactions without breaking previously satisfied requirements.

References

SHOWING 1-10 OF 41 REFERENCES

Towards an I/O Conformance Testing Theory for Software Product Lines based on Modal Interface Automata

TLDR
Modal-ioco is proven correct in the sense that it coincides with traditional ioco to hold for every derivable implementation variant, and a family-based product line conformance testing framework can be established.

On Weak Modal Compatibility, Refinement, and the MIO Workbench

TLDR
The MIO Workbench is described, an Eclipse-based editor and verification tool for modal I/O automata, which implements various refinement, compatibility and composition notions and is able to depict the results of verification directly on the graphical representation of MIOs.

Formal Conformance Testing of Systems with Refused Inputs and Forbidden Actions

Testing Preorders for dMTS: Deadlock- and the New Deadlock/Divergence-Testing

TLDR
This work regards deadlocks and divergence as unwanted and characterize the testing preorder with an unusual failure-divergence semantics, which is a precongruence on dMTS and much easier to handle than the deadlock-based preorder.

Modal interfaces: unifying interface automata and modal specifications

TLDR
A unification of interface automata and modal specifications, two radically dissimilar models for interface theories, is presented by correcting the modal interface composition operator presented in the paper by Larsen et al., drawing a complete picture of theModal interface algebra, and pushing even further the comparison between interfaces automata, modal automataand modal interfaces.

Compositional Specifications for ioco Testing

TLDR
This paper proposes a new approach to composition and hiding operations, inspired by contract-based design and interface theories, and provides a methodology that uses these results to minimize integration testing effort, but also to detect potential weaknesses in specifications.

Interface automata

TLDR
This work presents a light-weight formalism that captures the temporal aspects of software component interfaces through an automata-based language that supports automatic compatability checks between interface models, and thus constitutes a type system for component interaction.

On the relationship between process algebra and input/output automata

  • F. Vaandrager
  • Computer Science
    [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science
  • 1991
TLDR
The relationship between process algebra and input/output (I/O) automata models is investigated in a general setting of structured operational semantics and syntactic constraints on inference rules that guarantee key properties of I/O automata are proposed.

Test Generation with Inputs, Outputs and Repetitive Quiescence

TLDR
This paper studies testing based on labelled transition systems, using the assumption that implementations communicate with their environment via inputs and outputs, and a test generation algorithm is given which is proved to produce a sound and exhaustive test suite from a specification.

Test Generation with Inputs, Outputs, and Quiescence

TLDR
A test generation algorithm is given, which is proved to produce a sound and exhaustive test suite from a specification, i.e., a test suite that fully characterizes the set of correct implementations.