Specifying and Generating Test Cases Using Observer Automata

Blom, Johan; Hessel, Anders; Jönsson, Bengt; Pettersson, Paul

doi:10.1007/978-3-540-31848-4_9

Cited by 38 publications

(38 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…5 we omitted the operations labeling the CFA edges. For each entry of a basic block, i.e., CFA edges (2, 5), (4,5), (6, 7), (8,11), and (10, 11), there is a respective automaton.…”

Section: Test-goal Automatamentioning

confidence: 99%

“…An extension of BLAST embeds path automata in a relational querying language, for specifying safety verification problems [4,5], but not test coverage, as a set of single-goal reachability queries. In a model-based setting, automata-based specifications of coverage were presented by Blom et al [8] for test-case generation using the model checker UPPAAL [23]. In contrast to directed testing [12] -where 'directed' means directed by branching conditions and randomization-the directedness in our approach stems from user-defined coverage specifications which separate the control from algorithmic issues.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Information Reuse for Multi-goal Reachability Analyses

Beyer

Holzer

Tautschnig

et al. 2013

Programming Languages and Systems

View full text Add to dashboard Cite

Abstract.It is known that model checkers can generate test inputs as witnesses for reachability specifications (or, equivalently, as counterexamples for safety properties). While this use of model checkers for testing yields a theoretically sound test-generation procedure, it scales poorly for computing complex test suites for large sets of test goals, because each test goal requires an expensive run of the model checker. We represent test goals as automata and exploit relations between automata in order to reuse existing reachability information for the analysis of subsequent test goals. Exploiting the sharing of sub-automata in a series of reachability queries, we achieve considerable performance improvements over the standard approach. We show the practical use of our multi-goal reachability analysis in a predicate-abstraction-based test-input generator for the test-specification language FQL.

show abstract

“…5 we omitted the operations labeling the CFA edges. For each entry of a basic block, i.e., CFA edges (2, 5), (4,5), (6, 7), (8,11), and (10, 11), there is a respective automaton.…”

Section: Test-goal Automatamentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Information Reuse for Multi-goal Reachability Analyses

Beyer

Holzer

Tautschnig

et al. 2013

Programming Languages and Systems

View full text Add to dashboard Cite

show abstract

“…The concept of these so-called observer automata is an often-used approach to simplify model checking tasks and solve complex questions (see e.g. [11]). …”

Section: Related Workmentioning

confidence: 99%

Tool-assisted verification of behaviour networks

Armbrust

Kiekbusch

Ropertz

et al. 2013

2013 IEEE International Conference on Robotics and Automation

View full text Add to dashboard Cite

Abstract-This paper deals with the problem of assisting developers when verifying properties of complex behaviourbased systems. A central aspect of behaviour-based systems is the interaction between the behaviours, as a lot of the functionality of a system typically arises from this interaction. Hence, verification has to deal with the specialities of behaviour interaction. Previous work has introduced a concept for modelling behaviour-based systems as networks of finite-state automata and for applying model checking as verification technique. As the manual verification of large networks is tedious and errorprone, the work at hand introduces a concept for assisting developers by partly automating the verification process. The applicability of the presented approach is demonstrated using the behaviour-based control system of an autonomous bucket excavator.

show abstract

“…Blom et al [12] and Hong et al [13] extend this idea by formalizing standard coverage criteria (all-definitions, all-uses, etc.) using observers (or temporal logic).…”

Section: Comparison To Related Workmentioning

confidence: 99%

Integrating formal verification and conformance testing for reactive systems

Constant

Jéron

Marchand

et al. 2007

IIEEE Trans. Software Eng.

View full text Add to dashboard Cite

Abstract-In this paper, we describe a methodology integrating verification and conformance testing. A specification of a systeman extended input-output automaton, which may be infinite-state-and a set of safety properties ("nothing bad ever happens") and possibility properties ("something good may happen") are assumed. The properties are first tentatively verified on the specification using automatic techniques based on approximated state-space exploration, which are sound, but, as a price to pay for automation, are not complete for the given class of properties. Because of this incompleteness and of state-space explosion, the verification may not succeed in proving or disproving the properties. However, even if verification did not succeed, the testing phase can proceed and provide useful information about the implementation. Test cases are automatically and symbolically generated from the specification and the properties and are executed on a black-box implementation of the system. The test execution may detect violations of conformance between implementation and specification; in addition, it may detect violation/satisfaction of the properties by the implementation and by the specification. In this sense, testing completes verification. The approach is illustrated on simple examples and on a Bounded Retransmission Protocol.

show abstract

Specifying and Generating Test Cases Using Observer Automata

Cited by 38 publications

References 24 publications

Information Reuse for Multi-goal Reachability Analyses

Information Reuse for Multi-goal Reachability Analyses

Tool-assisted verification of behaviour networks

Integrating formal verification and conformance testing for reactive systems

Contact Info

Product

Resources

About