407 search results - page 30 / 82 » Automatic Correctness Proofs for Logic Program Transformatio... |
TPHOL
2007
IEEE
14 years 1 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...
SIGMOD
2006
ACM
14 years 7 months ago
2006
ACM
In this paper we propose a type-based framework for using logic programming for XML processing. We transform XML documents into terms and DTDs into regular types. We implemented a ...
POPL
2012
ACM
12 years 3 months ago
2012
ACM
We present an analysis which takes as its input a sequential program, augmented with annotations indicating potential parallelization opportunities, and a sequential proof, writte...
ESOP
2003
Springer
14 years 27 days ago
2003
Springer
This paper proposes the use of constraint logic programming (CLP) to perform model checking of traditional, imperative programs. We present a semantics-preserving translation from ...
APLAS
2003
ACM
13 years 11 months ago
2003
ACM
Abstract. Much work has been done in verifying a compiler specification, both in hand-written and mechanical proofs. However, there is still a gap between a correct compiler specif...