442 search results - page 11 / 89 » Proof Abstraction for Imperative Languages |
CASSIS
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. Abstract interpretation is a particularly well-suited methodology to build modular correctness proof of static analysers. Proof modularity becomes essential when correctn...
LPAR
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. The paper presents a combination of interactive and automatic tools in the area of software verification. We have integrated a newly developed software model checker int...
PPDP
2007
Springer
14 years 2 months ago
2007
Springer
We describe a semantic type soundness result, formalized in the Coq proof assistant, for a compiler from a simple imperative language with heap-allocated data into an idealized as...
IWFM
1998
13 years 10 months ago
1998
In this paper, we present a proof that the bitonic sort is sound using PVS, a powerful specification and verification environment. First, we briefly introduce this well-known para...
ICLP
2003
Springer
14 years 1 months ago
2003
Springer
Abstract logic programming is about designing logic programming languages via the proof theoretic notion of uniform provability. It allows the design of purely logical, very expres...