Lindenmayer grammars and symbolic testing
From MaRDI portal
Publication:1244821
DOI10.1016/0020-0190(78)90036-4zbMath0373.68047OpenAlexW2078621155MaRDI QIDQ1244821
Publication date: 1978
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(78)90036-4
Related Items
A structural test selection criterion, Two notions of correctness and their relation to testing, Extended linear macro grammars, iteration grammars, and register programs, A probabilistic remark on algebraic program testing
Cites Work
- Unnamed Item
- Unnamed Item
- On the decidability of the sequence equivalence problem for DOL-systems
- L systems
- Methodology for the Generation of Program Test Data
- Symbolic execution and program testing
- Symbolic Testing and the DISSECT Symbolic Evaluation System
- The decidability of the equivalence problem for DOL-systems