IF: A Validation Environment for Timed Asynchronous Systems

Bozga, Marius; Fernandez, Jean-Claude; Ghirvu, Lucian; Graf, Susanne; Krimm, Jean-Pierre; Mounier, Laurent

doi:10.1007/10722167_41

Cited by 28 publications

(14 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The results of the exhaustive generation for various depth levels are shown in Table 1. Depth levels are ranging from 1 to 12. Column "depth" shows the depth of the generated tests (i.e., the length of the longest path from the root to a leaf).…”

Section: Automatic Test Generation With Ttgmentioning

confidence: 99%

See 1 more Smart Citation

Black-Box Conformance Testing for Real-Time Systems

Krichen

Tripakis

2004

Lecture Notes in Computer Science

148

View full text Add to dashboard Cite

We propose a new framework for black-box conformance testing of real-time systems. The framework is based on the model of partially-observable, non-deterministic timed automata. We argue that partial observability and non-determinism are essential features for ease of modeling, expressiveness and implementability. The framework 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. We consider two types of tests: analog-clock tests and digital-clock tests. Our algorithm for generating analog-clock tests is based on an on-the-fly determinization of the specification automaton during the execution of the test, which in turn relies on reachability computations. The latter can sometimes be costly, thus problematic, since the tester must quickly react to the actions of the system under test. Therefore, we provide techniques which allow analog-clock testers to be represented as deterministic timed automata, thus minimizing the reaction time to a simple state jump. We also provide algorithms for static or on-the-fly generation of digital-clock tests. These tests measure time only with finite-precision, digital clocks, another essential condition for implementability. We also propose a technique for location, edge and state coverage of the specification, by reducing the problem to covering a symbolic reachability graph. This avoids having to generate too many tests. We report on a prototype tool called TTG and two case studies: a lighting device and the Bounded Retransmission Protocol. 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: Automatic Test Generation With Ttgmentioning

confidence: 99%

“…TTG is implemented on top of the IF environment [12]. We have experimented with TTG on a few case studies, including the execution software of the K9 Rover by NASA [15,5] and the Bounded Retransmission Protocol [27,36].…”

Section: Introductionmentioning

confidence: 99%

Black-Box Conformance Testing for Real-Time Systems

Krichen

Tripakis

2004

Lecture Notes in Computer Science

148

View full text Add to dashboard Cite

show abstract

“…These languages are not ad-hoc or user-oriented, but they suitable for parsers and for algorithms. This approach was originally followed by the SPECS [19] and SEDOS [3] projects and, more recently in IF [1] Veritech, [14], BAN-DERA [12] and in the toolset CADP [10]. Another related approach to integrating tools is the use of XML [6] which has recently produced the definition and implementation of the intermediate language of interchange PiXL [7].…”

Section: Introductionmentioning

confidence: 99%

On-the-fly model checking for C programs with extended CADP in FMICS-jETI

Gallardo

Merino

Sanán

et al. 2007

12th IEEE International Conference on Engineering Complex Computer Systems (ICECCS 2007)

View full text Add to dashboard Cite

show abstract

“…The IF Validation Framework [4] also provides a slicing capability for the IF modeling language which is similar to Promela in its level of abstraction. In a case-study of using IF to verify properties of the MASCARA protocol for a wireless asynchronous transfer protocol, Graf and Jia [24] report reductions from 1-2 orders of magnitude for four different properties of the protocol while acknowledging that it is difficult to make general conclusions about the effectiveness of slicing since amount of reduction depends significantly on the particular property and system considered.…”

Section: Related Workmentioning

confidence: 99%

Evaluating the Effectiveness of Slicing for Model Reduction of Concurrent Object-Oriented Programs

Dwyer

Hatcliff

Hoosier

et al. 2006

Tools and Algorithms for the Construction and Analysis of Systems

View full text Add to dashboard Cite

Model checking techniques have proven effective for checking a number of non-trivial concurrent object-oriented software systems. However, due to the high computational and memory costs, a variety of model reduction techniques are needed to overcome current limitations on applicability and scalability. Conventional wisdom holds that static program slicing can be an effective model reduction technique, yet anecdotal evidence is mixed, and there has been no work that has systematically studied the costs/benefits of slicing for model reduction in the context of model checking source code for realistic systems. In this paper, we present an overview of the sophisticated Indus program slicer that is capable of handling full Java and is readily applicable to interesting off-the-shelf concurrent Java programs. Using the Indus program slicer as part of the next generation of the Bandera model checking framework, we experimentally demonstrate significant benefits from using slicing as a fully automatic model reduction technique. Our experimental results consider a number of Java systems with varying structural properties, the effects of combining slicing with other well-known model reduction techniques such as partial order reductions, and the effects of slicing for different classes of properties. Our conclusions are that slicing concurrent object-oriented source code provides significant reductions that are orthogonal to a number of other reduction techniques, and that slicing should always be applied due to its automation and low computational costs.

show abstract

IF: A Validation Environment for Timed Asynchronous Systems

Cited by 28 publications

References 16 publications

Black-Box Conformance Testing for Real-Time Systems

Black-Box Conformance Testing for Real-Time Systems

On-the-fly model checking for C programs with extended CADP in FMICS-jETI

Evaluating the Effectiveness of Slicing for Model Reduction of Concurrent Object-Oriented Programs

Contact Info

Product

Resources

About