442 search results - page 2 / 89 » Proof Abstraction for Imperative Languages |
PLDI
1993
ACM
13 years 9 months ago
1993
ACM
ESOP
1992
Springer
13 years 9 months ago
1992
Springer
We have designed, implemented, and proved the correctness of a compiler generator that accepts action semantic descriptions of imperative programming languages. The generated comp...
ICALP
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. We present a Hoare logic for a simple imperative whilelanguage with stored commands, ie. stored parameterless procedures. Stores that may contain procedures are called hi...
ICFP
2009
ACM
14 years 6 months ago
2009
ACM
We present a new approach for constructing and verifying higherorder, imperative programs using the Coq proof assistant. We build on the past work on the Ynot system, which is bas...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
In this paper, we build an interpreter by reusing host language functions instead of recoding mechanisms of function application that are already available in the host language (t...