700 search results - page 111 / 140 » On Termination of Constraint Logic Programs |
123
click to vote
CADE
2005
Springer
15 years 11 months ago
2005
Springer
Two kinds of orderings are widely used in term rewriting and theorem proving, namely recursive path ordering (RPO) and Knuth-Bendix ordering (KBO). They provide powerful tools to p...
100
click to vote
KBSE
2005
IEEE
15 years 4 months ago
2005
IEEE
We present a new model checking algorithm for verifying computation tree logic (CTL) properties. Our technique is based on using language inference to learn the fixpoints necessar...
ICAI
2004
15 years 14 days ago
2004
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...
101
click to vote
ISSTA
2009
ACM
15 years 5 months ago
2009
ACM
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 ...
PEPM
2010
ACM
15 years 8 months ago
2010
ACM
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...