96 search results - page 10 / 20 » An Optimization for Reasoning with Forest Logic Programs |
CORR
2010
Springer
13 years 8 months ago
2010
Springer
The goal of this lecture is to show how modern theorem provers--in this case, the Coq proof assistant--can be used to mechanize the specification of programming languages and their...
TPHOL
2007
IEEE
14 years 2 months ago
2007
IEEE
Cminor is a mid-level imperative programming language; there are proved-correct optimizing compilers from C to Cminor and from Cminor to machine language. We have redesigned Cminor...
APLAS
2000
ACM
14 years 6 days ago
2000
ACM
We have implemented Kima, an automated error correction system for concurrent logic programs. Kima corrects near-misses such as wrong variable occurrences in the absence of explici...
POPL
2004
ACM
14 years 8 months ago
2004
ACM
We show how some classical static analyses for imperative programs, and the optimizing transformations which they enable, may be expressed and proved correct using elementary logi...
LOPSTR
2005
Springer
14 years 1 months ago
2005
Springer
Partial evaluation of logic programs which contain impure predicates poses non-trivial challenges. Impure predicates include those which produce side-effects, raise errors (or exc...