Present and Absent Sets: Abstraction for Testing of Reactive Systems with Databases

Authors:
Petur Olsen;Kim G. Larsen;Arne Skou
Affiliations:
Department of Computer Science, Aalborg University, Aalborg, Denmark;Department of Computer Science, Aalborg University, Aalborg, Denmark;Department of Computer Science, Aalborg University, Aalborg, Denmark
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2010

Citing 4
Cited 0

Testing Concurrent Systems: A Formal Approach

CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Building test cases and oracles to automate the testing of web database applications

Information and Software Technology
Model based testing with labelled transition systems

Formal methods and testing
Testing real-time systems using UPPAAL

Formal methods and testing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new abstraction of reactive systems interacting with databases. This abstraction is intended to be used for model-based testing. We abstract the database into two sets: present set and absent set, and present a proof of this abstraction. We present two extensions of FSM, the DBFSM and PAFSM. DBFSM are a form of FSM incorporating databases. PAFSM are an abstraction of DBFSM using present-absent sets. Depending on what type of testing is to be done, the translation is tailored to fit this purpose. We show how this translation is related to the present-absent abstraction. Finally, we illustrate the approach through a small example and show how this can be used for testing with the model-based testing tool Uppaal TRON.