07.01.2013 Views

Lecture Notes in Computer Science 3472

Lecture Notes in Computer Science 3472

Lecture Notes in Computer Science 3472

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

412 Axel Bel<strong>in</strong>fante, Lars Frantzen, and Christian Schallhart<br />

sponds to a path from one SDL-state to the follow<strong>in</strong>g next state. The result<strong>in</strong>g<br />

test suite is expressed <strong>in</strong> TTCN.<br />

Summary<br />

TVEDA was successfully applied to several protocol implementations, mostly<br />

specified <strong>in</strong> SDL. Meanwhile it has partly found it’s way <strong>in</strong>to TestComposer,<br />

which is addressed <strong>in</strong> section 14.2.14. Most of its underly<strong>in</strong>g empirical pr<strong>in</strong>ciples<br />

were later justified theoretically <strong>in</strong> terms of well elaborated I/O theories, see<br />

[Pha94b].<br />

Related Papers<br />

• Underly<strong>in</strong>g Theory: [CGPT96, Pha94b]<br />

14.2.8 AsmL Test Tool<br />

Introduction<br />

At the beg<strong>in</strong>n<strong>in</strong>g of the n<strong>in</strong>eties the concept of Evolv<strong>in</strong>g Algebra came up<br />

due to the work of Yuri Gurevich [Gur94]. He was driven by the ambition to<br />

develop a computation model which is capable of describ<strong>in</strong>g any algorithm at its<br />

appropriate abstraction level. Based on simple notions from universal algebra an<br />

algorithm is modeled as an evolution of algebras. The underly<strong>in</strong>g set corresponds<br />

to the mach<strong>in</strong>es memory and the algebra transformation is controlled by a small<br />

selection of <strong>in</strong>structions. Later on Evolv<strong>in</strong>g Algebra was renamed to Abstract<br />

State Mach<strong>in</strong>e, shortASM. ASMs have been used for def<strong>in</strong><strong>in</strong>g the semantics<br />

of programm<strong>in</strong>g languages and extended <strong>in</strong> several directions like deal<strong>in</strong>g with<br />

parallelism. See the ASM Homepage [ASMa] for detailed <strong>in</strong>formation.<br />

At Microsoft Research a group called Foundations of Software Eng<strong>in</strong>eer<strong>in</strong>g<br />

[MSF] is develop<strong>in</strong>g the Abstract State Mach<strong>in</strong>e Language, shortAsmL,<br />

which is a .NET language and therefore embedded <strong>in</strong>to Microsoft’s .NET framework<br />

and development environment. Based on ASMs it is aimed at specify<strong>in</strong>g<br />

systems <strong>in</strong> an object-oriented manner. AsmL and the .NET framework can be<br />

freely downloaded at [ASMb].<br />

Test Generation Process<br />

AsmL has a conformance test facility <strong>in</strong>cluded which is based on two steps.<br />

Firstly the specification ASM is transformed <strong>in</strong>to an FSM before subsequently<br />

well known FSM-based algorithms (rural Ch<strong>in</strong>ese postman tour, see Part II of<br />

this book) are applied to generate a test suite. The whole test<strong>in</strong>g process is<br />

bounded by the .NET framework, hence the SUT must be written <strong>in</strong> a .NET<br />

language. The ASM specification is aimed at describ<strong>in</strong>g the behavior of the SUT,<br />

abstract<strong>in</strong>g away from implementation details.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!