A Random Testing Approach Using Pushdown Automata
From MaRDI portal
Publication:3012968
DOI10.1007/978-3-642-21768-5_10zbMath1335.68055OpenAlexW4392275196MaRDI QIDQ3012968
Catherine Masson, Pierre-Cyrille Héam
Publication date: 7 July 2011
Published in: Tests and Proofs (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01088712/file/STVR-Hal.pdf
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Random generation of words in an algebraic language in linear binary space
- Uniform random generation of decomposable structures using floating-point arithmetic
- Uniform Random Generation of Strings in a Context-Free Language
- Controllable Combinatorial Coverage in Grammar-Based Testing
- Introduction to Software Testing
- A sentence generator for testing parsers
- FM 2005: Formal Methods
This page was built for publication: A Random Testing Approach Using Pushdown Automata