Testing the IPC Protocol for a Real-Time Operating System

Brucker, Achim D.; Havle, Oto; Nemouchi, Yakoub; Wolff, Burkhart

doi:10.1007/978-3-319-29613-5_3

Cited by 2 publications

(6 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…3. In case of under-specification-non-determinism, substantial case-studies of substantial complexities show the feasibility of our approach [4]. 4. the monadic theory models explicitly the difference between input and output, between data under control of the tester and results under control of the SUT, 5. the theory lends itself for a theoretical and practical framework of numerous conformance notions, even non-standard ones, and which gives 6. ways to new calculi for efficient symbolic evaluation enabling symbolic states (via invariants) and input events (via constraints) as well as a seamless, theoretically founded transition from system models to test-drivers.…”

Section: Discussionmentioning

confidence: 94%

“…In the former "truly non-deterministic" case step can and will at run-time choose different results, the latter "under-specified deterministic" version will decide in a given model always the same way: a choice that is, however, unknown at specification level and only declaratively described via post. For many systems (like system scheduler [4], processor models [3], etc.) it was possible to opt for an under-specified deterministic stepping function.…”

Section: Formal Presentations Of Automata: the Monadic Approachmentioning

confidence: 99%

“…However, this can be easily remedied by a slightly more powerful pattern. 4 The Connection to "traditional" IO Conformance. Another application of our formalisation is the possibility to actually put standard notions based on automata-theoretic notion into relation with our MST Framework.…”

Section: A Formal Theory On Conformance Relationsmentioning

confidence: 99%

“…Motivated by several projects aiming at the synthesis of test-algorithms for behavioural models with very large and usually infinite state-spaces, we developed a Monadic Sequence Testing Framework (MST). It is formalised in Isabelle/HOL and has been used in several major case-studies [2,4,5]. While the framework is tuned for mechanised deduction, in particular symbolic execution based on derived rules, it provides a number of theoretic properties which are interesting in its own.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Monadic Sequence Testing and Explicit Test-Refinements

Brucker

Wolff²

2016

Tests and Proofs

Self Cite

View full text Add to dashboard Cite

We present an abstract framework for sequence testing that is implemented in Isabelle/HOL-TestGen. Our framework is based on the theory of state-exception monads, explicitly modelled in HOL, and can cope with typed input and output, interleaving executions including abort, and synchronisation. The framework is particularly geared towards symbolic execution and has proven effective in several large case-studies involving system models based on large (or infinite) state. On this basis, we rephrase the concept of test-refinements for inclusion, deadlock and IOCO-like tests, together with a formal theory of its relation to traditional, IO-automata based notions.

show abstract

Section: Discussionmentioning

confidence: 94%

Section: Formal Presentations Of Automata: the Monadic Approachmentioning

confidence: 99%

Section: A Formal Theory On Conformance Relationsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Monadic Sequence Testing and Explicit Test-Refinements

Brucker

Wolff²

2016

Tests and Proofs

Self Cite

View full text Add to dashboard Cite

show abstract

“…In general, similar functionalities are provided among these different options. Modelling and/or testing timed systems using (interactive) theorem provers is addressed, for example, in [27,28,29,30], considering timed connectors, real-time operating systems, programmable logic controllers, and Java code, respectively. Differently, our work focus on models of system-level requirements.…”

Section: Discussionmentioning

confidence: 99%

Modelling timed reactive systems from natural-language requirements

2016

View full text Add to dashboard Cite

Abstract. At the very beginning of system development, typically only natural-language requirements are documented. As an informal source of information, however, natural-language specifications may be ambiguous and incomplete; this can be hard to detect by means of manual inspection. In this work, we present a formal model, named Data-Flow Reactive System (DFRS), which can be automatically obtained from natural-language requirements that describe functional, reactive and temporal properties. A DFRS can also be used to assess whether the requirements are consistent and complete. We define two variations of DFRS: a symbolic and an expanded version. A symbolic DFRS (s-DFRS) is a concise representation that inherently avoids an explicit representation of (possibly infinite) sets of states and, thus, the state spaceexplosion problem. We use s-DFRS as part of a technique for test-case generation from natural-language requirements. In our approach, an expanded DFRS (e-DFRS) is built dynamically from a symbolic one, possibly limited to some bound; in this way, bounded analysis (e.g., reachability, determinism, completeness) can be performed. We adopt the s-DFRS as an intermediary representation from which models, for instance, SCR and CSP, are obtained for the purpose of test generation. An e-DFRS can also be viewed as the semantics of the s-DFRS from which it is generated. In order to connect such a semantic representation to established ones in the literature, we show that an e-DFRS can be encoded as a TIOTS: an alternative timed model based on the widely used IOLTS and ioco. To validate our overall approach, we consider two toy examples and two examples from the aerospace and automotive industry. Test cases are independently created and we verify that they are all compatible with the corresponding e-DFRS models generated from symbolic ones. This verification is performed mechanically with the aid of the NAT2TEST tool, which supports the manipulation of such models.

show abstract

Testing the IPC Protocol for a Real-Time Operating System

Cited by 2 publications

References 12 publications

Monadic Sequence Testing and Explicit Test-Refinements

Monadic Sequence Testing and Explicit Test-Refinements

Modelling timed reactive systems from natural-language requirements

Contact Info

Product

Resources

About