407 search results - page 53 / 82 » Automatic Correctness Proofs for Logic Program Transformatio... |
ENTCS
2008
13 years 7 months ago
2008
We formalize higher-order separation logic for a first-order imperative language with procedures and local variables in Isabelle/HOLCF. The assertion language is modeled in such a...
BIRTHDAY
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Loops and other unbound control structures constitute a major bottleneck in formal software verification, because correctness proofs over such control structures generall...
CADE
2011
Springer
12 years 7 months ago
2011
Springer
Android is a programming language based on Java and an operating system for embedded or mobile devices whose upper layers are written in that language. It features an extended even...
AMAST
1998
Springer
13 years 12 months ago
1998
Springer
Abstract. This paper proposes a tool to support reasoning about (partial) correctness of constraint logic programs. The tool infers a speci cation that approximates the semantics o...
IANDC
2008
13 years 7 months ago
2008
The main goal of this paper is to apply rewriting termination technology --enjoying a quite mature set of termination results and tools-- to the problem of proving automatically t...