Sciweavers

1461 search results - page 169 / 293
» Analysis of Constraint Logic Programs
Sort
View
ICAI
2004
14 years 11 months ago
Automatic Generation of English-language Steps in Puzzle Solving
This paper shows how to generate an English step-by-step explanation that describes how an automated reasoning system solves a complex logic program. We limit our attention to pro...
Hemantha Ponnuru, Raphael A. Finkel, Victor W. Mar...
ISSTA
2009
ACM
15 years 4 months ago
Precise pointer reasoning for dynamic test generation
Dynamic test generation consists of executing a program while gathering symbolic constraints on inputs from predicates encountered in branch statements, and of using a constraint ...
Bassem Elkarablieh, Patrice Godefroid, Michael Y. ...
EMSOFT
2009
Springer
15 years 4 months ago
Probabilistic modeling of data cache behavior
In this paper, we propose a formal analysis approach to estimate the expected (average) data cache access time of an application across all possible program inputs. Towards this g...
Vinayak Puranik, Tulika Mitra, Y. N. Srikant
COMPSAC
2005
IEEE
15 years 3 months ago
Goal-Oriented Test Data Generation for Programs with Pointer Variables
Automatic test data generation leads to the identification of input values on which a selected path or a selected branch is executed within a program (path-oriented vs goalorient...
Arnaud Gotlieb, Tristan Denmat, Bernard Botella
PEPM
2010
ACM
15 years 7 months ago
PET: a partial evaluation-based test case generation tool for Java bytecode
PET is a prototype Partial Evaluation-based Test case generation tool for a subset of Java bytecode programs. It performs white-box test generation by means of two consecutive Par...
Elvira Albert, Miguel Gómez-Zamalloa, Germ&...