Test Data Generation of Bytecode by CLP Partial Evaluation
From MaRDI portal
Publication:3617426
DOI10.1007/978-3-642-00515-2_2zbMath1185.68146OpenAlexW1524434267MaRDI QIDQ3617426
Miguel Gómez-Zamalloa, Elvira Albert, Germán Puebla
Publication date: 24 March 2009
Published in: Logic-Based Program Synthesis and Transformation (Search for Journal in Brave)
Full work available at URL: http://oa.upm.es/5697/
Related Items (2)
CPBPV: a constraint-programming framework for bounded program verification ⋮ Test case generation for object-oriented imperative languages in CLP
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A general criterion for avoiding infinite unfolding during partial deduction
- Symbolic execution and program testing
- Symbolic Testing and the DISSECT Symbolic Evaluation System
- Efficient Local Unfolding with Ancestor Stacks for Full Prolog
- A Flexible, (C)LP-Based Approach to the Analysis of Object-Oriented Programs
This page was built for publication: Test Data Generation of Bytecode by CLP Partial Evaluation