407 search results - page 32 / 82 » Automatic Correctness Proofs for Logic Program Transformatio... |
SSR
2001
13 years 9 months ago
2001
The visitor pattern is appealing to developers of program-analysis tools because it separates the design of the data structures that represent a program from the design of softwar...
CAV
1998
Springer
13 years 12 months ago
1998
Springer
As a pedagogical exercise in ACL2, we formalize and prove the correctness of a write invalidate cache scheme. In our formalization, an arbitrary number of processors, each with its...
INTERACTION
2009
ACM
14 years 2 months ago
2009
ACM
DTD and its instance have been considered the standard for data representation and information exchange format on the current web. However, when coming to the next generation of w...
ICDAR
2009
IEEE
14 years 2 months ago
2009
IEEE
In this paper, we make an attempt to use Inductive Logic Programming (ILP) to automatically learn non trivial descriptions of symbols, based on a formal description. This work is ...
SAS
2004
Springer
14 years 1 months ago
2004
Springer
Termination has been a subject of intensive research in the logic programming community for the last two decades. Most works deal with proving universal left termination of a given...