Gast: Generic Automated Software Testing

Koopman, Pieter; Alimarine, Artem; Tretmans, Jan; Plasmeijer, Rinus

doi:10.1007/3-540-44854-3_6

Cited by 45 publications

(33 citation statements)

References 19 publications

(20 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Test data generation has received comparatively less attention than for imperative languages. The majority of existing tools for functional programs are based on black-box testing [6,18]. Test cases for logic programs are obtained in [24] by first computing constraints on the input arguments that correspond to execution paths of logic programs and then solving these constraints to obtain test inputs for the corresponding paths.…”

Section: Conclusion and Related Workmentioning

confidence: 99%

Test Data Generation of Bytecode by CLP Partial Evaluation

Albert

Gómez-Zamalloa

Puebla

2009

Logic-Based Program Synthesis and Transformation

View full text Add to dashboard Cite

Abstract. We employ existing partial evaluation (PE) techniques developed for Constraint Logic Programming (CLP) in order to automatically generate test-case generators for glass-box testing of bytecode. Our approach consists of two independent CLP PE phases. (1) First, the bytecode is transformed into an equivalent (decompiled) CLP program. This is already a well studied transformation which can be done either by using an ad-hoc decompiler or by specialising a bytecode interpreter by means of existing PE techniques. (2) A second PE is performed in order to supervise the generation of test-cases by execution of the CLP decompiled program. Interestingly, we employ control strategies previously defined in the context of CLP PE in order to capture coverage criteria for glass-box testing of bytecode. A unique feature of our approach is that, this second PE phase allows generating not only test-cases but also test-case generators. To the best of our knowledge, this is the first time that (CLP) PE techniques are applied for test-case generation as well as to generate test-case generators.

show abstract

Section: Conclusion and Related Workmentioning

confidence: 99%

Test Data Generation of Bytecode by CLP Partial Evaluation

Albert

Gómez-Zamalloa

Puebla

2009

Logic-Based Program Synthesis and Transformation

View full text Add to dashboard Cite

show abstract

“…This does not seem too far-fetched. An idea is to extend the GAST-system (see [11]) for this purpose. With GAST, it is possible to automatically generate valid values for the quantified variables and test the property on these values.…”

Section: Strictness and Logical Propertiesmentioning

confidence: 99%

Proof Tool Support for Explicit Strictness

Eekelen

Mol

2006

Implementation and Application of Functional Languages

View full text Add to dashboard Cite

Abstract. In programs written in lazy functional languages such as for example Clean and Haskell, the programmer can choose freely whether particular subexpressions will be evaluated lazily (the default) or strictly (must be specified explicitly). It is widely known that this choice affects program behavior, resource consumption and semantics in several ways. However, not much experience is available about the impact on logical program properties and formal reasoning. This paper aims to give a better understanding of the concept of explicit strictness. The impact of explicit strictness on formal reasoning will be investigated. It will be shown that this impact is bigger than expected and that tool support is needed for formal reasoning in the context of explicit strictness. We introduce the various ways in which strictness specific support is offered by the proof assistant Sparkle.

show abstract

“…So far, the technique has been successfully used to define functions like equality, map, foldr, as well as for the construction of various parsers and pretty printers. Also, generic programming techniques play an important role in the implementation of automatic test systems [17]. The use of generic programming techniques for the creation of GUI applications has to our knowledge never been done before.…”

Section: Generic Functionsmentioning

confidence: 99%

Generic Graphical User Interfaces

Achten

Eekelen

Plasmeijer

2004

Implementation of Functional Languages

Self Cite

View full text Add to dashboard Cite

Abstract. It is important to be able to program GUI applications in a fast and easy manner. Current GUI tools for creating visually attractive applications offer limited functionality. In this paper we introduce a new, easy to use method to program GUI applications in a pure functional language such as Clean or Generic Haskell. The method we use is a refined version of the model-view paradigm. The basic component in our approach is the Graphical Editor Component (GECτ ) that can contain any value of any flat data type τ and that can be freely used to display and edit its value. GEC τ s can depend on others, but also on themselves. They can even be mutually dependent. With these components we can construct a flexible, reusable and customizable editor. For the realization of the components we had to invent a new generic implementation technique for interactive applications.

show abstract

Gast: Generic Automated Software Testing

Cited by 45 publications

References 19 publications

Test Data Generation of Bytecode by CLP Partial Evaluation

Test Data Generation of Bytecode by CLP Partial Evaluation

Proof Tool Support for Explicit Strictness

Generic Graphical User Interfaces

Contact Info

Product

Resources

About