Automatically testing interactive applications using extended task trees

DOI10.1016/J.JLAP.2009.01.005MaRDI QIDQ2270687zbMATH OpenOpenAlexFDO

Authors Laya Madani, Ioannis Parissis

Publication date 29 July 2009

Published in The Journal of Logic and Algebraic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jlap.2009.01.005

zbMATH Keywords

interactive software testingmodel-based testingprobabilistic FSMtask treestest data generation

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites work

• An experience in proving regular networks of processes by modular model checking
• Automatically testing interactive applications using extended task trees
• Customized Testing for Probabilistic Systems
• Derivation of a Suitable Finite Test Suite for Customized Probabilistic Systems
• scientific article; zbMATH DE number 1382813 (Why is no real title available?)
• scientific article; zbMATH DE number 1390244 (Why is no real title available?)

Cited in

(1)

• Automatically testing interactive applications using extended task trees

Describes a project that uses

Uses Software

• Lutess
• LUSTRE

This page was built for publication: Automatically testing interactive applications using extended task trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2270687)