Integration of Functional and Timed Testing of Real-Time and Concurrent Systems

Kuliamin, Victor V.; Petrenko, Alexander K.; Pakoulin, Nick V.; Kossatchev, A. S.; Burdonov, Igor

doi:10.1007/978-3-540-39866-0_45

Cited by 13 publications

(5 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Many formal testing frameworks use models such as (extended) Mealy machines (e.g., see [11,14,16]) or labeled transition systems (e.g., see [18,8,13]). These models are not well-suited for real-time systems.…”

Section: Introductionmentioning

confidence: 99%

An Expressive and Implementable Formal Framework for Testing Real-Time Systems

Krichen

Tripakis

2005

Lecture Notes in Computer Science

View full text Add to dashboard Cite

We propose a new framework for black-box conformance testing of real-time systems, based on the model of timed automata. The framework is expressive: it can fully handle partially-observable, nondeterministic timed automata. It also allows the user to define, through appropriate modeling, assumptions on the environment of the system under test (SUT) as well as on the interface between the tester and the SUT. The framework is implementable: tests can be implemented as finite-state machines accessing a finite-precision digital clock. We propose, for this framework, a set of test-generation algorithms with respect to different coverage criteria. We have implemented these algorithms in a prototype tool called TTG. Experimental results obtained by applying TTG on the Bounded Retransmission Protocol show that only a few tests suffice to cover thousands of reachable symbolic states in the specification.

show abstract

Section: Introductionmentioning

confidence: 99%

An Expressive and Implementable Formal Framework for Testing Real-Time Systems

Krichen

Tripakis

2005

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…• Testing of parallelism is based on interleaving semantics [9]. It is performed by gathering all the observed events (function calls, function returns, and others) and constructing a linear sequence of those events, in which all pre-and postconditions hold.…”

Section: Formal Approachesmentioning

confidence: 99%

Verification of Operating System Components

Kuliamin¹,

Petrenko²,

Хорошилов³

2017

View full text Add to dashboard Cite

The paper concerns recent advances in reaching the goal of industrial operating system (OS) verification. By industrial OS we mean a system actively used in some industrial domain, elaborated and maintained for a significant time, not a proof-of-concept OS developed with mostly research intentions. We consider decomposition of this goal into tasks related with various functional components of OS and various properties under verification, and application of different verification methods to those tasks. This is a trial to explicate and summarize the experience of several projects on various OS components and different OS features verification conducted in ISP RAS.

show abstract

“…The approach proposed in [13] allows usage of implicitly defined asynchronous finite state machines (AFSMs) for model-based testing of complex distributed systems. The implementation behavior is verified only in quiescent states of the FSM model.…”

Section: Related Workmentioning

confidence: 99%

Runtime Verification Based on Executable Models: On-the-Fly Matching of Timed Traces

Chupilko

Kamkin

2013

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

Runtime verification is checking whether a system execution satisfies or violates a given correctness property. A procedure that automatically, and typically on the fly, verifies conformance of the system's behavior to the specified property is called a monitor. Nowadays, a variety of formalisms are used to express properties on observed behavior of computer systems, and a lot of methods have been proposed to construct monitors. However, it is a frequent situation when advanced formalisms and methods are not needed, because an executable model of the system is available. The original purpose and structure of the model are out of importance; rather what is required is that the system and its model have similar sets of interfaces. In this case, monitoring is carried out as follows. Two "black boxes", the system and its reference model, are executed in parallel and stimulated with the same input sequences; the monitor dynamically captures their output traces and tries to match them. The main problem is that a model is usually more abstract than the real system, both in terms of functionality and timing. Therefore, trace-to-trace matching is not straightforward and allows the system to produce events in different order or even miss some of them. The paper studies on-the-fly conformance relations for timed systems (i.e., systems whose inputs and outputs are distributed along the time axis). It also suggests a practice-oriented methodology for creating and configuring monitors for timed systems based on executable models. The methodology has been successfully applied to a number of industrial projects of simulation-based hardware verification

show abstract

Integration of Functional and Timed Testing of Real-Time and Concurrent Systems

Cited by 13 publications

References 18 publications

An Expressive and Implementable Formal Framework for Testing Real-Time Systems

An Expressive and Implementable Formal Framework for Testing Real-Time Systems

Verification of Operating System Components

Runtime Verification Based on Executable Models: On-the-Fly Matching of Timed Traces

Contact Info

Product

Resources

About