150 search results - page 9 / 30 » The Applicability of Logic Program Analysis and Transformati... |
TPHOL
1997
IEEE
13 years 12 months ago
1997
IEEE
This note lists references which address –in some way or another– the problems relating to formal manipulation of logical expressions where terms can fail to denote. Reference...
CADE
2007
Springer
14 years 8 months ago
2007
Springer
Abstract. It has often been claimed that model checking, special purpose automated deduction or interactive theorem proving are needed for formal program development. Recently, it ...
LOPSTR
1994
Springer
13 years 12 months ago
1994
Springer
We present a goal replacement rule whose main applicability condition is based on termination properties of the resulting transformed program. The goal replacement rule together wi...
ALP
1990
Springer
13 years 11 months ago
1990
Springer
Conditional Equational Programming is an elegant way to uniformly integrate important features of functional and logic programming. Efficientmethods for equation solving are thus ...
ATVA
2004
Springer
13 years 11 months ago
2004
Springer
While model checking suffers from the state space explosion problem, theorem proving is quite tedious and impractical for verifying complex designs. In this work, we present a veri...